Home
last modified time | relevance | path

Searched refs:patterns (Results 1 - 25 of 153) sorted by relevance

1234567

/third_party/gn/src/gn/
H A Dfunction_label_matches_unittest.cc17 Value patterns(nullptr, Value::LIST); in TEST()
18 patterns.list_value().push_back(Value(nullptr, "//foo/*")); in TEST()
19 patterns.list_value().push_back(Value(nullptr, "//bar:*")); in TEST()
20 args.push_back(patterns); in TEST()
37 Value patterns(nullptr, Value::LIST); in TEST()
38 patterns.list_value().push_back(Value(nullptr, "//foo/*")); in TEST()
39 patterns.list_value().push_back(Value(nullptr, "//bar:*")); in TEST()
40 args.push_back(patterns); in TEST()
57 Value patterns(nullptr, Value::LIST); in TEST()
58 patterns in TEST()
[all...]
H A Dfunction_filter_labels_unittest.cc19 Value patterns(nullptr, Value::LIST); in TEST()
20 patterns.list_value().push_back(Value(nullptr, "//foo/*")); in TEST()
21 patterns.list_value().push_back(Value(nullptr, "//bar:*")); in TEST()
24 args.push_back(patterns); in TEST()
46 Value patterns(nullptr, Value::LIST); in TEST()
47 patterns.list_value().push_back(Value(nullptr, "//foo/*")); in TEST()
48 patterns.list_value().push_back(Value(nullptr, "//bar:*")); in TEST()
51 args.push_back(patterns); in TEST()
74 Value patterns(nullptr, Value::LIST); in TEST()
75 patterns in TEST()
[all...]
H A Dfunction_filter_unittest.cc18 Value patterns(nullptr, Value::LIST); in TEST()
19 patterns.list_value().push_back(Value(nullptr, "*.proto")); in TEST()
22 std::vector<Value> args = {values, patterns}; in TEST()
61 Value patterns(nullptr, Value::LIST); in TEST()
62 patterns.list_value().push_back(Value(nullptr, "*")); in TEST()
67 std::vector<Value> args = {values, patterns, extra_argument}; in TEST()
80 Value patterns(nullptr, Value::LIST); in TEST()
81 patterns.list_value().push_back(Value(nullptr, "*")); in TEST()
84 std::vector<Value> args = {values, patterns}; in TEST()
98 Value patterns(nullpt in TEST()
[all...]
H A Dfunction_filter_labels.cc33 // Validate "labels" and "patterns" are both lists in RunFilterLabels()
39 *err = Err(args[1], "Second argument must be a list of label patterns."); in RunFilterLabels()
43 // Extract "patterns" in RunFilterLabels()
44 std::vector<LabelPattern> patterns; in RunFilterLabels() local
45 patterns.reserve(args[1].list_value().size()); in RunFilterLabels()
49 *err = Err(args[1], "Second argument must be a list of label patterns."); in RunFilterLabels()
58 patterns.push_back(std::move(pattern)); in RunFilterLabels()
61 // Iterate over "labels", resolving and matching against the list of patterns. in RunFilterLabels()
75 const bool matches_pattern = LabelPattern::VectorMatches(patterns, label); in RunFilterLabels()
93 "filter_labels_include: Remove labels that do not match a set of patterns
[all...]
H A Dfunction_label_matches.cc20 "label_matches: Returns whether a label matches any of a list of patterns.";
22 R"(label_matches: Returns true if the label matches any of a set of patterns.
24 label_matches(target_label, patterns)
26 The argument patterns must be a list of label patterns (see
27 "gn help label_pattern"). If the target_label matches any of the patterns,
57 // Extract "patterns".
59 *err = Err(args[1], "Second argument must be a list of label patterns.");
62 std::vector<LabelPattern> patterns;
63 patterns
[all...]
H A Dfunction_filter.cc18 "filter_exclude: Remove values that match a set of patterns.";
20 R"(filter_exclude: Remove values that match a set of patterns.
26 The argument exclude_patterns must be a list of file patterns (see
28 of those patterns will be excluded.
38 "filter_include: Remove values that do not match a set of patterns.";
40 R"(filter_include: Remove values that do not match a set of patterns.
46 The argument include_patterns must be a list of file patterns (see
79 // Extract "patterns". in RunFilter()
80 PatternList patterns; in RunFilter() local
81 patterns in RunFilter()
[all...]
/third_party/rust/crates/aho-corasick/src/packed/
H A Dapi.rs8 /// This is a limit placed on the total number of patterns we're willing to try
131 /// used to accumulate patterns and create a
198 /// A builder for constructing a packed searcher from a collection of patterns.
231 /// The patterns provided by the caller.
232 patterns: Patterns,
243 Builder { config, inert: false, patterns: Patterns::new() } in from_config()
246 /// Build a searcher from the patterns added to this builder so far.
248 if self.inert || self.patterns.is_empty() { in build()
251 let mut patterns = self.patterns in build() variables
[all...]
H A Drabinkarp.rs9 /// The number of buckets to store our patterns in. We don't want this to be
22 /// patterns we're looking for.
24 /// A draw back of naively scaling Rabin-Karp to multiple patterns is that
25 /// it requires all of the patterns to be the same length, which in turn
27 /// multiple patterns of varying size by fixing the number of bytes to hash
28 /// to be the length of the smallest pattern. We also split the patterns into
38 /// The order of patterns in each bucket is significant. Namely, they are
41 /// For example, if leftmost-longest semantics are used, then the patterns
43 /// semantics are used, then the patterns are sorted by their pattern ID
53 /// to ensure that the patterns provide
[all...]
/third_party/rust/crates/aho-corasick/src/packed/teddy/
H A Dcompile.rs15 /// and number of patterns given to the builder.
43 /// Build a matcher for the set of patterns given. If a matcher could not
49 pub fn build(&self, patterns: &Patterns) -> Option<Teddy> { in build()
50 self.build_imp(patterns) in build()
66 /// matching more patterns or matching more bytes in the haystack at once.
75 fn build_imp(&self, patterns: &Patterns) -> Option<Teddy> { in build_imp()
81 // patterns we allow ourselves to search. Additionally, for testing in build_imp()
86 if patterns.len() > 64 { in build_imp()
107 None => avx && patterns.len() > 32, in build_imp()
113 let mut compiler = Compiler::new(patterns, fa in build_imp()
[all...]
/third_party/python/Lib/distutils/
H A Dfilelist.py16 applying various patterns to what we find there.
80 patterns = dir = dir_pattern = None
87 patterns = [convert_path(w) for w in words[1:]]
93 patterns = [convert_path(w) for w in words[2:]]
102 return (action, patterns, dir, dir_pattern)
109 # patterns, (dir and patterns), or (dir_pattern).
110 (action, patterns, dir, dir_pattern) = self._parse_template_line(line)
116 self.debug_print("include " + ' '.join(patterns))
117 for pattern in patterns
[all...]
/third_party/rust/crates/aho-corasick/bench/src/
H A Dbench.rs29 patterns: Vec<B>, in define_aho_corasick()
31 let patterns: Vec<Vec<u8>> = in define_aho_corasick()
32 patterns.into_iter().map(|b| b.as_ref().to_vec()).collect(); in define_aho_corasick()
36 // let aut = AhoCorasick::new(patterns.clone()); in define_aho_corasick()
40 .build(patterns.clone()); in define_aho_corasick()
47 // let aut = AhoCorasickBuilder::new().dfa(true).build(patterns.clone()); in define_aho_corasick()
51 .build(patterns.clone()); in define_aho_corasick()
59 builder.extend(patterns.clone()); in define_aho_corasick()
71 builder.extend(patterns.clone()); in define_aho_corasick()
90 patterns in define_aho_corasick_dfa()
[all...]
H A Dbuild.rs36 patterns: Vec<B>, in define_build()
38 let patterns: Vec<Vec<u8>> = in define_build()
39 patterns.into_iter().map(|b| b.as_ref().to_vec()).collect(); in define_build()
41 let pats = patterns.clone(); in define_build()
53 let pats = patterns.clone(); in define_build()
/third_party/python/PC/layout/support/
H A Dfilesets.py12 def __init__(self, *patterns):
16 for p in map(os.path.normcase, patterns):
42 def __init__(self, *patterns):
46 for p in map(os.path.normcase, patterns):
95 def rglob(root, patterns, condition=None):
98 if isinstance(patterns, tuple):
99 for p in patterns:
102 yield from _rglob(root, patterns, condition or _return_true)
/third_party/node/test/message/
H A Dtestcfg.py61 patterns = [ ]
68 patterns.append(pattern)
72 if len(outlines) != len(patterns):
74 print("expect=%d" % len(patterns))
76 print("patterns:")
77 for i in range(len(patterns)):
78 print("pattern = %s" % patterns[i])
83 for i in range(len(patterns)):
84 if not re.match(patterns[i], outlines[i]):
87 print("expect=%s" % patterns[
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/map-workspaces/lib/
H A Dindex.js8 function appendNegatedPatterns (patterns) {
10 for (let pattern of patterns) {
80 const patterns = getPatterns(workspaces)
84 if (!patterns.length) {
98 for (const item of patterns) {
180 const patterns = getPatterns(workspaces)
181 if (!patterns.length) {
184 patterns.push({ pattern: '**/node_modules/**', negate: true })
193 for (const item of patterns) {
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/Retired/
H A Drealign.py15 patterns = [
22 numpat = len(patterns)
23 regexp = [ re.compile(patterns[i][0]) for i in range(0,numpat)]
24 column = [ patterns[i][1] for i in range(0,numpat)]
29 for i in range(0,len(patterns)):
35 #print('# matched expression: ' + patterns[i][0])
/third_party/node/test/pseudo-tty/
H A Dtestcfg.py62 patterns = [ ]
69 patterns.append(pattern)
73 if len(outlines) != len(patterns):
75 print("expect=%d" % len(patterns))
77 print("patterns:")
78 for i in range(len(patterns)):
79 print("pattern = %s" % patterns[i])
84 for i in range(len(patterns)):
85 if not re.match(patterns[i], outlines[i]):
88 print("expect=%s" % patterns[
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/number/
H A DCompactData.java36 private final String[] patterns; field in CompactData
44 patterns = new String[(CompactData.COMPACT_MAX_DIGITS + 1) * StandardPlural.COUNT]; in CompactData()
108 patterns[getIndex(magnitude, plural)] = patternString; in populate()
140 String patternString = patterns[getIndex(magnitude, plural)]; in getPattern()
143 patternString = patterns[getIndex(magnitude, StandardPlural.OTHER)]; in getPattern()
156 output.addAll(Arrays.asList(patterns)); in getUniquePatterns()
188 if (data.patterns[getIndex(magnitude, plural)] != null) { in put()
200 data.patterns[getIndex(magnitude, plural)] = patternString; in put()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/
H A DCompactData.java32 private final String[] patterns; field in CompactData
40 patterns = new String[(CompactData.COMPACT_MAX_DIGITS + 1) * StandardPlural.COUNT]; in CompactData()
105 patterns[getIndex(magnitude, plural)] = patternString; in populate()
141 patternString = patterns[getIndex(magnitude, StandardPlural.EQ_0)]; in getPattern()
143 patternString = patterns[getIndex(magnitude, StandardPlural.EQ_1)]; in getPattern()
150 patternString = patterns[getIndex(magnitude, plural)]; in getPattern()
153 patternString = patterns[getIndex(magnitude, StandardPlural.OTHER)]; in getPattern()
166 output.addAll(Arrays.asList(patterns)); in getUniquePatterns()
199 if (data.patterns[getIndex(magnitude, plural)] != null) { in put()
211 data.patterns[getInde in put()
[all...]
/third_party/nghttp2/src/
H A Dshrpx_router_test.cc40 auto patterns = std::vector<Pattern>{ in test_shrpx_router_match() local
55 for (auto &p : patterns) { in test_shrpx_router_match()
103 constexpr auto patterns = std::array<Pattern, 6>{{ in test_shrpx_router_match_wildcard() local
114 for (auto &p : patterns) { in test_shrpx_router_match_wildcard()
147 auto patterns = std::vector<Pattern>{ in test_shrpx_router_match_prefix() local
156 for (auto &p : patterns) { in test_shrpx_router_match_prefix()
/third_party/icu/icu4c/source/i18n/
H A Dnumber_compact.cpp57 // NOTE: patterns and multipliers both get zero-initialized.
58 CompactData::CompactData() : patterns(), multipliers(), largestMagnitude(0), isEmpty(true) { in CompactData()
121 patternString = patterns[getIndex(magnitude, StandardPlural::Form::EQ_0)]; in getPattern()
123 patternString = patterns[getIndex(magnitude, StandardPlural::Form::EQ_1)]; in getPattern()
130 patternString = patterns[getIndex(magnitude, plural)]; in getPattern()
133 patternString = patterns[getIndex(magnitude, StandardPlural::OTHER)]; in getPattern()
146 for (auto pattern : patterns) { in getUniquePatterns()
152 // Search the UVector from the end since identical patterns are likely to be adjacent. in getUniquePatterns()
193 if (data.patterns[getIndex(magnitude, plural)] != nullptr) { in put()
208 data.patterns[getInde in put()
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dnumber_compact.cpp57 // NOTE: patterns and multipliers both get zero-initialized.
58 CompactData::CompactData() : patterns(), multipliers(), largestMagnitude(0), isEmpty(true) { in CompactData()
121 patternString = patterns[getIndex(magnitude, StandardPlural::Form::EQ_0)]; in getPattern()
123 patternString = patterns[getIndex(magnitude, StandardPlural::Form::EQ_1)]; in getPattern()
130 patternString = patterns[getIndex(magnitude, plural)]; in getPattern()
133 patternString = patterns[getIndex(magnitude, StandardPlural::OTHER)]; in getPattern()
146 for (auto pattern : patterns) { in getUniquePatterns()
152 // Search the UVector from the end since identical patterns are likely to be adjacent. in getUniquePatterns()
193 if (data.patterns[getIndex(magnitude, plural)] != nullptr) { in put()
208 data.patterns[getInde in put()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dnumber_compact.cpp57 // NOTE: patterns and multipliers both get zero-initialized.
58 CompactData::CompactData() : patterns(), multipliers(), largestMagnitude(0), isEmpty(true) { in CompactData()
121 patternString = patterns[getIndex(magnitude, StandardPlural::Form::EQ_0)]; in getPattern()
123 patternString = patterns[getIndex(magnitude, StandardPlural::Form::EQ_1)]; in getPattern()
130 patternString = patterns[getIndex(magnitude, plural)]; in getPattern()
133 patternString = patterns[getIndex(magnitude, StandardPlural::OTHER)]; in getPattern()
146 for (auto pattern : patterns) { in getUniquePatterns()
152 // Search the UVector from the end since identical patterns are likely to be adjacent. in getUniquePatterns()
189 if (data.patterns[getIndex(magnitude, plural)] != nullptr) { in put()
204 data.patterns[getInde in put()
[all...]
/third_party/rust/crates/aho-corasick/src/
H A Dahocorasick.rs34 /// is the combined length of all patterns being searched. With that said,
48 /// This example shows how to search for occurrences of multiple patterns
55 /// let patterns = &["apple", "maple", "snapple"];
60 /// .build(patterns);
77 /// let patterns = &["fox", "brown", "quick"];
81 /// let ac = AhoCorasick::new(patterns);
119 pub fn new<I, P>(patterns: I) -> AhoCorasick in new()
124 AhoCorasickBuilder::new().build(patterns) in new()
130 /// Specifically, this requires a slice of patterns instead of an iterator
131 /// since the configuration is determined by looking at the patterns befor
[all...]
/third_party/cJSON/tests/unity/auto/
H A Dgenerate_module.rb66 # Built in patterns
67 @patterns = {
138 patterns = @patterns[pattern]
139 raise "ERROR: The design pattern '#{pattern}' specified isn't one that I recognize!" if patterns.nil?
141 # single file patterns (currently just 'test') can reject the other parts of the triad
147 patterns.each_pair do |pattern_file, pattern_traits|

Completed in 15 milliseconds

1234567