HomeSort by relevance Sort by last modified time
    Searched refs:pattern (Results 326 - 350 of 4320) sorted by null

<<11121314151617181920>>

  /external/strace/tests-mx32/
nlattr_tc_stats.c 82 static char pattern[4096]; local
83 fill_memory_ex(pattern, sizeof(pattern), 'a', 'z' - 'a' + 1);
93 TCA_STATS_BASIC, pattern, buf,
105 TCA_STATS_RATE_EST, pattern, est,
121 TCA_STATS_QUEUE, pattern, qstats,
137 TCA_STATS_RATE_EST64, pattern, est64,
nlattr_tca_stab.c 92 static char pattern[4096]; local
93 fill_memory_ex(pattern, sizeof(pattern), 'a', 'z' - 'a' + 1);
108 TCA_STAB_BASE, pattern, s,
123 TCA_STAB_DATA, pattern, data, print_uint16);
nlattr_rtmsg.c 86 static char pattern[4096]; local
87 fill_memory_ex(pattern, sizeof(pattern), 'a', 'z' - 'a' + 1);
95 4, pattern, 4,
96 print_quoted_hex(pattern, 4));
100 RTA_DST, 4, pattern, 4,
101 print_quoted_hex(pattern, 4));
106 RTA_OIF, pattern, ifindex,
112 RTA_TABLE, pattern, rt_class_id,
121 RTA_METRICS, pattern, nla
    [all...]
  /external/skia/src/ports/
