/external/chromium_org/third_party/libaddressinput/src/cpp/src/util/ |
H A D | string_compare.cc | 26 // RE2 uses type string, which is not necessarily the same as type std::string. 28 // to these objects to RE2, the function that does that is defined inside an 33 // In order to (mis-)use RE2 to implement UTF-8 capable less<>, this function 34 // calls RE2::PossibleMatchRange() to calculate the "lessest" string that would 38 string min, max; // N.B.: RE2 type string! 40 RE2::Options options; 43 RE2 matcher(str, options); 70 RE2 matcher(b, options_); 71 return RE2::FullMatch(a, matcher); 81 RE2 [all...] |
/external/chromium_org/third_party/re2/re2/testing/ |
H A D | exhaustive_tester.cc | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved. 59 static void PrintResult(const RE2& re, const StringPiece& input, RE2::Anchor anchor, StringPiece *m, int n) { 102 RE2 re(regexp); 103 RE2::Options longest; 105 RE2 relongest(regexp, longest); 112 PrintResult(re, input, RE2::ANCHOR_BOTH, group, ngroup); 114 PrintResult(re, input, RE2::UNANCHORED, group, ngroup); 116 PrintResult(relongest, input, RE2::ANCHOR_BOTH, group, ngroup); 118 PrintResult(relongest, input, RE2 [all...] |
H A D | regexp_benchmark.cc | 1 // Copyright 2006-2008 The RE2 Authors. All Rights Reserved. 88 RE2 re(regexp); 89 fprintf(stderr, "RE2: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 90 RE2::FullMatch(text, re); 91 fprintf(stderr, "RE2: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 94 fprintf(stderr, "sizeof: PCRE=%d RE2=%d Prog=%d Inst=%d\n", 96 static_cast<int>(sizeof(RE2)), 272 RE2 re("((Hello World))"); 276 CHECK(RE2::FindAndConsume(&t, re, &u)); 294 // Unambiguous search (RE2 ca [all...] |
H A D | re2_arg_test.cc | 1 // Copyright 2005 The RE2 Authors. All Rights Reserved. 8 // supported by RE2::Arg class 96 RE2::Arg arg(&r); \
|
H A D | tester.h | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved. 29 kEngineRE2, // RE2, all submatches 30 kEngineRE2a, // RE2, only ask for match[0] 31 kEngineRE2b, // RE2, only ask whether it matched 85 RE2* re2_; // RE2 implementation
|
/external/regex-re2/re2/testing/ |
H A D | exhaustive_tester.cc | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved. 59 static void PrintResult(const RE2& re, const StringPiece& input, RE2::Anchor anchor, StringPiece *m, int n) { 102 RE2 re(regexp); 103 RE2::Options longest; 105 RE2 relongest(regexp, longest); 112 PrintResult(re, input, RE2::ANCHOR_BOTH, group, ngroup); 114 PrintResult(re, input, RE2::UNANCHORED, group, ngroup); 116 PrintResult(relongest, input, RE2::ANCHOR_BOTH, group, ngroup); 118 PrintResult(relongest, input, RE2 [all...] |
H A D | regexp_benchmark.cc | 1 // Copyright 2006-2008 The RE2 Authors. All Rights Reserved. 88 RE2 re(regexp); 89 fprintf(stderr, "RE2: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 90 RE2::FullMatch(text, re); 91 fprintf(stderr, "RE2: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 94 fprintf(stderr, "sizeof: PCRE=%d RE2=%d Prog=%d Inst=%d\n", 96 static_cast<int>(sizeof(RE2)), 272 RE2 re("((Hello World))"); 276 CHECK(RE2::FindAndConsume(&t, re, &u)); 294 // Unambiguous search (RE2 ca [all...] |
H A D | re2_arg_test.cc | 1 // Copyright 2005 The RE2 Authors. All Rights Reserved. 8 // supported by RE2::Arg class 96 RE2::Arg arg(&r); \
|
H A D | tester.h | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved. 29 kEngineRE2, // RE2, all submatches 30 kEngineRE2a, // RE2, only ask for match[0] 31 kEngineRE2b, // RE2, only ask whether it matched 85 RE2* re2_; // RE2 implementation
|
/external/chromium_org/chrome/browser/chromeos/login/ |
H A D | hwid_checker.cc | 41 if (!RE2::FullMatch(hwid, "([\\s\\S]*) (\\d{4})", &body, &checksum)) 47 return RE2::PartialMatch(hwid, "^(SPRING [A-D])|(FALCO A)"); 65 if (!RE2::FullMatch(hwid, "[A-Z0-9]+ ((?:[A-Z2-7]{4}-)*[A-Z2-7]{1,4})", &bom)) 96 if (!RE2::FullMatch(hwid, regex, ¬_checksum, &checksum))
|
/external/chromium_org/extensions/common/ |
H A D | stack_frame.cc | 58 if (!re2::RE2::FullMatch(text, 61 !re2::RE2::FullMatch(text,
|
/external/chromium_org/third_party/re2/doc/ |
H A D | mksyntaxhtml | 25 <title>RE2 regular expression syntax reference</title> 28 <h1>RE2 regular expression syntax reference</h1> 31 <tr><td colspan=2>This page lists the regular expression syntax accepted by RE2.</td></tr> 33 <tr><td colspan=2>Grayed out expressions are not supported by RE2.</td></tr>
|
H A D | mksyntaxwiki | 27 <tr><td colspan="2">This page lists the regular expression syntax accepted by RE2.</td></tr> 29 <tr><td colspan="2">Grayed out expressions are not supported by RE2.</td></tr>
|
/external/chromium_org/third_party/re2/re2/ |
H A D | prefilter.h | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved. 16 class RE2; 49 // Given a RE2, return a Prefilter. The caller takes ownership of 52 static Prefilter* FromRE2(const RE2* re2);
|
H A D | compile.cc | 1 // Copyright 2007 The RE2 Authors. All Rights Reserved. 136 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor, 212 void Setup(Regexp::ParseFlags, int64, RE2::Anchor); 235 RE2::Anchor anchor_; // anchor mode for RE2::Set 736 if (anchor_ != RE2::ANCHOR_BOTH) 953 RE2::Anchor anchor) { 995 c.Setup(re->parse_flags(), max_mem, RE2::ANCHOR_BOTH /* unused */); 1093 Prog* Compiler::CompileSet(const RE2 [all...] |
/external/regex-re2/doc/ |
H A D | mksyntaxhtml | 25 <title>RE2 regular expression syntax reference</title> 28 <h1>RE2 regular expression syntax reference</h1> 31 <tr><td colspan=2>This page lists the regular expression syntax accepted by RE2.</td></tr> 33 <tr><td colspan=2>Grayed out expressions are not supported by RE2.</td></tr>
|
H A D | mksyntaxwiki | 27 <tr><td colspan="2">This page lists the regular expression syntax accepted by RE2.</td></tr> 29 <tr><td colspan="2">Grayed out expressions are not supported by RE2.</td></tr>
|
/external/regex-re2/re2/ |
H A D | prefilter.h | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved. 16 class RE2; 49 // Given a RE2, return a Prefilter. The caller takes ownership of 52 static Prefilter* FromRE2(const RE2* re2);
|
H A D | compile.cc | 1 // Copyright 2007 The RE2 Authors. All Rights Reserved. 135 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor, 211 void Setup(Regexp::ParseFlags, int64, RE2::Anchor); 234 RE2::Anchor anchor_; // anchor mode for RE2::Set 735 if (anchor_ != RE2::ANCHOR_BOTH) 952 RE2::Anchor anchor) { 994 c.Setup(re->parse_flags(), max_mem, RE2::ANCHOR_BOTH /* unused */); 1092 Prog* Compiler::CompileSet(const RE2 [all...] |
/external/chromium_org/components/url_matcher/ |
H A D | regex_set_matcher.cc | 82 RE2::ErrorCode error = filtered_re2_->Add( 83 it->second->pattern(), RE2::DefaultOptions, &re2_id); 84 if (error == RE2::NoError) {
|
/external/chromium_org/tools/ipc_fuzzer/mutate/ |
H A D | message_util.cc | 69 bool MessageMatches(const IPC::Message* msg, const RE2& pattern) { 70 return RE2::FullMatch(MessageName(msg), pattern); 100 RE2 filter_pattern(cmd->GetSwitchValueASCII(kRegexpSwitch));
|
/external/chromium_org/third_party/libaddressinput/src/cpp/src/ |
H A D | rule.cc | 151 : new RE2ptr(new RE2(rule.postal_code_matcher_->ptr->pattern(), 205 // In order to make the RE2 object created from the "zip" field useable for 208 // RE2::PartialMatch() to perform prefix matching or else with 209 // RE2::FullMatch() to perform matching against the entire string. 210 RE2::Options options; 212 RE2* matcher = new RE2("^(" + value + ")", options);
|
H A D | address_data.cc | 67 static const RE2 kMatcher("\\S"); 68 return str.empty() || !RE2::PartialMatch(str, kMatcher);
|
H A D | address_input_helper.cc | 137 RE2::FullMatch(address->postal_code, *postal_code_reg_exp->ptr)) { 163 RE2::PartialMatch(address.postal_code, *postal_code_prefix->ptr)) {
|
H A D | validation_task.cc | 193 !RE2::FullMatch(address_.postal_code, *format_ptr->ptr) && 210 if (!RE2::PartialMatch(address_.postal_code, *prefix_ptr->ptr)) { 238 if (RE2::PartialMatch(*line, *(*matcher)->ptr)) {
|