github.com/google/licensecheck/internal/match.Match.Start (field)
16 uses
github.com/google/licensecheck/internal/match (current package)
regexp.go#L185: Start int // word index of start of match
regexp.go#L204: m.List = append(m.List, Match{ID: int(match), Start: i - 1, End: end})
github.com/google/licensecheck
scan.go#L133: matches.List = append(matches.List, match.Match{Start: len(words), ID: -1})
scan.go#L136: if m.Start < len(words) && lastEnd < m.Start && copyright >= 0 {
scan.go#L137: limit := m.Start - maxCopyrightWords
scan.go#L141: for i := limit; i < m.Start; i++ {
scan.go#L143: m.Start = i
scan.go#L150: for i := lastEnd; i < m.Start; i++ {
scan.go#L156: if u := urlScanRE.FindIndex(text[w.Lo:]); u != nil && (m.Start == len(words) || int(w.Lo)+u[1] <= int(words[m.Start].Lo)) {
scan.go#L167: for i < m.Start && int(words[i].Hi) <= u1 {
scan.go#L181: start := int(words[m.Start].Lo) // byte offset (unlike m.Start)
scan.go#L182: if m.Start == 0 {
scan.go#L185: prev := int(words[m.Start-1].Hi)
scan.go#L206: total += m.End - m.Start
![]() |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64) Golds is a Go 101 project developed by Tapir Liu. PR and bug reports are welcome and can be submitted to the issue list. Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |