type matcher … type filterMatch … type simpleMatch … type alternationMatch … var matchMutex … func allMatcher() *matcher { … } func newMatcher(matchString func(pat, str string) (bool, error), patterns, name, skips string) *matcher { … } func (m *matcher) fullName(c *common, subname string) (name string, ok, partial bool) { … } // clearSubNames clears the matcher's internal state, potentially freeing // memory. After this is called, T.Name may return the same strings as it did // for earlier subtests. func (m *matcher) clearSubNames() { … } func (m simpleMatch) matches(name []string, matchString func(pat, str string) (bool, error)) (ok, partial bool) { … } func (m simpleMatch) verify(name string, matchString func(pat, str string) (bool, error)) error { … } func (m alternationMatch) matches(name []string, matchString func(pat, str string) (bool, error)) (ok, partial bool) { … } func (m alternationMatch) verify(name string, matchString func(pat, str string) (bool, error)) error { … } func splitRegexp(s string) filterMatch { … } // unique creates a unique name for the given parent and subname by affixing it // with one or more counts, if necessary. func (m *matcher) unique(parent, subname string) string { … } // parseSubtestNumber splits a subtest name into a "#%02d"-formatted int32 // suffix (if present), and a prefix preceding that suffix (always). func parseSubtestNumber(s string) (prefix string, nn int32) { … } // rewrite rewrites a subname to having only printable characters and no white // space. func rewrite(s string) string { … } func isSpace(r rune) bool { … }
Codebase Browser
go