| /external/tensorflow/tensorflow/compiler/xla/mlir_hlo/include/mlir-hlo/Dialect/mhlo/transforms/ |
| 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 …]
|
| /external/icu/icu4c/source/data/locales/ |
| 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 …]
|
| 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 …]
|
| /external/pcre/doc/ |
| 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 …]
|
| /external/cronet/tot/third_party/icu/source/data/locales/ |
| 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 …]
|
| 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 …]
|
| /external/cronet/stable/third_party/icu/source/data/locales/ |
| 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 …]
|
| 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 …]
|
| /external/perfetto/src/trace_processor/util/ |
| D | glob_unittest.cc | 27 // Matching patterns. in TEST()
30 // Non-matching patterns. in TEST()
39 // Matching patterns. in TEST()
48 // Matching patterns. in TEST()
51 // Non-matching patterns. in TEST()
64 // Matching patterns. in TEST()
71 // Non-matching patterns. in TEST()
80 // Matching patterns. in TEST()
87 // Non-matching patterns. in TEST()
96 // Matching patterns. in TEST()
[all …]
|
| /external/rust/android-crates-io/crates/aho-corasick/src/packed/ |
| 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 …]
|
| 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 …]
|
| /external/cronet/stable/third_party/rust/chromium_crates_io/vendor/aho-corasick-1.1.3/src/packed/teddy/ |
| 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 …]
|
| /external/cronet/tot/third_party/rust/chromium_crates_io/vendor/aho-corasick-1.1.3/src/packed/teddy/ |
| 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 …]
|
| /external/python/cpython3/Lib/test/libregrtest/ |
| D | filter.py | 25 # ignore patterns which contain fnmatch patterns: '*', '?', '[...]'
35 def set_match_tests(patterns): argument
38 if not patterns:
43 patterns = tuple(patterns)
44 if patterns != _test_patterns:
47 for result, it in itertools.groupby(patterns, itemgetter(1))
49 _test_patterns = patterns
52 def _compile_match_function(patterns): argument
53 patterns = list(patterns)
55 if all(map(_is_full_match_test, patterns)):
[all …]
|
| /external/pdfium/xfa/fxfa/parser/ |
| 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 …]
|
| /external/zxing/core/src/main/java/com/google/zxing/ |
| 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 …]
|
| /external/cronet/tot/base/substring_set_matcher/ |
| 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 …]
|
| /external/cronet/stable/base/substring_set_matcher/ |
| 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 …]
|
| /external/pcre/doc/html/ |
| 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 …]
|
| /external/cronet/tot/third_party/rust/chromium_crates_io/vendor/aho-corasick-1.1.3/src/packed/ |
| 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 …]
|
| /external/cronet/stable/third_party/rust/chromium_crates_io/vendor/aho-corasick-1.1.3/src/packed/ |
| 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 …]
|
| /external/tensorflow/tensorflow/compiler/xla/mlir_hlo/lib/Transforms/ |
| D | gpu_kernel_lowering_passes.cc | 37 /// A pass that does the final lowering to NVVM. It collects all the patterns
44 /// A pass that does the final lowering to ROCDL. It collects all the patterns
54 RewritePatternSet& patterns) { in populateCommonPatterns() argument
55 arith::populateArithmeticToLLVMConversionPatterns(converter, patterns); in populateCommonPatterns()
56 populateMathToLLVMConversionPatterns(converter, patterns); in populateCommonPatterns()
57 populateMemRefToLLVMConversionPatterns(converter, patterns); in populateCommonPatterns()
58 populateFuncToLLVMConversionPatterns(converter, patterns); in populateCommonPatterns()
59 cf::populateControlFlowToLLVMConversionPatterns(converter, patterns); in populateCommonPatterns()
60 populateComplexToLLVMConversionPatterns(converter, patterns); in populateCommonPatterns()
64 RewritePatternSet patterns(&getContext()); in runOnOperation() local
[all …]
|
| /external/llvm/test/TableGen/ |
| D | Slice.td | 65 multiclass scalar<bits<8> opcode, string asmstr = "", list<list<dag>> patterns = []> {
68 !if(!empty(patterns),[]<dag>,patterns[0])>;
71 … !if(!empty(patterns),[]<dag>,!if(!empty(!tail(patterns)),patterns[0],patterns[1]))>;
74 multiclass vscalar<bits<8> opcode, string asmstr = "", list<list<dag>> patterns = []> {
77 !if(!empty(patterns),[]<dag>,patterns[0])>;
80 … !if(!empty(patterns),[]<dag>,!if(!empty(!tail(patterns)),patterns[0],patterns[1]))>;
83 multiclass myscalar<bits<8> opcode, string asmstr = "", list<list<dag>> patterns = []> :
84 scalar<opcode, asmstr, patterns>,
85 vscalar<opcode, asmstr, patterns>;
|
| /external/apache-xml/src/main/java/org/apache/xpath/patterns/ |
| D | UnionPattern.java | 21 package org.apache.xpath.patterns;
31 * StepPattern patterns.
38 /** Array of the contained step patterns to be tested.
75 * Set the contained step patterns to be tested.
78 * @param patterns the contained step patterns to be tested.
80 public void setPatterns(StepPattern[] patterns) in setPatterns() argument
82 m_patterns = patterns; in setPatterns()
83 if(null != patterns) in setPatterns()
85 for(int i = 0; i < patterns.length; i++) in setPatterns()
87 patterns[i].exprSetParent(this); in setPatterns()
[all …]
|
| /external/pytorch/.github/ |
| 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 …]
|