/external/chromium_org/tools/grit/grit/ |
H A D | lazy_re_unittest.py | 29 rex = lazy_re.compile(flags=re.I, pattern='BiNgO')
|
/external/chromium_org/tools/oopif/ |
H A D | iframe_server.py | 69 # pattern specifies how the sites are layed out per depth. An empty string 81 self.pattern = query_dict.get('pattern', [''] )[0] 112 if params.pattern: 113 host = params.pattern[params.pattern_pos] 114 params.pattern_pos = (params.pattern_pos + 1) % len(params.pattern)
|
/external/e2fsprogs/debugfs/ |
H A D | zap.c | 29 unsigned long pattern = 0; local 64 pattern = parse_ulong(optarg, argv[0], 65 "pattern", &err); 68 if (pattern >= 256) { 69 com_err(argv[0], 0, "The fill pattern must " 116 "[-l length] [-p pattern] block_num"); 155 memset(buf+offset, pattern, length);
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
H A D | ant-apache-regexp.jar | ... .ant.util.regexp.RegexpMatcher {
private String pattern public void " href="/5.1.0_r1/s? ... |
/external/elfutils/0.153/libasm/ |
H A D | asm_newscn.c | 42 /* Memory for the default pattern. The type uses a flexible array 47 struct FillPattern pattern; member in struct:__anon21136 51 .pattern = 57 const struct FillPattern *__libasm_default_pattern = &xdefault_pattern.pattern; 122 /* Put the default fill pattern in place. */ 123 result->pattern = (struct FillPattern *) __libasm_default_pattern;
|
/external/emma/core/java12/com/vladium/emma/filter/ |
H A D | IInclExclFilter.java | 192 final String pattern = (String) i.next (); 194 m_inclusions [ii] = WCMatcher.compile (pattern); 207 final String pattern = (String) i.next (); 209 m_exclusions [ii] = WCMatcher.compile (pattern);
|
/external/emma/core/java12/com/vladium/util/args/ |
H A D | IOptsParser.java | 52 IOpt [] getOpts (String pattern); argument
|
/external/gtest/test/ |
H A D | gtest_output_test.py | 167 def RemoveMatchingTests(test_output, pattern): 175 pattern: A regex string that matches names of test cases or 179 Contents of test_output with tests whose names match pattern removed. 184 pattern, pattern), 187 return re.sub(r'.*%s.*\n' % pattern, '', test_output)
|
/external/icu/icu4c/source/test/intltest/ |
H A D | dcfmtest.h | 52 const UnicodeString &pattern,
|
H A D | dtptngts.cpp | 440 // add new pattern 458 // get a pattern and modify it 462 UnicodeString pattern; local 463 pattern = format->toPattern(pattern); 473 UnicodeString newPattern = gen->replaceFieldTypes(pattern, UnicodeString("vvvv"), status); 509 pattern = UnicodeString("dd-MMM"); 512 UnicodeString retSkeleton = gen->getSkeleton(pattern, status); 517 retSkeleton = gen->getBaseSkeleton(pattern, status); 523 pattern 907 UnicodeString pattern = dtpgen->getBestPattern(skel, options, status); local 1021 UnicodeString pattern = dtpg->getBestPattern(skeleton, status); local 1047 ", produces pattern without required chars: " + pattern); local [all...] |
H A D | ucdtest.cpp | 306 UnicodeString pattern=UNICODE_STRING_SIMPLE("[:Alphabetic=:]"); local 307 pattern.insert(pattern.length()-2, UnicodeString(falseValues[i], -1, US_INV)); 309 UnicodeSet set(pattern, errorCode); 320 UnicodeString pattern=UNICODE_STRING_SIMPLE("[:Alphabetic=:]"); local 321 pattern.insert(pattern.length()-2, UnicodeString(trueValues[i], -1, US_INV)); 323 UnicodeSet set(pattern, errorCode); 492 UnicodeString pattern; local 494 UnicodeString("[]"), rtl.toPattern(pattern)); [all...] |
/external/llvm/utils/lit/lit/formats/ |
H A D | base.py | 40 pattern=".*", useTempInput=False): 49 self.pattern = re.compile(pattern) 68 not self.pattern.match(filename) or
|
/external/protobuf/gtest/test/ |
H A D | gtest_output_test.py | 140 def RemoveMatchingTests(test_output, pattern): 148 pattern: A regex string that matches names of test cases or 152 Contents of test_output with tests whose names match pattern removed. 157 pattern, pattern), 160 return re.sub(r'.*%s.*\n' % pattern, '', test_output)
|
/external/regex-re2/re2/ |
H A D | filtered_re2.h | 40 RE2::ErrorCode Add(const StringPiece& pattern,
|
H A D | re2.h | 37 // supplied pattern exactly. 48 // By default, the pattern and input text are interpreted as UTF-8. 88 // You can use the "PartialMatch" operation when you want the pattern 106 // object from the pattern and use it multiple times. If you do so, 109 // Example: precompile pattern for faster matching: 110 // RE2 pattern("h.*o"); 112 // if (RE2::FullMatch(str, pattern)) ...; 159 // bool match = RE2::FullMatchN(input, pattern, args, n); 163 // bool match = RE2::FullMatch(input, pattern, 243 ErrorPatternTooLarge, // pattern to 275 const string& pattern() const { return pattern_; } function in class:re2::RE2 [all...] |
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | dtptngts.cpp | 440 // add new pattern 458 // get a pattern and modify it 462 UnicodeString pattern; local 463 pattern = format->toPattern(pattern); 473 UnicodeString newPattern = gen->replaceFieldTypes(pattern, UnicodeString("vvvv"), status); 509 pattern = UnicodeString("dd-MMM"); 512 UnicodeString retSkeleton = gen->getSkeleton(pattern, status); 517 retSkeleton = gen->getBaseSkeleton(pattern, status); 523 pattern 894 UnicodeString pattern = dtpgen->getBestPattern(skel, options, status); local 1008 UnicodeString pattern = dtpg->getBestPattern(skeleton, status); local 1034 ", produces pattern without required chars: " + pattern); local [all...] |
H A D | ucdtest.cpp | 306 UnicodeString pattern=UNICODE_STRING_SIMPLE("[:Alphabetic=:]"); local 307 pattern.insert(pattern.length()-2, UnicodeString(falseValues[i], -1, US_INV)); 309 UnicodeSet set(pattern, errorCode); 320 UnicodeString pattern=UNICODE_STRING_SIMPLE("[:Alphabetic=:]"); local 321 pattern.insert(pattern.length()-2, UnicodeString(trueValues[i], -1, US_INV)); 323 UnicodeSet set(pattern, errorCode); 492 UnicodeString pattern; local 494 UnicodeString("[]"), rtl.toPattern(pattern)); [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreeWizard.cs | 60 * patterns like "(A B C)". You can create a tree from that pattern or 273 /** <summary>Return a List of subtrees matching pattern.</summary> */ 274 public virtual IList Find(object t, string pattern) { argument 276 // Create a TreePattern from the pattern 277 TreePatternLexer tokenizer = new TreePatternLexer(pattern); 296 public virtual object FindFirst(object t, string pattern) { argument 302 * version of the general visit(t, pattern) method. The labels arg 304 * a token type rather than a pattern doesn't let us set a label. 353 * For all subtrees that match the pattern, execute the visit action. 354 * The implementation uses the root node of the pattern i 359 Visit(object t, string pattern, IContextVisitor visitor) argument 391 Parse(object t, string pattern, IDictionary<string, object> labels) argument 404 Parse(object t, string pattern) argument 467 Create(string pattern) argument [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | TreeWizard.cs | 61 * patterns like "(A B C)". You can create a tree from that pattern or 313 /** <summary>Return a List of subtrees matching pattern.</summary> */ 314 public virtual IList Find( object t, string pattern ) 317 // Create a TreePattern from the pattern 318 TreePatternLexer tokenizer = new TreePatternLexer( pattern ); 339 public virtual object FindFirst( object t, string pattern ) 346 * version of the general visit(t, pattern) method. The labels arg 348 * a token type rather than a pattern doesn't let us set a label. 407 * For all subtrees that match the pattern, execute the visit action. 408 * The implementation uses the root node of the pattern i 413 Visit( object t, string pattern, IContextVisitor visitor ) argument 447 Parse( object t, string pattern, IDictionary<string, object> labels ) argument [all...] |
/external/chromium_org/third_party/re2/re2/ |
H A D | re2.h | 37 // supplied pattern exactly. 48 // By default, the pattern and input text are interpreted as UTF-8. 88 // You can use the "PartialMatch" operation when you want the pattern 106 // object from the pattern and use it multiple times. If you do so, 109 // Example: precompile pattern for faster matching: 110 // RE2 pattern("h.*o"); 112 // if (RE2::FullMatch(str, pattern)) ...; 159 // bool match = RE2::FullMatchN(input, pattern, args, n); 163 // bool match = RE2::FullMatch(input, pattern, 243 ErrorPatternTooLarge, // pattern to 275 const string& pattern() const { return pattern_; } function in class:re2::RE2 [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
H A D | TemplateSubPatternAssociation.java | 33 * A class to contain a match pattern and it's corresponding template. 34 * This class also defines a node in a match pattern linked list. 40 /** Step pattern */ 43 /** Template pattern */ 49 /** Next pattern */ 52 /** Flag indicating whether this is wild card pattern */ 55 /** Target string for this match pattern */ 59 * Construct a match pattern from a pattern and template. 60 * @param template The node that contains the template for this pattern 64 TemplateSubPatternAssociation(ElemTemplate template, StepPattern pattern, String pat) argument [all...] |
/external/chromium_org/base/android/java/src/org/chromium/base/ |
H A D | SysUtils.java | 51 Pattern pattern = Pattern.compile("^MemTotal:\\s+([0-9]+) kB$"); 66 Matcher m = pattern.matcher(line);
|
/external/chromium_org/chrome/tools/build/mac/ |
H A D | dump_product_syms | 68 local pattern="\ 70 sed -E -e "${pattern}" < "${original_sym_path}" > "${variant_sym_path}"
|
/external/chromium_org/components/data_reduction_proxy/browser/ |
H A D | data_reduction_proxy_config_service.h | 105 virtual void AddHostPatternToBypass(const std::string& pattern) OVERRIDE; 106 virtual void AddURLPatternToBypass(const std::string& pattern) OVERRIDE;
|
/external/chromium_org/content/browser/service_worker/ |
H A D | service_worker_context_wrapper.h | 69 const GURL& pattern, 72 virtual void UnregisterServiceWorker(const GURL& pattern,
|