type splitter … type splitterOption … type initialismMatch … type initialismMatches … type matchesPool … type buffersPool … type lexemsPool … type splittersPool … var poolOfMatches … var poolOfBuffers … var poolOfLexems … var poolOfSplitters … // nameReplaceTable finds a word representation for special characters. func nameReplaceTable(r rune) (string, bool) { … } // split calls the splitter. // // Use newSplitter for more control and options func split(str string) []string { … } func newSplitter(options ...splitterOption) splitter { … } // withPostSplitInitialismCheck allows to catch initialisms after main split process func withPostSplitInitialismCheck(s *splitter) { … } func (p matchesPool) BorrowMatches() *initialismMatches { … } func (p buffersPool) BorrowBuffer(size int) *bytes.Buffer { … } func (p lexemsPool) BorrowLexems() *[]nameLexem { … } func (p splittersPool) BorrowSplitter(options ...splitterOption) *splitter { … } func (p matchesPool) RedeemMatches(s *initialismMatches) { … } func (p buffersPool) RedeemBuffer(s *bytes.Buffer) { … } func (p lexemsPool) RedeemLexems(s *[]nameLexem) { … } func (p splittersPool) RedeemSplitter(s *splitter) { … } func (m initialismMatch) isZero() bool { … } func (s splitter) split(name string) *[]nameLexem { … } func (s splitter) gatherInitialismMatches(nameRunes []rune) *initialismMatches { … } func (s splitter) mapMatchesToNameLexems(nameRunes []rune, matches *initialismMatches) *[]nameLexem { … } func (s splitter) breakInitialism(original string) nameLexem { … } func (s splitter) appendBrokenDownCasualString(segments *[]nameLexem, str []rune) { … } // isEqualFoldIgnoreSpace is the same as strings.EqualFold, but // it ignores leading and trailing blank spaces in the compared // string. // // base is assumed to be composed of upper-cased runes, and be already // trimmed. // // This code is heavily inspired from strings.EqualFold. func isEqualFoldIgnoreSpace(base []rune, str string) bool { … }
Codebase Browser
kubernetes