HomeSort by relevance Sort by last modified time
    Searched refs:matchcap (Results 1 - 5 of 5) sorted by null

  /prebuilts/go/darwin-x86/src/regexp/
exec.go 46 matchcap []int // capture information for the match
84 m.matchcap = make([]int, ncap)
92 m.matchcap = m.matchcap[:ncap]
104 t.cap = make([]int, len(m.matchcap), cap(m.matchcap))
112 // If so, m.matchcap holds the submatch information.
119 for i := range m.matchcap {
120 m.matchcap[i] = -1
157 if len(m.matchcap) > 0
    [all...]
backtrack.go 282 if !m.matched || (longest && pos > 0 && pos > m.matchcap[1]) {
283 copy(m.matchcap, b.cap)
323 m.matchcap = m.matchcap[:ncap]
324 for i := range m.matchcap {
325 m.matchcap[i] = -1
  /prebuilts/go/linux-x86/src/regexp/
exec.go 46 matchcap []int // capture information for the match
84 m.matchcap = make([]int, ncap)
92 m.matchcap = m.matchcap[:ncap]
104 t.cap = make([]int, len(m.matchcap), cap(m.matchcap))
112 // If so, m.matchcap holds the submatch information.
119 for i := range m.matchcap {
120 m.matchcap[i] = -1
157 if len(m.matchcap) > 0
    [all...]
backtrack.go 282 if !m.matched || (longest && pos > 0 && pos > m.matchcap[1]) {
283 copy(m.matchcap, b.cap)
323 m.matchcap = m.matchcap[:ncap]
324 for i := range m.matchcap {
325 m.matchcap[i] = -1
  /external/regex-re2/re2/
onepass.cc 226 const char* matchcap[kMaxCap]; local
228 matchcap[i] = NULL;
252 matchcap[0] = bp;
298 matchcap[i] = cap[i];
300 ApplyCaptures(matchcond, p, matchcap, ncap);
301 matchcap[1] = p;
328 matchcap[i] = cap[i];
329 matchcap[1] = p;
338 match[i].set(matchcap[2*i], matchcap[2*i+1] - matchcap[2*i])
    [all...]

Completed in 615 milliseconds