/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | Lexer.cs | 166 // Match() routine has already called recover() 250 public virtual void Match( string s ) method in class:Antlr.Runtime.Lexer 277 public virtual void Match( int c ) method in class:Antlr.Runtime.Lexer
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/ |
H A D | SlimLexer.cs | 266 public void Match( string s ) method in class:Antlr.Runtime.SlimLexer 293 public void Match( int c ) method in class:Antlr.Runtime.SlimLexer
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
H A D | ASTTreeParser.stg | 88 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()> 90 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()> 93 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()> 95 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()> 155 /** Match ^(label+=TOKEN ...) auto construct */ 161 /** Match . wildcard and auto dup the node/subtree */
|
H A D | CSharp2.stg | 910 <if(label)><label>=(<labelType>)<endif>Match(input,<token>,Follow._<token>_in_<ruleName><elementIndex>); <checkRuleBacktrackFailure()> 929 Match(<char>); <checkRuleBacktrackFailure()> 995 /** Match a string literal */ 999 Match(<string>); <checkRuleBacktrackFailure()><\n> 1006 Match(<string>); <checkRuleBacktrackFailure()><\n> 1022 /** Match . wildcard in lexer */ 1035 /** Match a rule reference by invoking it possibly with arguments 1086 Match(EOF); <checkRuleBacktrackFailure()><\n> 1091 Match(EOF); <checkRuleBacktrackFailure()> 1110 Match(inpu [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
H A D | ASTTreeParser.stg | 89 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()> 91 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()> 94 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()> 96 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()> 156 /** Match ^(label+=TOKEN ...) auto construct */ 162 /** Match . wildcard and auto dup the node/subtree */
|
H A D | CSharp3.stg | 886 <if(label)><label>=(<labelType>)<endif>Match(input,<token>,Follow._<token>_in_<ruleName><elementIndex>); <checkRuleBacktrackFailure()> 909 Match(<char>); <checkRuleBacktrackFailure()> 975 /** Match a string literal */ 979 Match(<string>); <checkRuleBacktrackFailure()><\n> 986 Match(<string>); <checkRuleBacktrackFailure()><\n> 1002 /** Match . wildcard in lexer */ 1015 /** Match a rule reference by invoking it possibly with arguments 1066 Match(EOF); <checkRuleBacktrackFailure()><\n> 1071 Match(EOF); <checkRuleBacktrackFailure()> 1089 Match(inpu [all...] |
/external/libcxx/utils/google-benchmark/test/ |
H A D | output_test_helper.cc | 80 CHECK(!NC.regex->Match(line)) 86 if (TC.regex->Match(line)) return;
|
/external/regex-re2/doc/ |
H A D | mksyntaxgo | 27 facilities of package regexp (such as Compile and Match) instead of this package.
|
/external/selinux/python/sepolgen/src/sepolgen/ |
H A D | matching.py | 31 class Match(util.Comparison): class in inherits:util.Comparison 52 # Match objects that pass the threshold 54 # Match objects over the threshold 246 m = Match(iv, dist)
|
/external/swiftshader/third_party/subzero/pydir/ |
H A D | crosstest_generator.py | 13 def Match(desc, includes, excludes, default_match): function 170 if Match(set(desc), includes, excludes, default_match):
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
H A D | StringSearch.java | 69 * Match results in the forward direction will match the result matches in 984 private static class Match { class in class:StringSearch 989 private boolean search(int startIdx, Match m) { 1263 private boolean searchBackwards(int startIdx, Match m) { 1508 Match match = new Match(); 1559 Match match = new Match();
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
H A D | StringSearch.java | 68 * Match results in the forward direction will match the result matches in 1000 private static class Match { class in class:StringSearch 1005 private boolean search(int startIdx, Match m) { 1279 private boolean searchBackwards(int startIdx, Match m) { 1524 Match match = new Match(); 1575 Match match = new Match();
|
/external/llvm/lib/Target/X86/AsmParser/ |
H A D | X86AsmParser.cpp | 824 /// @name Auto-generated Match Functions 2665 unsigned Match[4]; local 2667 for (unsigned I = 0, E = array_lengthof(Match); I != E; ++I) { 2669 Match[I] = MatchInstructionImpl(Operands, Inst, ErrorInfoIgnore, 2672 if (Match[I] == Match_MissingFeature) 2683 std::count(std::begin(Match), std::end(Match), Match_Success); 2699 for (unsigned I = 0, E = array_lengthof(Match); I != E; ++I) 2700 if (Match[I] == Match_Success) 2722 if (std::count(std::begin(Match), st 2810 SmallVector<unsigned, 8> Match; local [all...] |
/external/google-benchmark/test/ |
H A D | output_test_helper.cc | 90 CHECK(!NC.regex->Match(line)) 96 if (TC.regex->Match(line)) return; 232 if(!p.regex->Match(r.name)) {
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_suppressions.cc | 78 bool SuppressionContext::Match(const char *str, const char *type, function in class:__sanitizer::SuppressionContext 104 // Context must not mutate once Match has been called.
|
/external/regex-re2/re2/testing/ |
H A D | exhaustive_tester.cc | 60 if (!re.Match(input, 0, input.size(), anchor, m, n)) {
|
/external/swiftshader/third_party/LLVM/utils/FileCheck/ |
H A D | FileCheck.cpp | 84 /// Match - Match the pattern string against the input buffer Buffer. This 90 size_t Match(StringRef Buffer, size_t &MatchLen, 279 /// Match - Match the pattern string against the input buffer Buffer. This 282 size_t Pattern::Match(StringRef Buffer, size_t &MatchLen, function in class:Pattern 323 // Match the newly constructed regex. 693 size_t MatchPos = CheckStr.Pat.Match(Buffer, MatchLen, VariableTable); 741 size_t Pos = CheckStr.NotStrings[ChunkNo].second.Match(SkippedRegion,
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
H A D | Delphi.stg | 1039 <if(label)><label> := <endif>Match(Input, <token>, FOLLOW_<token>_in_<ruleName><elementIndex>)<if(label)> as I<labelType><endif>;<\n><checkRuleBacktrackFailure()> 1058 Match(<char>); <checkRuleBacktrackFailure()> 1110 /** Match a string literal */ 1114 Match(<string>); <checkRuleBacktrackFailure()> 1117 Match(<string>); <checkRuleBacktrackFailure()> 1133 /** Match . wildcard in lexer */ 1146 /** Match a rule reference by invoking it possibly with arguments 1196 Match(EOF); <checkRuleBacktrackFailure()> 1199 Match(EOF); <checkRuleBacktrackFailure()> 1211 Match(Inpu [all...] |
/external/regex-re2/re2/ |
H A D | re2.cc | 356 if (!re.Match(*str, 0, str->size(), UNANCHORED, vec, nvec)) 383 if (!re.Match(*str, p - str->data(), str->size(), UNANCHORED, vec, nvec)) 418 if (!re.Match(text, 0, text.size(), UNANCHORED, vec, nvec)) 525 bool RE2::Match(const StringPiece& text, function in class:re2::RE2 620 LOG(INFO) << "Match " << trunc(pattern_) 626 LOG(INFO) << "Match " << trunc(pattern_) 632 LOG(INFO) << "Match " << trunc(pattern_) 649 LOG(INFO) << "Match " << trunc(pattern_) 655 LOG(INFO) << "Match " << trunc(pattern_) 663 LOG(INFO) << "Match " << trun [all...] |
H A D | compile.cc | 168 Frag Match(int32 id); 420 Frag Compiler::Match(int32 match_id) { function in class:re2::Compiler 733 Frag f = Match(re->match_id()); 1014 // Success! Finish by putting Match node at end, and record start. 1018 Frag all = c.Cat(f, c.Match(0));
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
H A D | InstrEmitter.cpp | 95 bool Match = true; local 102 Match = false; 104 Match = false; 113 Match = false; 132 MatchReg &= Match;
|
/external/compiler-rt/lib/lsan/ |
H A D | lsan_common.cc | 502 if (suppressions->Match(module_name, kSuppressionLeak, &s)) 508 if (suppressions->Match(cur->info.function, kSuppressionLeak, &s) || 509 suppressions->Match(cur->info.file, kSuppressionLeak, &s)) {
|
/external/nist-sip/java/gov/nist/core/ |
H A D | GenericObject.java | 82 protected Match matchExpression; // Pattern matcher. 106 * Regular expressions matching implements the gov.nist.sip.Match interface 108 * package included herein. This can be used to implement the Match interface 112 public void setMatcher(Match matchExpression) { 121 public Match getMatcher() {
|
/external/llvm/lib/Support/ |
H A D | YAMLTraits.cpp | 564 bool Output::matchEnumScalar(const char *Str, bool Match) { argument 565 if (Match && !EnumerationMatchFound) {
|
/external/protobuf/csharp/src/Google.Protobuf/ |
H A D | JsonParser.cs | 788 var match = TimestampRegex.Match(token.StringValue); 864 var match = DurationRegex.Match(token.StringValue);
|