SkFontMgr_fontconfig.cpp 142 static bool get_bool(FcPattern* pattern, const char object[], bool missing = false) {
144 if (FcPatternGetBool(pattern, object, 0, &value) != FcResultMatch) {
150 static int get_int(FcPattern* pattern, const char object[], int missing) {
152 if (FcPatternGetInteger(pattern, object, 0, &value) != FcResultMatch) {
158 static const char* get_string(FcPattern* pattern, const char object[], const char* missing = "") {
160 if (FcPatternGetString(pattern, object, 0, &value) != FcResultMatch) {
166 static const FcMatrix* get_matrix(FcPattern* pattern, const char object[]) {
168 if (FcPatternGetMatrix(pattern, object, 0, &matrix) != FcResultMatch) {
180 * FcResult FcPatternIsWeak(pattern, object, id, FcBool* isWeak);
188 static SkWeakReturn is_weak(FcPattern* pattern, const char object[], int id)
    [all...]
  /external/skqp/src/ports/
SkFontMgr_fontconfig.cpp 142 static bool get_bool(FcPattern* pattern, const char object[], bool missing = false) {
144 if (FcPatternGetBool(pattern, object, 0, &value) != FcResultMatch) {
150 static int get_int(FcPattern* pattern, const char object[], int missing) {
152 if (FcPatternGetInteger(pattern, object, 0, &value) != FcResultMatch) {
158 static const char* get_string(FcPattern* pattern, const char object[], const char* missing = "") {
160 if (FcPatternGetString(pattern, object, 0, &value) != FcResultMatch) {
166 static const FcMatrix* get_matrix(FcPattern* pattern, const char object[]) {
168 if (FcPatternGetMatrix(pattern, object, 0, &matrix) != FcResultMatch) {
180 * FcResult FcPatternIsWeak(pattern, object, id, FcBool* isWeak);
188 static SkWeakReturn is_weak(FcPattern* pattern, const char object[], int id)
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/
btm_matcher.py 38 """Reduces a fixer's pattern tree to a linear path and adds it
49 def add(self, pattern, start):
50 "Recursively adds a linear pattern to the AC automaton"
51 #print("adding pattern", pattern, "to", start)
52 if not pattern:
53 #print("empty pattern")
55 if isinstance(pattern[0], tuple):
59 for alternative in pattern[0]:
60 #add all alternatives, and add the rest of the pattern
    [all...]
  /external/python/cpython2/Lib/lib2to3/
btm_matcher.py 38 """Reduces a fixer's pattern tree to a linear path and adds it
49 def add(self, pattern, start):
50 "Recursively adds a linear pattern to the AC automaton"
51 #print("adding pattern", pattern, "to", start)
52 if not pattern:
53 #print("empty pattern")
55 if isinstance(pattern[0], tuple):
59 for alternative in pattern[0]:
60 #add all alternatives, and add the rest of the pattern
    [all...]
  /external/python/cpython3/Lib/lib2to3/
btm_matcher.py 38 """Reduces a fixer's pattern tree to a linear path and adds it
49 def add(self, pattern, start):
50 "Recursively adds a linear pattern to the AC automaton"
51 #print("adding pattern", pattern, "to", start)
52 if not pattern:
53 #print("empty pattern")
55 if isinstance(pattern[0], tuple):
59 for alternative in pattern[0]:
60 #add all alternatives, and add the rest of the pattern
    [all...]
  /external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/
ShadowSystemVibrator.java 38 protected void vibrate(long[] pattern, int repeat) {
39 recordVibratePattern(pattern, repeat);
43 protected void vibrate(int owningUid, String owningPackage, long[] pattern, int repeat) {
44 recordVibratePattern(pattern, repeat);
48 protected void vibrate(int uid, String opPkg, long[] pattern, int repeat, AudioAttributes attributes) {
49 recordVibratePattern(pattern, repeat);
98 private void recordVibratePattern(long[] pattern, int repeat) {
100 this.pattern = pattern;
105 for (long t : pattern) {
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/
btm_matcher.py 38 """Reduces a fixer's pattern tree to a linear path and adds it
49 def add(self, pattern, start):
50 "Recursively adds a linear pattern to the AC automaton"
51 #print("adding pattern", pattern, "to", start)
52 if not pattern:
53 #print("empty pattern")
55 if isinstance(pattern[0], tuple):
59 for alternative in pattern[0]:
60 #add all alternatives, and add the rest of the pattern
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/
btm_matcher.py 38 """Reduces a fixer's pattern tree to a linear path and adds it
49 def add(self, pattern, start):
50 "Recursively adds a linear pattern to the AC automaton"
51 #print("adding pattern", pattern, "to", start)
52 if not pattern:
53 #print("empty pattern")
55 if isinstance(pattern[0], tuple):
59 for alternative in pattern[0]:
60 #add all alternatives, and add the rest of the pattern
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/
btm_matcher.py 38 """Reduces a fixer's pattern tree to a linear path and adds it
49 def add(self, pattern, start):
50 "Recursively adds a linear pattern to the AC automaton"
51 #print("adding pattern", pattern, "to", start)
52 if not pattern:
53 #print("empty pattern")
55 if isinstance(pattern[0], tuple):
59 for alternative in pattern[0]:
60 #add all alternatives, and add the rest of the pattern
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/
btm_matcher.py 38 """Reduces a fixer's pattern tree to a linear path and adds it
49 def add(self, pattern, start):
50 "Recursively adds a linear pattern to the AC automaton"
51 #print("adding pattern", pattern, "to", start)
52 if not pattern:
53 #print("empty pattern")
55 if isinstance(pattern[0], tuple):
59 for alternative in pattern[0]:
60 #add all alternatives, and add the rest of the pattern
    [all...]
  /external/bsdiff/
suffix_array_index_unittest.cc 26 void SearchPrefix(const std::string& pattern,
29 sai_->SearchPrefix(reinterpret_cast<const uint8_t*>(pattern.data()),
30 pattern.size(), out_length, out_pos);
32 EXPECT_LE(*out_length, pattern.size());
35 EXPECT_EQ(0, memcmp(text_.data() + *out_pos, pattern.data(), *out_length));
64 // The exact pattern is found multiple times.
68 // The exact pattern is found only one time, at the end of the string.
  /external/python/cpython3/Lib/test/
test_fnmatch.py 9 def check_match(self, filename, pattern, should_match=1, fn=fnmatch):
11 self.assertTrue(fn(filename, pattern),
12 "expected %r to match pattern %r"
13 % (filename, pattern))
15 self.assertTrue(not fn(filename, pattern),
16 "expected %r not to match pattern %r"
17 % (filename, pattern))
  /external/strace/tests/
nlattr_tca_stab.c 92 static char pattern[4096]; local
93 fill_memory_ex(pattern, sizeof(pattern), 'a', 'z' - 'a' + 1);
108 TCA_STAB_BASE, pattern, s,
123 TCA_STAB_DATA, pattern, data, print_uint16);
nlattr_rtmsg.c 86 static char pattern[4096]; local
87 fill_memory_ex(pattern, sizeof(pattern), 'a', 'z' - 'a' + 1);
95 4, pattern, 4,
96 print_quoted_hex(pattern, 4));
100 RTA_DST, 4, pattern, 4,
101 print_quoted_hex(pattern, 4));
106 RTA_OIF, pattern, ifindex,
112 RTA_TABLE, pattern, rt_class_id,
121 RTA_METRICS, pattern, nla
    [all...]
  /external/strace/tests-m32/
nlattr_tca_stab.c 92 static char pattern[4096]; local
93 fill_memory_ex(pattern, sizeof(pattern), 'a', 'z' - 'a' + 1);
108 TCA_STAB_BASE, pattern, s,
123 TCA_STAB_DATA, pattern, data, print_uint16);
nlattr_rtmsg.c 86 static char pattern[4096]; local
87 fill_memory_ex(pattern, sizeof(pattern), 'a', 'z' - 'a' + 1);
95 4, pattern, 4,
96 print_quoted_hex(pattern, 4));
100 RTA_DST, 4, pattern, 4,
101 print_quoted_hex(pattern, 4));
106 RTA_OIF, pattern, ifindex,
112 RTA_TABLE, pattern, rt_class_id,
121 RTA_METRICS, pattern, nla
    [all...]
  /frameworks/base/core/java/android/os/
PatternMatcher.java 24 * A simple pattern matcher, which is safe to use on untrusted data: it does
30 * Pattern type: the given pattern must exactly match the string it is
36 * Pattern type: the given pattern must match the
42 * Pattern type: the given pattern is interpreted with a
53 * Pattern type: the given pattern is interpreted with a regular
59 * evaluation implementation in which matching is done against the pattern i
    [all...]
  /external/icu/icu4c/source/i18n/
strmatch.cpp 37 theString.extractBetween(start, limit, pattern);
44 pattern(o.pattern),
98 for (i=pattern.length()-1; i>=0; --i) {
99 UChar keyChar = pattern.charAt(i);
124 for (i=0; i<pattern.length(); ++i) {
130 UChar keyChar = pattern.charAt(i);
170 for (int32_t i=0; i<pattern.length(); ++i) {
171 UChar keyChar = pattern.charAt(i);
193 if (pattern.length() == 0)
    [all...]
  /external/tensorflow/tensorflow/contrib/quantize/python/
graph_matcher.py 24 class Pattern(object):
29 """Returns the result of matching op/tensor against this pattern."""
33 class OpTypePattern(Pattern):
34 """A tree pattern that matches TF expressions with certain op types."""
46 name: Optional string. The name of the pattern that can be looked up in
48 inputs: Optional list of `Pattern`s or strings that specify the
49 patterns for the inputs of a matching op. If None, this pattern accepts
58 if isinstance(input_pattern, Pattern) else OpTypePattern(input_pattern)
75 # If pattern.inputs is empty, skips the rest and accepts all the inputs.
89 class OneofPattern(Pattern)
    [all...]
  /build/blueprint/
glob.go 25 Pattern string
32 func verifyGlob(fileName, pattern string, excludes []string, g GlobPath) {
33 if pattern != g.Pattern {
34 panic(fmt.Errorf("Mismatched patterns %q and %q for glob file %q", pattern, g.Pattern, fileName))
47 func (c *Context) glob(pattern string, excludes []string) ([]string, error) {
48 fileName := globToFileName(pattern, excludes)
57 verifyGlob(fileName, pattern, excludes, g)
62 files, deps, err := c.fs.Glob(pattern, excludes
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/impl/number/
PatternStringParser.java 17 * Runs the recursive descent parser on the given pattern string, returning a data structure with raw information
18 * about the pattern string.
24 * The LDML decimal format pattern (Excel-style pattern) to parse.
35 * Parses a pattern string into a new property bag.
37 * @param pattern
38 * The pattern string, like "#,##0.00"
41 * pattern. This may be desirable if a custom rounding mode, such as CurrencyUsage, is to be used
47 * If there is a syntax error in the pattern string.
49 public static DecimalFormatProperties parseToProperties(String pattern, int ignoreRounding)
86 public String pattern; field in class:PatternStringParser.ParsedPatternInfo
204 final String pattern; field in class:PatternStringParser.ParserState
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/
PatternStringParser.java 15 * Runs the recursive descent parser on the given pattern string, returning a data structure with raw information
16 * about the pattern string.
22 * The LDML decimal format pattern (Excel-style pattern) to parse.
33 * Parses a pattern string into a new property bag.
35 * @param pattern
36 * The pattern string, like "#,##0.00"
39 * pattern. This may be desirable if a custom rounding mode, such as CurrencyUsage, is to be used
45 * If there is a syntax error in the pattern string.
47 public static DecimalFormatProperties parseToProperties(String pattern, int ignoreRounding)
84 public String pattern; field in class:PatternStringParser.ParsedPatternInfo
202 final String pattern; field in class:PatternStringParser.ParserState
    [all...]

Completed in 1117 milliseconds

<<11121314151617181920>>