github.com/google/licensecheck/internal/match.reSyntax.sub (field)

23 uses

	github.com/google/licensecheck/internal/match (current package)
		rematch.go#L300: 		endIndex := len(re.sub)
		rematch.go#L302: 			for endIndex > 0 && canMatchEmpty(re.sub[endIndex-1]) {
		rematch.go#L306: 		for i, sub := range re.sub {
		rematch.go#L316: 		c.compile(re.sub[0])
		rematch.go#L328: 		for i, sub := range re.sub {
		rematch.go#L329: 			if i+1 < len(re.sub) {
		rematch.go#L337: 			if i+1 < len(re.sub) {
		rematch.go#L439: 		for _, sub := range re.sub {
		rematch.go#L447: 		for _, sub := range re.sub {
		resyntax.go#L65: 	sub []*reSyntax // subexpressions (opConcat, opAlternate, opWild, opQuest)
		resyntax.go#L119: 		if len(re.sub) == 0 {
		resyntax.go#L122: 		for i, sub := range re.sub {
		resyntax.go#L132: 		for i, sub := range re.sub {
		resyntax.go#L144: 		sub := re.sub[0]
		resyntax.go#L438: 	p.stack[n-1] = &reSyntax{op: opQuest, sub: []*reSyntax{sub}}
		resyntax.go#L485: 			re.sub = append(re.sub, sub.sub...)
		resyntax.go#L487: 			re.sub = append(re.sub, sub)
		resyntax.go#L519: 		list := re.sub[0].leadingPhrases()
		resyntax.go#L531: 		for _, sub := range re.sub {
		resyntax.go#L543: 		for _, sub := range re.sub {