- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for Submatch (0.18 sec)
-
pilot/pkg/model/virtualservice.go
// otherwise it conflicts for _, subMatch := range delegate { foundMatch := false for _, rootMatch := range root { if hasConflict(rootMatch, subMatch) { log.Warnf("HTTPMatchRequests conflict: root %v, delegate %v", rootMatch, subMatch) continue } // merge HTTPMatchRequest out = append(out, mergeHTTPMatchRequest(rootMatch, subMatch)) foundMatch = true } if !foundMatch {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sat Mar 30 11:17:03 UTC 2024 - 17.4K bytes - Viewed (0) -
src/regexp/regexp.go
// // If 'Submatch' is present, the return value is a slice identifying the // successive submatches of the expression. Submatches are matches of // parenthesized subexpressions (also known as capturing groups) within the // regular expression, numbered from left to right in order of opening // parenthesis. Submatch 0 is the match of the entire expression, submatch 1 is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 38.5K bytes - Viewed (0) -
src/regexp/find_test.go
package regexp import ( "fmt" "strings" "testing" ) // For each pattern/text pair, what is the expected output of each function? // We can derive the textual results from the indexed results, the non-submatch // results from the submatched results, the single results from the 'all' results, // and the byte results from the string results. Therefore the table includes // only the FindAllStringSubmatchIndex result.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 11 15:28:50 UTC 2021 - 16.3K bytes - Viewed (0) -
src/regexp/exec_test.go
// gives the semicolon-separated match results of running // the regexp on the corresponding string. // Each match result is either a single -, meaning no match, or a // space-separated sequence of pairs giving the match and // submatch indices. An unmatched subexpression formats // its pair as a single - (not illustrated above). For now // each regexp run produces two match results, one for a // “full match” that restricts the regexp to matching the entire
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:36:03 UTC 2024 - 20.7K bytes - Viewed (0) -
src/cmd/covdata/tool_test.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 20:46:32 UTC 2024 - 24.5K bytes - Viewed (0) -
src/regexp/exec.go
} else { op &^= syntax.EmptyNoWordBoundary } return op == 0 } // match runs the machine over the input starting at pos. // It reports whether a match was found. // If so, m.matchcap holds the submatch information. func (m *machine) match(i input, pos int) bool { startCond := m.re.cond if startCond == ^syntax.EmptyOp(0) { // impossible return false } m.matched = false for i := range m.matchcap {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jun 04 20:10:54 UTC 2022 - 12.3K bytes - Viewed (0) -
src/cmd/cgo/internal/test/testx.go
// Create a new C thread and invoke Go function repeatedly in the new C thread. func benchCGoInCthread(b *testing.B) { n := C.callGoInCThread(C.int(b.N)) if int(n) != b.N { b.Fatal("unmatch loop times") } } // issue 1328 //export BackIntoGo func BackIntoGo() { x := 1 for i := 0; i < 10000; i++ { xvariadic(x) if x != 1 { panic("x is not 1?") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 17 21:53:11 UTC 2023 - 10.6K bytes - Viewed (0) -
pkg/scheduler/framework/plugins/podtopologyspread/plugin.go
// Maybe now the scheduling result of topology spread gets changed by this change. logger.V(5).Info("a scheduled pod's label was updated and it makes the updated pod match or unmatch the pod's topology spread constraints", "pod", klog.KObj(pod), "modifiedPod", klog.KObj(modifiedPod)) return framework.Queue, nil } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Mar 16 14:13:06 UTC 2024 - 12.7K bytes - Viewed (0)