type github.com/google/licensecheck/internal/match.WordID

24 uses

	github.com/google/licensecheck/internal/match (current package)
		dict.go#L22: 	dict map[string]WordID // dict maps word to index in list
		dict.go#L27: type WordID int32
		dict.go#L30: const BadWord WordID = -1
		dict.go#L33: const AnyWord WordID = -2
		dict.go#L37: func (d *Dict) Insert(w string) WordID {
		dict.go#L43: 		d.dict = make(map[string]WordID)
		dict.go#L45: 	id = WordID(len(d.list))
		dict.go#L56: func (d *Dict) Lookup(w string) WordID {
		dict.go#L72: 	ID WordID
		regexp.go#L113: type phrase [2]WordID
		rematch.go#L567: func (s nfaState) next(prog reProg, w WordID) nfaState {
		rematch.go#L575: 			if w == WordID(inst.arg) {
		rematch.go#L605: func (s nfaState) words(prog reProg) []WordID {
		rematch.go#L606: 	var words []WordID
		rematch.go#L622: 				if w == WordID(inst.arg) {
		rematch.go#L626: 			words = append(words, WordID(inst.arg))
		rematch.go#L758: 			w := WordID(dfa[i])
		rematch.go#L832: 		if len(delta) > 0 && WordID(delta[0]) == AnyWord {
		rematch.go#L838: 			if WordID(delta[j]) == w {
		rematch.go#L858: 			dw, dnext := WordID(delta[j]), delta[j+1]
		rematch.go#L879: 					dw2, dnext2 := WordID(delta2[j2]), delta2[j2+1]
		rematch.go#L950: func sortWordIDs(x []WordID) {
		resyntax.go#L66: 	w   []WordID    // words (opWords)
		resyntax.go#L363: 		p.stack = append(p.stack, &reSyntax{op: opWords, w: []WordID{last.ID}})