| /aosp_15_r20/frameworks/base/core/tests/coretests/src/android/util/ |
| H A D | PatternsTest.java | 35 // Tests for Patterns.TOP_LEVEL_DOMAIN
42 t = Patterns.TOP_LEVEL_DOMAIN.matcher("com").matches(); in testTldPattern()
46 t = Patterns.TOP_LEVEL_DOMAIN.matcher("me").matches(); in testTldPattern()
50 t = Patterns.TOP_LEVEL_DOMAIN.matcher("xn--0zwm56d").matches(); in testTldPattern()
54 t = Patterns.TOP_LEVEL_DOMAIN.matcher("\uD55C\uAD6D").matches(); in testTldPattern()
57 t = Patterns.TOP_LEVEL_DOMAIN.matcher("mem").matches(); in testTldPattern()
60 t = Patterns.TOP_LEVEL_DOMAIN.matcher("xn").matches(); in testTldPattern()
63 t = Patterns.TOP_LEVEL_DOMAIN.matcher("xer").matches(); in testTldPattern()
67 // Tests for Patterns.IANA_TOP_LEVEL_DOMAINS
72 Pattern pattern = Pattern.compile(Patterns.IANA_TOP_LEVEL_DOMAINS); in testIanaTopLevelDomains_matchesValidTld()
[all …]
|
| /aosp_15_r20/external/cronet/third_party/icu/source/data/locales/ |
| H A D | root.txt | 21 patterns{
22 currencyFormat:alias{"/LOCALE/NumberElements/latn/patterns/currencyFormat"}
23 decimalFormat:alias{"/LOCALE/NumberElements/latn/patterns/decimalFormat"}
24 percentFormat:alias{"/LOCALE/NumberElements/latn/patterns/percentFormat"}
25 scientificFormat:alias{"/LOCALE/NumberElements/latn/patterns/scientificFormat"}
35 patterns{
36 currencyFormat:alias{"/LOCALE/NumberElements/latn/patterns/currencyFormat"}
37 decimalFormat:alias{"/LOCALE/NumberElements/latn/patterns/decimalFormat"}
38 percentFormat:alias{"/LOCALE/NumberElements/latn/patterns/percentFormat"}
39 scientificFormat:alias{"/LOCALE/NumberElements/latn/patterns/scientificFormat"}
[all …]
|
| H A D | oc_ES.txt | 16 patterns{
38 patterns{
48 patterns{
63 patterns{
78 patterns{
93 patterns{
108 patterns{
123 patterns{
138 patterns{
153 patterns{
[all …]
|
| /aosp_15_r20/external/icu/icu4c/source/data/locales/ |
| H A D | root.txt | 21 patterns{
22 currencyFormat:alias{"/LOCALE/NumberElements/latn/patterns/currencyFormat"}
23 decimalFormat:alias{"/LOCALE/NumberElements/latn/patterns/decimalFormat"}
24 percentFormat:alias{"/LOCALE/NumberElements/latn/patterns/percentFormat"}
25 scientificFormat:alias{"/LOCALE/NumberElements/latn/patterns/scientificFormat"}
35 patterns{
36 currencyFormat:alias{"/LOCALE/NumberElements/latn/patterns/currencyFormat"}
37 decimalFormat:alias{"/LOCALE/NumberElements/latn/patterns/decimalFormat"}
38 percentFormat:alias{"/LOCALE/NumberElements/latn/patterns/percentFormat"}
39 scientificFormat:alias{"/LOCALE/NumberElements/latn/patterns/scientificFormat"}
[all …]
|
| H A D | oc_ES.txt | 16 patterns{
38 patterns{
48 patterns{
63 patterns{
78 patterns{
93 patterns{
108 patterns{
123 patterns{
138 patterns{
153 patterns{
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/xla/mlir_hlo/include/mlir-hlo/Dialect/mhlo/transforms/ |
| H A D | rewriters.h | 32 // Collection of rewrite patterns for lowering a general dot product.
33 void populateGeneralDotOpLoweringPatterns(RewritePatternSet *patterns,
36 // Collection of rewrite patterns for lowering complex operations to equivalent
39 RewritePatternSet *patterns);
42 RewritePatternSet *patterns);
44 // Rewrite patterns for einsum to equivalent dot_general legalization.
46 RewritePatternSet *patterns);
48 // Rewrite patterns for gather to equivalent torch index select legalization.
50 RewritePatternSet *patterns);
52 void populateMhloToStdPatterns(RewritePatternSet *patterns, MLIRContext *ctx);
[all …]
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/aho-corasick-1.1.3/src/packed/teddy/ |
| H A D | builder.rs | 8 use crate::packed::{ext::Pointer, pattern::Patterns, teddy::generic::Match};
15 /// and number of patterns given to the builder.
29 /// When true (the default), the number of patterns will be used as a
31 /// is that too many patterns can overwhelm Teddy. But this can be disabled
52 /// Build a matcher for the set of patterns given. If a matcher could not
58 pub(crate) fn build(&self, patterns: Arc<Patterns>) -> Option<Searcher> { in build()
59 self.build_imp(patterns) in build()
75 /// matching more patterns or matching more bytes in the haystack at once.
84 /// Request that heuristic limitations on the number of patterns be
86 /// explore how Teddy performs on large number of patterns even if the
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/aho-corasick/src/packed/ |
| D | pattern.rs | 12 /// huge numbers of patterns, so we keep things a bit smaller.
15 /// A non-empty collection of non-empty patterns to search for.
17 /// This collection of patterns is what is passed around to both execute
19 /// searches to avoid copying all of the patterns, and allows us to keep only
25 pub struct Patterns { struct
26 /// The match semantics supported by this collection of patterns.
28 /// The match semantics determines the order of the iterator over patterns.
29 /// For leftmost-first, patterns are provided in the same order as were
30 /// provided by the caller. For leftmost-longest, patterns are provided in
34 /// The collection of patterns, indexed by their identifier.
[all …]
|
| D | api.rs | 3 use crate::packed::pattern::Patterns;
8 /// 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, field
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.clone(); in build() localVariable
[all …]
|
| D | rabinkarp.rs | 3 use crate::packed::pattern::{PatternID, Patterns};
9 /// 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
[all …]
|
| /aosp_15_r20/external/perfetto/src/trace_processor/util/ |
| H A D | glob_unittest.cc | 29 // Matching patterns. in TEST()
32 // Non-matching patterns. in TEST()
41 // Matching patterns. in TEST()
50 // Matching patterns. in TEST()
53 // Non-matching patterns. in TEST()
66 // Matching patterns. in TEST()
73 // Non-matching patterns. in TEST()
82 // Matching patterns. in TEST()
89 // Non-matching patterns. in TEST()
98 // Matching patterns. in TEST()
[all …]
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/aho-corasick-1.1.3/src/packed/ |
| H A D | api.rs | 4 packed::{pattern::Patterns, rabinkarp::RabinKarp, teddy},
8 /// This is a limit placed on the total number of patterns we're willing to try
126 /// used to accumulate patterns and create a [`Searcher`] from them.
190 /// Request that heuristic limitations on the number of patterns be
192 /// explore how Teddy performs on large number of patterns even if the
202 /// A builder for constructing a packed searcher from a collection of patterns.
237 /// The patterns provided by the caller.
238 patterns: Patterns, field
249 Builder { config, inert: false, patterns: Patterns::new() } in from_config()
252 /// Build a searcher from the patterns added to this builder so far.
[all …]
|
| H A D | pattern.rs | 10 /// A non-empty collection of non-empty patterns to search for.
12 /// This collection of patterns is what is passed around to both execute
14 /// searches to avoid copying all of the patterns, and allows us to keep only
20 pub(crate) struct Patterns { struct
21 /// The match semantics supported by this collection of patterns.
23 /// The match semantics determines the order of the iterator over patterns.
24 /// For leftmost-first, patterns are provided in the same order as were
25 /// provided by the caller. For leftmost-longest, patterns are provided in
29 /// The collection of patterns, indexed by their identifier.
31 /// The order of patterns defined for iteration, given by pattern
[all …]
|
| H A D | rabinkarp.rs | 3 use crate::{packed::pattern::Patterns, util::search::Match, PatternID};
8 /// The number of buckets to store our patterns in. We don't want this to be
21 /// patterns we're looking for.
23 /// A draw back of naively scaling Rabin-Karp to multiple patterns is that
24 /// it requires all of the patterns to be the same length, which in turn
26 /// multiple patterns of varying size by fixing the number of bytes to hash
27 /// to be the length of the smallest pattern. We also split the patterns into
37 /// The patterns we're searching for.
38 patterns: Arc<Patterns>, field
39 /// The order of patterns in each bucket is significant. Namely, they are
[all …]
|
| /aosp_15_r20/external/pcre/doc/ |
| H A D | pcre2serialize.3 | 4 .SH "SAVING AND RE-USING PRECOMPILED PCRE2 PATTERNS"
22 expression patterns, it may be useful to store them in a precompiled form
26 which the patterns are reloaded must be running the same version of PCRE2, with
28 and PCRE2_SIZE type. For example, patterns compiled on a 32-bit system using
32 Note that "serialization" in PCRE2 does not convert compiled patterns to an
37 be prepared to recompile patterns from their sources, in order to be immune to
44 The facility for saving and restoring compiled patterns is intended for use
54 .SH "SAVING COMPILED PATTERNS"
57 Before compiled patterns can be saved they must be serialized, which in PCRE2
59 contain any number of compiled patterns, but they must all use the same
[all …]
|
| /aosp_15_r20/tools/tradefederation/core/javatests/com/android/tradefed/testtype/suite/ |
| D | SuiteModuleLoaderTest.java | 290 List<String> patterns = new ArrayList<>(); in testInjectConfigOptions_moduleArgs() local
291 patterns.add(".*.config"); in testInjectConfigOptions_moduleArgs()
292 patterns.add(".*.xml"); in testInjectConfigOptions_moduleArgs()
295 Arrays.asList(mTestsDir), mAbis, null, null, patterns); in testInjectConfigOptions_moduleArgs()
361 List<String> patterns = new ArrayList<>(); in testInjectConfigOptions_testArgs() local
362 patterns.add(".*.config"); in testInjectConfigOptions_testArgs()
363 patterns.add(".*.xml"); in testInjectConfigOptions_testArgs()
366 Arrays.asList(mTestsDir), mAbis, null, null, patterns); in testInjectConfigOptions_testArgs()
401 List<String> patterns = new ArrayList<>(); in testInjectConfigOptions_moduleArgs_alias() local
402 patterns.add(".*.config"); in testInjectConfigOptions_moduleArgs_alias()
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/aho-corasick/src/packed/teddy/ |
| D | compile.rs | 7 use crate::packed::pattern::{PatternID, Patterns};
15 /// 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()
[all …]
|
| /aosp_15_r20/external/pcre/doc/html/ |
| H A D | pcre2serialize.html | 16 <li><a name="TOC1" href="#SEC1">SAVING AND RE-USING PRECOMPILED PCRE2 PATTERNS</a>
18 <li><a name="TOC3" href="#SEC3">SAVING COMPILED PATTERNS</a>
19 <li><a name="TOC4" href="#SEC4">RE-USING PRECOMPILED PATTERNS</a>
23 <br><a name="SEC1" href="#TOC1">SAVING AND RE-USING PRECOMPILED PCRE2 PATTERNS</a><br>
42 expression patterns, it may be useful to store them in a precompiled form
46 which the patterns are reloaded must be running the same version of PCRE2, with
48 and PCRE2_SIZE type. For example, patterns compiled on a 32-bit system using
53 Note that "serialization" in PCRE2 does not convert compiled patterns to an
58 be prepared to recompile patterns from their sources, in order to be immune to
63 The facility for saving and restoring compiled patterns is intended for use
[all …]
|
| /aosp_15_r20/external/cronet/base/substring_set_matcher/ |
| H A D | substring_set_matcher_unittest.cc | 25 std::vector<MatcherStringPattern> patterns; in TestOnePattern() local
26 patterns.emplace_back(pattern, 1); in TestOnePattern()
28 ASSERT_TRUE(matcher.Build(patterns)); in TestOnePattern()
48 // In order to make sure that the order in which patterns are registered in TestTwoPatterns()
51 std::vector<const MatcherStringPattern*> patterns; in TestTwoPatterns() local
53 patterns.push_back(&substring_pattern_1); in TestTwoPatterns()
54 patterns.push_back(&substring_pattern_2); in TestTwoPatterns()
56 patterns.push_back(&substring_pattern_2); in TestTwoPatterns()
57 patterns.push_back(&substring_pattern_1); in TestTwoPatterns()
60 ASSERT_TRUE(matcher.Build(patterns)); in TestTwoPatterns()
[all …]
|
| /aosp_15_r20/external/pytorch/.github/ |
| H A D | merge_rules.yaml | 2 patterns:
42 patterns:
59 patterns:
75 patterns:
90 patterns:
102 patterns:
114 patterns:
125 patterns:
140 patterns:
154 patterns:
[all …]
|
| /aosp_15_r20/external/pdfium/xfa/fxfa/parser/ |
| H A D | cxfa_xmllocale.cpp | 70 CFX_XMLElement* patterns = locale_->GetFirstChildNamed(kNumberSymbols); in GetDecimalSymbol() local
71 return patterns ? GetPattern(patterns, kNumberSymbol, L"decimal") in GetDecimalSymbol()
76 CFX_XMLElement* patterns = locale_->GetFirstChildNamed(kNumberSymbols); in GetGroupingSymbol() local
77 return patterns ? GetPattern(patterns, kNumberSymbol, L"grouping") in GetGroupingSymbol()
82 CFX_XMLElement* patterns = locale_->GetFirstChildNamed(kNumberSymbols); in GetPercentSymbol() local
83 return patterns ? GetPattern(patterns, kNumberSymbol, L"percent") in GetPercentSymbol()
88 CFX_XMLElement* patterns = locale_->GetFirstChildNamed(kNumberSymbols); in GetMinusSymbol() local
89 return patterns ? GetPattern(patterns, kNumberSymbol, L"minus") in GetMinusSymbol()
94 CFX_XMLElement* patterns = locale_->GetFirstChildNamed(kCurrencySymbols); in GetCurrencySymbol() local
95 return patterns ? GetPattern(patterns, kCurrencySymbol, L"symbol") in GetCurrencySymbol()
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/mlir/xla/transforms/ |
| H A D | xla_legalize_tf.cc | 224 // Patterns whose root op is in the set `include_ops` are moved from the set
225 // `from` to the returned set. This is used to partition patterns by op so they
247 mlir::LogicalResult ApplyPatterns(Operation *op, RewritePatternSet &patterns, in ApplyPatterns() argument
268 op, target, std::move(patterns), &nonlegalized_ops); in ApplyPatterns()
278 return applyPartialConversion(op, target, std::move(patterns)); in ApplyPatterns()
282 /// patterns from TF2XLA fallback for provided device type (see
291 // Note that the `OperationConverter` orders patterns lexicographically by: in legalizeTF()
292 // 1) Ascending legalization depth (i.e., minimum number of patterns necessary in legalizeTF()
293 // to arrive at conversion target). This requires relevant patterns to in legalizeTF()
294 // specify the list of ops generated by it which most of patterns in legalizeTF()
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/aho-corasick/src/ |
| D | ahocorasick.rs | 34 /// 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 before
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/mlir/tosa/transforms/ |
| H A D | legalize_tf.cc | 2274 RewritePatternSet patterns(ctx); in runOnOperation() local
2276 populateLegalizeTFPatterns(ctx, patterns); in runOnOperation()
2278 if (ApplyPatternsWithShapeResolution(func, std::move(patterns)).failed()) { in runOnOperation()
2285 void populateLegalizeTFPatterns(MLIRContext* ctx, RewritePatternSet& patterns) { in populateLegalizeTFPatterns() argument
2286 // Add the generated patterns to the list. in populateLegalizeTFPatterns()
2287 populateWithGenerated(patterns); in populateLegalizeTFPatterns()
2288 patterns.add<ConvertTFMatMulOp>(ctx); in populateLegalizeTFPatterns()
2289 patterns.add<ConvertTFReluOp>(ctx); in populateLegalizeTFPatterns()
2290 patterns.add<ConvertTFRelu6Op>(ctx); in populateLegalizeTFPatterns()
2291 patterns.add<ConvertTFEqualOp>(ctx); in populateLegalizeTFPatterns()
[all …]
|
| /aosp_15_r20/external/zxing/core/src/main/java/com/google/zxing/ |
| H A D | ResultPoint.java | 68 * @param patterns array of three {@code ResultPoint} to order
70 public static void orderBestPatterns(ResultPoint[] patterns) { in orderBestPatterns() argument
73 float zeroOneDistance = distance(patterns[0], patterns[1]); in orderBestPatterns()
74 float oneTwoDistance = distance(patterns[1], patterns[2]); in orderBestPatterns()
75 float zeroTwoDistance = distance(patterns[0], patterns[2]); in orderBestPatterns()
82 pointB = patterns[0]; in orderBestPatterns()
83 pointA = patterns[1]; in orderBestPatterns()
84 pointC = patterns[2]; in orderBestPatterns()
86 pointB = patterns[1]; in orderBestPatterns()
87 pointA = patterns[0]; in orderBestPatterns()
[all …]
|