- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 332 for submatch (0.14 sec)
-
cmd/kubeadm/app/apis/bootstraptoken/v1/utils.go
) const ( // When a token is matched with 'BootstrapTokenPattern', the size of validated substrings returned by // regexp functions which contains 'Submatch' in their names will be 3. // Submatch 0 is the match of the entire expression, submatch 1 is // the match of the first parenthesized subexpression, and so on. // e.g.: // result := bootstraputil.BootstrapTokenRegexp.FindStringSubmatch("abcdef.1234567890123456")
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 26 15:51:39 UTC 2023 - 8.3K bytes - Viewed (0) -
src/regexp/syntax/doc.go
Unlimited repetitions are not subject to this restriction. Grouping: (re) numbered capturing group (submatch) (?P<name>re) named & numbered capturing group (submatch) (?<name>re) named & numbered capturing group (submatch) (?:re) non-capturing group (?flags) set flags within current group; non-capturing (?flags:re) set flags during re; non-capturing
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 19 11:21:02 UTC 2024 - 5.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/admission/plugin/webhook/predicates/rules/rules.go
opRes, opSub := r.Attr.GetResource().Resource, r.Attr.GetSubresource() for _, res := range r.Rule.Resources { res, sub := splitResource(res) resMatch := res == "*" || res == opRes subMatch := sub == "*" || sub == opSub if resMatch && subMatch { return true } } return false } // IsExemptAdmissionConfigurationResource determines if an admission.Attributes object is describing
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Nov 07 21:38:55 UTC 2022 - 3.7K bytes - Viewed (0) -
src/regexp/testdata/README
the no match case runs the starred subexpression zero times, not once. This is consistent with (a*)* matching a, which runs the starred subexpression one time, not twice. * The submatch choice is first match, not the POSIX rule. Such changes are marked with 'RE2/Go'. RE2 Test Files re2-exhaustive.txt.bz2 and re2-search.txt are built by running
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 27 20:18:25 UTC 2015 - 957 bytes - Viewed (0) -
src/regexp/regexp.go
// parenthesis. Submatch 0 is the match of the entire expression, submatch 1 is // the match of the first parenthesized subexpression, and so on. // // If 'Index' is present, matches and submatches are identified by byte index // pairs within the input string: result[2*n:2*n+2] identifies the indexes of // the nth submatch. The pair for n==0 identifies the match of the entire
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 38.5K bytes - Viewed (0) -
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/cmd/compile/internal/ssa/debug_lines_test.go
"path/filepath" "reflect" "regexp" "runtime" "sort" "strconv" "strings" "testing" ) // Matches lines in genssa output that are marked "isstmt", and the parenthesized plus-prefixed line number is a submatch var asmLine *regexp.Regexp = regexp.MustCompile(`^\s[vb]\d+\s+\d+\s\(\+(\d+)\)`) // this matches e.g. ` v123456789 000007 (+9876654310) MOVUPS X15, ""..autotmp_2-32(SP)`
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 20:24:52 UTC 2023 - 8.4K bytes - Viewed (0) -
src/regexp/find_test.go
} } // Now come the Submatch cases. func testSubmatchBytes(test *FindTest, n int, submatches []int, result [][]byte, t *testing.T) { if len(submatches) != len(result)*2 { t.Errorf("match %d: expected %d submatches; got %d: %s", n, len(submatches)/2, len(result), test) return } for k := 0; k < len(submatches); k += 2 { if submatches[k] == -1 { if result[k/2] != nil {
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/backtrack.go
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // backtrack is a regular expression search with submatch // tracking for small regular expressions and texts. It allocates // a bit vector with (length of input) * (length of prog) bits, // to make sure it never explores the same (character position, instruction)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 17:25:39 UTC 2023 - 8.8K 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)