SYMBOL INDEX (942 symbols across 88 files) FILE: app/_re2.cc type re2_app (line 13) | namespace re2_app { type Info (line 15) | struct Info { function Info (line 29) | Info GetInfo(const std::string& pattern) { function EMSCRIPTEN_BINDINGS (line 77) | EMSCRIPTEN_BINDINGS(_re2) { FILE: app/_re2.d.ts type Info (line 5) | type Info = { type MainModule (line 19) | interface MainModule { FILE: app/app.ts class RE2Dev (line 18) | class RE2Dev extends LitElement { method constructor (line 22) | constructor() { method render (line 43) | override render() { type HTMLElementTagNameMap (line 108) | interface HTMLElementTagNameMap { FILE: benchlog/benchplot.py class gnuplot (line 8) | class gnuplot(object): method __enter__ (line 27) | def __enter__(self): method __exit__ (line 30) | def __exit__(self, type, value, traceback): method parse_re2_benchlog (line 38) | def parse_re2_benchlog(self, filename): method gen_csv (line 61) | def gen_csv(self): method run (line 76) | def run(self): FILE: python/_re2.cc type re2_python (line 30) | namespace re2_python { function FromBytes (line 40) | static inline absl::string_view FromBytes(const py::buffer_info& bytes) { function OneCharLen (line 46) | static inline int OneCharLen(const char* ptr) { function CharLenToBytes (line 52) | ssize_t CharLenToBytes(py::buffer buffer, ssize_t pos, ssize_t len) { function BytesToCharLen (line 66) | ssize_t BytesToCharLen(py::buffer buffer, ssize_t pos, ssize_t endpos) { function RE2InitShim (line 79) | std::unique_ptr RE2InitShim(py::buffer buffer, function RE2ErrorShim (line 86) | py::bytes RE2ErrorShim(const RE2& self) { function RE2NamedCapturingGroupsShim (line 91) | std::vector> RE2NamedCapturingGroupsShim( function RE2ProgramFanoutShim (line 102) | std::vector RE2ProgramFanoutShim(const RE2& self) { function RE2ReverseProgramFanoutShim (line 108) | std::vector RE2ReverseProgramFanoutShim(const RE2& self) { function RE2PossibleMatchRangeShim (line 114) | std::tuple RE2PossibleMatchRangeShim( function RE2MatchShim (line 121) | std::vector> RE2MatchShim(const RE2& self, function RE2QuoteMetaShim (line 151) | py::bytes RE2QuoteMetaShim(py::buffer buffer) { class Set (line 158) | class Set { method Set (line 160) | Set(RE2::Anchor anchor, const RE2::Options& options) method Set (line 166) | Set(const Set&) = delete; method Set (line 167) | Set& operator=(const Set&) = delete; method Add (line 169) | int Add(py::buffer buffer) { method Compile (line 176) | bool Compile() { method Match (line 181) | std::vector Match(py::buffer buffer) const { class Filter (line 194) | class Filter { method Filter (line 196) | Filter() = default; method Filter (line 200) | Filter(const Filter&) = delete; method Filter (line 201) | Filter& operator=(const Filter&) = delete; method Add (line 203) | int Add(py::buffer buffer, const RE2::Options& options) { method Compile (line 211) | bool Compile() { method Match (line 228) | std::vector Match(py::buffer buffer, bool potential) const { method RE2 (line 247) | const RE2& GetRE2(int index) const { function PYBIND11_MODULE (line 256) | PYBIND11_MODULE(_re2, module) { FILE: python/re2.py class Options (line 41) | class Options(_re2.RE2.Options): function compile (line 62) | def compile(pattern, options=None): function search (line 73) | def search(pattern, text, options=None): function match (line 77) | def match(pattern, text, options=None): function fullmatch (line 81) | def fullmatch(pattern, text, options=None): function finditer (line 85) | def finditer(pattern, text, options=None): function findall (line 89) | def findall(pattern, text, options=None): function split (line 93) | def split(pattern, text, maxsplit=0, options=None): function subn (line 97) | def subn(pattern, repl, text, count=0, options=None): function sub (line 101) | def sub(pattern, repl, text, count=0, options=None): function _encode (line 105) | def _encode(t): function _decode (line 109) | def _decode(b): function escape (line 113) | def escape(pattern): function purge (line 124) | def purge(): class _Regexp (line 132) | class _Regexp(object): method _make (line 138) | def _make(cls, pattern, values): method __init__ (line 144) | def __init__(self, pattern, options): method __getstate__ (line 157) | def __getstate__(self): method __setstate__ (line 161) | def __setstate__(self, state): method _match (line 168) | def _match(self, anchor, text, pos=None, endpos=None): method search (line 236) | def search(self, text, pos=None, endpos=None): method match (line 239) | def match(self, text, pos=None, endpos=None): method fullmatch (line 242) | def fullmatch(self, text, pos=None, endpos=None): method finditer (line 245) | def finditer(self, text, pos=None, endpos=None): method findall (line 248) | def findall(self, text, pos=None, endpos=None): method _split (line 261) | def _split(self, cb, text, maxsplit=0): method split (line 279) | def split(self, text, maxsplit=0): method subn (line 284) | def subn(self, repl, text, count=0): method sub (line 291) | def sub(self, repl, text, count=0): method pattern (line 296) | def pattern(self): method options (line 300) | def options(self): method groups (line 304) | def groups(self): method groupindex (line 308) | def groupindex(self): method programsize (line 317) | def programsize(self): method reverseprogramsize (line 321) | def reverseprogramsize(self): method programfanout (line 325) | def programfanout(self): method reverseprogramfanout (line 329) | def reverseprogramfanout(self): method possiblematchrange (line 332) | def possiblematchrange(self, maxlen): class _Match (line 339) | class _Match(object): method __init__ (line 343) | def __init__(self, regexp, text, pos, endpos, spans): method _split (line 359) | def _split(cls, template): method expand (line 387) | def expand(self, template): method __getitem__ (line 411) | def __getitem__(self, group): method group (line 424) | def group(self, *groups): method groups (line 430) | def groups(self, default=None): method groupdict (line 437) | def groupdict(self, default=None): method start (line 444) | def start(self, group=0): method end (line 449) | def end(self, group=0): method span (line 454) | def span(self, group=0): method re (line 460) | def re(self): method string (line 464) | def string(self): method pos (line 468) | def pos(self): method endpos (line 472) | def endpos(self): method lastindex (line 476) | def lastindex(self): method lastgroup (line 490) | def lastgroup(self): class Set (line 500) | class Set(object): method __init__ (line 505) | def __init__(self, anchor, options=None): method SearchSet (line 510) | def SearchSet(cls, options=None): method MatchSet (line 514) | def MatchSet(cls, options=None): method FullMatchSet (line 518) | def FullMatchSet(cls, options=None): method Add (line 521) | def Add(self, pattern): method Compile (line 531) | def Compile(self): method Match (line 535) | def Match(self, text): class Filter (line 544) | class Filter(object): method __init__ (line 549) | def __init__(self): method Add (line 553) | def Add(self, pattern, options=None): method Compile (line 565) | def Compile(self): method Match (line 569) | def Match(self, text, potential=False): method re (line 577) | def re(self, index): FILE: python/re2_test.py class OptionsTest (line 15) | class OptionsTest(parameterized.TestCase): method test_option (line 18) | def test_option(self, name): class Re2CompileTest (line 33) | class Re2CompileTest(parameterized.TestCase): method test_compile (line 45) | def test_compile(self, pattern, expected_groups, expected_groupindex): method test_compile_with_options (line 59) | def test_compile_with_options(self): method test_programsize_reverseprogramsize (line 65) | def test_programsize_reverseprogramsize(self): method test_programfanout_reverseprogramfanout (line 70) | def test_programfanout_reverseprogramfanout(self): method test_possiblematchrange (line 91) | def test_possiblematchrange(self, pattern, maxlen, expected_min_max): function upper (line 127) | def upper(match): class ReRegexpTest (line 131) | class ReRegexpTest(parameterized.TestCase): method test_pickle (line 137) | def test_pickle(self, pattern): method test_search (line 144) | def test_search(self, pattern, text, expected_spans): method test_search_with_pos_and_endpos (line 152) | def test_search_with_pos_and_endpos(self): method test_search_with_bogus_pos_and_endpos (line 169) | def test_search_with_bogus_pos_and_endpos(self): method test_match (line 188) | def test_match(self, pattern, text, expected_spans): method test_fullmatch (line 198) | def test_fullmatch(self, pattern, text, expected_spans): method test_finditer (line 226) | def test_finditer(self, pattern, text, expected_matches): method test_findall (line 240) | def test_findall(self, pattern, text, expected_matches): method test_split (line 258) | def test_split(self, pattern, text, maxsplit, expected_pieces): method test_subn_sub (line 278) | def test_subn_sub(self, pattern, repl, text, count, expected_joined_pi... class Re2RegexpTest (line 288) | class Re2RegexpTest(ReRegexpTest): method test_compile_with_latin1_encoding (line 293) | def test_compile_with_latin1_encoding(self): method test_finditer_with_utf8 (line 308) | def test_finditer_with_utf8(self, pattern, text, expected_matches): method test_purge (line 312) | def test_purge(self): method test_options (line 318) | def test_options(self): class Re2EscapeTest (line 325) | class Re2EscapeTest(parameterized.TestCase): method test_escape (line 336) | def test_escape(self, pattern, expected_escaped): class ReMatchTest (line 341) | class ReMatchTest(parameterized.TestCase): method test_expand (line 346) | def test_expand(self): method test_expand_with_octal (line 356) | def test_expand_with_octal(self): method test_getitem_group_groups_groupdict (line 374) | def test_getitem_group_groups_groupdict(self): method test_bogus_group_start_end_and_span (line 397) | def test_bogus_group_start_end_and_span(self): method test_lastindex_lastgroup (line 420) | def test_lastindex_lastgroup(self, pattern, text, expected_lastindex, class Re2MatchTest (line 430) | class Re2MatchTest(ReMatchTest): class SetTest (line 436) | class SetTest(absltest.TestCase): method test_search (line 438) | def test_search(self): method test_match (line 447) | def test_match(self): method test_fullmatch (line 456) | def test_fullmatch(self): class FilterTest (line 466) | class FilterTest(absltest.TestCase): method test_match (line 468) | def test_match(self): method test_issue_484 (line 486) | def test_issue_484(self): FILE: python/setup.py class BuildExt (line 45) | class BuildExt(setuptools.command.build_ext.build_ext): method build_extension (line 47) | def build_extension(self, ext): function options (line 82) | def options(): function include_dirs (line 91) | def include_dirs(): FILE: python/toolchains/generate.py function generate (line 11) | def generate(): FILE: re2/bitmap256.cc type re2 (line 11) | namespace re2 { FILE: re2/bitmap256.h function Clear (line 27) | void Clear() { FILE: re2/bitstate.cc type re2 (line 34) | namespace re2 { type Job (line 36) | struct Job { class BitState (line 42) | class BitState { method BitState (line 74) | BitState(const BitState&) = delete; method BitState (line 75) | BitState& operator=(const BitState&) = delete; FILE: re2/compile.cc type re2 (line 28) | namespace re2 { type PatchList (line 41) | struct PatchList { method PatchList (line 43) | static PatchList Mk(uint32_t p) { method Patch (line 49) | static void Patch(Prog::Inst* inst0, PatchList l, uint32_t p) { method PatchList (line 63) | static PatchList Append(Prog::Inst* inst0, PatchList l1, PatchList l... type Frag (line 83) | struct Frag { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) type Encoding (line 94) | enum Encoding { class Compiler (line 99) | class Compiler : public Regexp::Walker { method Compiler (line 223) | Compiler(const Compiler&) = delete; method Compiler (line 224) | Compiler& operator=(const Compiler&) = delete; function Frag (line 272) | Frag Compiler::NoMatch() { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function IsNoMatch (line 277) | static bool IsNoMatch(Frag a) { function Frag (line 282) | Frag Compiler::Cat(Frag a, Frag b) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 307) | Frag Compiler::Alt(Frag a, Frag b) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 331) | Frag Compiler::Plus(Frag a, bool nongreedy) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 348) | Frag Compiler::Star(Frag a, bool nongreedy) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 371) | Frag Compiler::Quest(Frag a, bool nongreedy) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 389) | Frag Compiler::ByteRange(int lo, int hi, bool foldcase) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 398) | Frag Compiler::Nop() { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 407) | Frag Compiler::Match(int32_t match_id) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 416) | Frag Compiler::EmptyWidth(EmptyOp empty) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 425) | Frag Compiler::Capture(Frag a, int n) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function MaxRune (line 440) | static int MaxRune(int len) { function MakeRuneCacheKey (line 474) | static uint64_t MakeRuneCacheKey(uint8_t lo, uint8_t hi, bool foldcase, function Frag (line 591) | Frag Compiler::FindByteRange(int root, int id) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 623) | Frag Compiler::EndRange() { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 794) | Frag Compiler::Copy(Frag arg) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 803) | Frag Compiler::ShortVisit(Regexp* re, Frag) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 809) | Frag Compiler::PreVisit(Regexp* re, Frag, bool* stop) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 817) | Frag Compiler::Literal(Rune r, bool foldcase) { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Frag (line 840) | Frag Compiler::PostVisit(Regexp* re, Frag, Frag, Frag* child_frags, method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function IsAnchorStart (line 989) | static bool IsAnchorStart(Regexp** pre, int depth) { function IsAnchorEnd (line 1036) | static bool IsAnchorEnd(Regexp** pre, int depth) { function Prog (line 1115) | Prog* Compiler::Compile(Regexp* re, bool reversed, int64_t max_mem) { function Prog (line 1163) | Prog* Compiler::Finish(Regexp* re) { function Prog (line 1206) | Prog* Regexp::CompileToProg(int64_t max_mem) { function Prog (line 1210) | Prog* Regexp::CompileToReverseProg(int64_t max_mem) { function Frag (line 1214) | Frag Compiler::DotStar() { method Frag (line 88) | Frag() : begin(0), end(kNullPatchList), nullable(false) {} method Frag (line 89) | Frag(uint32_t begin, PatchList end, bool nullable) function Prog (line 1219) | Prog* Compiler::CompileSet(Regexp* re, RE2::Anchor anchor, int64_t max... function Prog (line 1261) | Prog* Prog::CompileSet(Regexp* re, RE2::Anchor anchor, int64_t max_mem) { FILE: re2/dfa.cc type re2 (line 59) | namespace re2 { class DFA (line 76) | class DFA { method ok (line 80) | bool ok() const { return !init_failed_; } method kind (line 81) | Prog::MatchKind kind() { return kind_; } class RWLocker (line 112) | class RWLocker class StateSaver (line 113) | class StateSaver class Workq (line 114) | class Workq type State (line 119) | struct State { method IsMatch (line 120) | inline bool IsMatch() const { return (flag_ & kFlagMatch) != 0; } method H (line 123) | H AbslHashValue(H h, const State& a) { type StateHash (line 153) | struct StateHash { type StateEqual (line 160) | struct StateEqual { type SearchParams (line 237) | struct SearchParams { method SearchParams (line 238) | SearchParams(absl::string_view text, absl::string_view context, method SearchParams (line 265) | SearchParams(const SearchParams&) = delete; method SearchParams (line 266) | SearchParams& operator=(const SearchParams&) = delete; type StartInfo (line 271) | struct StartInfo { method StartInfo (line 272) | StartInfo() : start(NULL) {} method ByteMap (line 314) | int ByteMap(int c) { method DFA (line 344) | DFA(const DFA&) = delete; method DFA (line 345) | DFA& operator=(const DFA&) = delete; class DFA::Workq (line 368) | class DFA::Workq : public SparseSet { method Workq (line 371) | Workq(int n, int maxmark) : method is_mark (line 379) | bool is_mark(int i) { return i >= n_; } method maxmark (line 381) | int maxmark() { return maxmark_; } method clear (line 383) | void clear() { method mark (line 388) | void mark() { method size (line 395) | int size() { method insert (line 399) | void insert(int id) { method insert_new (line 405) | void insert_new(int id) { method Workq (line 416) | Workq(const Workq&) = delete; method Workq (line 417) | Workq& operator=(const Workq&) = delete; class DFA::RWLocker (line 1135) | class DFA::RWLocker { method RWLocker (line 1150) | RWLocker(const RWLocker&) = delete; method RWLocker (line 1151) | RWLocker& operator=(const RWLocker&) = delete; class DFA::StateSaver (line 1219) | class DFA::StateSaver { method StateSaver (line 1240) | StateSaver(const StateSaver&) = delete; method StateSaver (line 1241) | StateSaver& operator=(const StateSaver&) = delete; function DFA (line 1801) | DFA* Prog::GetDFA(MatchKind kind) { method ok (line 80) | bool ok() const { return !init_failed_; } method kind (line 81) | Prog::MatchKind kind() { return kind_; } class RWLocker (line 112) | class RWLocker class StateSaver (line 113) | class StateSaver class Workq (line 114) | class Workq type State (line 119) | struct State { method IsMatch (line 120) | inline bool IsMatch() const { return (flag_ & kFlagMatch) != 0; } method H (line 123) | H AbslHashValue(H h, const State& a) { type StateHash (line 153) | struct StateHash { type StateEqual (line 160) | struct StateEqual { type SearchParams (line 237) | struct SearchParams { method SearchParams (line 238) | SearchParams(absl::string_view text, absl::string_view context, method SearchParams (line 265) | SearchParams(const SearchParams&) = delete; method SearchParams (line 266) | SearchParams& operator=(const SearchParams&) = delete; type StartInfo (line 271) | struct StartInfo { method StartInfo (line 272) | StartInfo() : start(NULL) {} method ByteMap (line 314) | int ByteMap(int c) { method DFA (line 344) | DFA(const DFA&) = delete; method DFA (line 345) | DFA& operator=(const DFA&) = delete; FILE: re2/filtered_re2.cc type re2 (line 18) | namespace re2 { function FilteredRE2 (line 45) | FilteredRE2& FilteredRE2::operator=(FilteredRE2&& other) { FILE: re2/filtered_re2.h function namespace (line 31) | namespace re2 { FILE: re2/fuzzing/re2_fuzzer.cc class SubexpressionWalker (line 25) | class SubexpressionWalker : public re2::Regexp::Walker { method SubexpressionWalker (line 27) | SubexpressionWalker() = default; method PostVisit (line 30) | int PostVisit(re2::Regexp* re, int parent_arg, int pre_arg, method ShortVisit (line 48) | int ShortVisit(re2::Regexp* re, int parent_arg) override { method SubexpressionWalker (line 53) | SubexpressionWalker(const SubexpressionWalker&) = delete; method SubexpressionWalker (line 54) | SubexpressionWalker& operator=(const SubexpressionWalker&) = delete; class SubstringWalker (line 60) | class SubstringWalker : public re2::Regexp::Walker { method SubstringWalker (line 62) | SubstringWalker() = default; method PostVisit (line 65) | int PostVisit(re2::Regexp* re, int parent_arg, int pre_arg, method ShortVisit (line 91) | int ShortVisit(re2::Regexp* re, int parent_arg) override { method SubstringWalker (line 96) | SubstringWalker(const SubstringWalker&) = delete; method SubstringWalker (line 97) | SubstringWalker& operator=(const SubstringWalker&) = delete; function TestOneInput (line 100) | void TestOneInput(absl::string_view pattern, const RE2::Options& options, function LLVMFuzzerTestOneInput (line 241) | int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) { FILE: re2/make_unicode_casefold.py function _Delta (line 35) | def _Delta(a, b): function _AddDelta (line 50) | def _AddDelta(a, delta): function _MakeRanges (line 67) | def _MakeRanges(pairs): function main (line 115) | def main(): FILE: re2/make_unicode_groups.py function MakeRanges (line 34) | def MakeRanges(codes): function PrintRanges (line 46) | def PrintRanges(type, name, ranges): function PrintGroup (line 60) | def PrintGroup(name, codes): function main (line 98) | def main(): FILE: re2/mimics_pcre.cc type re2 (line 29) | namespace re2 { class PCREWalker (line 37) | class PCREWalker : public Regexp::Walker { method PCREWalker (line 39) | PCREWalker() {} method ShortVisit (line 44) | virtual bool ShortVisit(Regexp* re, bool a) { method PCREWalker (line 53) | PCREWalker(const PCREWalker&) = delete; method PCREWalker (line 54) | PCREWalker& operator=(const PCREWalker&) = delete; class EmptyStringWalker (line 121) | class EmptyStringWalker : public Regexp::Walker { method EmptyStringWalker (line 123) | EmptyStringWalker() {} method ShortVisit (line 128) | virtual bool ShortVisit(Regexp* re, bool a) { method EmptyStringWalker (line 137) | EmptyStringWalker(const EmptyStringWalker&) = delete; method EmptyStringWalker (line 138) | EmptyStringWalker& operator=(const EmptyStringWalker&) = delete; function CanBeEmptyString (line 191) | static bool CanBeEmptyString(Regexp* re) { FILE: re2/nfa.cc type re2 (line 45) | namespace re2 { class NFA (line 49) | class NFA { type Thread (line 69) | struct Thread { type AddState (line 78) | struct AddState { method CopyCapture (line 112) | void CopyCapture(const char** dst, const char** src) { method NFA (line 130) | NFA(const NFA&) = delete; method NFA (line 131) | NFA& operator=(const NFA&) = delete; FILE: re2/onepass.cc type re2 (line 76) | namespace re2 { type OneState (line 148) | struct OneState { function OnePass_Checks (line 186) | void OnePass_Checks() { function Satisfy (line 194) | static bool Satisfy(uint32_t cond, absl::string_view context, const ch... function ApplyCaptures (line 203) | static void ApplyCaptures(uint32_t cond, const char* p, function OneState (line 211) | static inline OneState* IndexToNode(uint8_t* nodes, int statesize, function AddQ (line 354) | static bool AddQ(Instq *q, int id) { type InstCond (line 363) | struct InstCond { FILE: re2/parse.cc type re2 (line 44) | namespace re2 { class Regexp::ParseState (line 70) | class Regexp::ParseState { method ParseFlags (line 76) | ParseFlags flags() { return flags_; } method rune_max (line 77) | int rune_max() { return rune_max_; } method ParseState (line 184) | ParseState(const ParseState&) = delete; method ParseState (line 185) | ParseState& operator=(const ParseState&) = delete; function Regexp (line 218) | Regexp* Regexp::ParseState::FinishRegexp(Regexp* re) { function CaseFold (line 270) | const CaseFold* LookupCaseFold(const CaseFold* f, int n, Rune r) { function Rune (line 298) | Rune ApplyFold(const CaseFold* f, Rune r) { function Rune (line 333) | Rune CycleFoldRune(Rune r) { function AddFoldedRangeLatin1 (line 341) | static void AddFoldedRangeLatin1(CharClassBuilder* cc, Rune lo, Rune h... function AddFoldedRange (line 357) | static void AddFoldedRange(CharClassBuilder* cc, Rune lo, Rune hi, int... class RepetitionWalker (line 541) | class RepetitionWalker : public Regexp::Walker { method RepetitionWalker (line 543) | RepetitionWalker() {} method RepetitionWalker (line 550) | RepetitionWalker(const RepetitionWalker&) = delete; method RepetitionWalker (line 551) | RepetitionWalker& operator=(const RepetitionWalker&) = delete; function Regexp (line 737) | Regexp* Regexp::ParseState::DoFinish() { function Regexp (line 752) | Regexp* Regexp::LeadingRegexp(Regexp* re) { function Regexp (line 768) | Regexp* Regexp::RemoveLeadingRegexp(Regexp* re) { function Rune (line 797) | Rune* Regexp::LeadingString(Regexp* re, int* nrune, type Splice (line 900) | struct Splice { method Splice (line 901) | Splice(Regexp* prefix, Regexp** sub, int nsub) type Frame (line 917) | struct Frame { method Frame (line 918) | Frame(Regexp** sub, int nsub) class FactorAlternationImpl (line 932) | class FactorAlternationImpl { function ParseInteger (line 1359) | static bool ParseInteger(absl::string_view* s, int* np) { function MaybeParseRepetition (line 1387) | static bool MaybeParseRepetition(absl::string_view* sp, int* lo, int* ... function StringViewToRune (line 1424) | static int StringViewToRune(Rune* r, absl::string_view* sp, function IsValidUTF8 (line 1453) | static bool IsValidUTF8(absl::string_view s, RegexpStatus* status) { function IsHex (line 1464) | static int IsHex(int c) { function UnHex (line 1471) | static int UnHex(int c) { function ParseEscape (line 1485) | static bool ParseEscape(absl::string_view* s, Rune* rp, function UGroup (line 1661) | static const UGroup* LookupGroup(absl::string_view name, function UGroup (line 1671) | static const UGroup* LookupPosixGroup(absl::string_view name) { function UGroup (line 1675) | static const UGroup* LookupPerlGroup(absl::string_view name) { function UGroup (line 1686) | static const UGroup* LookupUnicodeGroup(absl::string_view name) { function AddUGroup (line 1695) | static void AddUGroup(CharClassBuilder* cc, const UGroup* g, int sign, function UGroup (line 1746) | const UGroup* MaybeParsePerlCCEscape(absl::string_view* s, type ParseStatus (line 1762) | enum ParseStatus { function ParseStatus (line 1770) | ParseStatus ParseUnicodeGroup(absl::string_view* s, function ParseStatus (line 1860) | static ParseStatus ParseCCName(absl::string_view* s, function IsValidCaptureName (line 2054) | static bool IsValidCaptureName(absl::string_view name) { function ConvertLatin1ToUTF8 (line 2250) | void ConvertLatin1ToUTF8(absl::string_view latin1, std::string* utf) { function Regexp (line 2265) | Regexp* Regexp::Parse(absl::string_view s, ParseFlags global_flags, FILE: re2/perl_groups.cc type re2 (line 6) | namespace re2 { FILE: re2/pod_array.h function namespace (line 11) | namespace re2 { FILE: re2/prefilter.cc type re2 (line 22) | namespace re2 { function Prefilter (line 45) | Prefilter* Prefilter::Simplify() { function Prefilter (line 74) | Prefilter* Prefilter::AndOr(Op op, Prefilter* a, Prefilter* b) { function Prefilter (line 134) | Prefilter* Prefilter::And(Prefilter* a, Prefilter* b) { function Prefilter (line 138) | Prefilter* Prefilter::Or(Prefilter* a, Prefilter* b) { function Prefilter (line 172) | Prefilter* Prefilter::OrStrings(SSet* ss) { function Rune (line 180) | static Rune ToLowerRune(Rune r) { function Rune (line 193) | static Rune ToLowerRuneLatin1(Rune r) { function Prefilter (line 199) | Prefilter* Prefilter::FromString(const std::string& str) { class Prefilter::Info (line 208) | class Prefilter::Info { method SSet (line 234) | SSet& exact() { return exact_; } method is_exact (line 236) | bool is_exact() const { return is_exact_; } class Walker (line 238) | class Walker function Prefilter (line 265) | Prefilter* Prefilter::Info::TakeMatch() { function RuneToString (line 391) | static std::string RuneToString(Rune r) { function RuneToStringLatin1 (line 397) | static std::string RuneToStringLatin1(Rune r) { class Prefilter::Info::Walker (line 483) | class Prefilter::Info::Walker : public Regexp::Walker { method Walker (line 485) | Walker(bool latin1) : latin1_(latin1) {} method latin1 (line 496) | bool latin1() { return latin1_; } method Walker (line 500) | Walker(const Walker&) = delete; method Walker (line 501) | Walker& operator=(const Walker&) = delete; function Prefilter (line 646) | Prefilter* Prefilter::FromRegexp(Regexp* re) { function Prefilter (line 699) | Prefilter* Prefilter::FromRE2(const RE2* re2) { FILE: re2/prefilter.h function namespace (line 19) | namespace re2 { FILE: re2/prefilter_tree.cc type re2 (line 20) | namespace re2 { function Prefilter (line 72) | Prefilter* PrefilterTree::CanonicalNode(NodeSet* nodes, Prefilter* nod... FILE: re2/prefilter_tree.h function namespace (line 28) | namespace re2 { FILE: re2/prog.cc type re2 (line 34) | namespace re2 { function AddToQueue (line 142) | static inline void AddToQueue(Workq* q, int id) { function ProgToString (line 147) | static std::string ProgToString(Prog* prog, Workq* q) { function FlattenedProgToString (line 160) | static std::string FlattenedProgToString(Prog* prog, int start) { function IsMatch (line 204) | static bool IsMatch(Prog* prog, Prog::Inst* ip) { class ByteMapBuilder (line 343) | class ByteMapBuilder { method ByteMapBuilder (line 345) | ByteMapBuilder() { method ByteMapBuilder (line 367) | ByteMapBuilder(const ByteMapBuilder&) = delete; method ByteMapBuilder (line 368) | ByteMapBuilder& operator=(const ByteMapBuilder&) = delete; function FindLSBSet (line 1114) | static int FindLSBSet(uint32_t n) { FILE: re2/prog.h function namespace (line 29) | namespace re2 { FILE: re2/re2.cc type re2 (line 43) | namespace re2 { type EmptyStorage (line 80) | struct EmptyStorage { function RegexpErrorToRE2 (line 102) | static RE2::ErrorCode RegexpErrorToRE2(re2::RegexpStatusCode code) { function trunc (line 138) | static std::string trunc(absl::string_view pattern) { function FindMSBSet (line 339) | static int FindMSBSet(uint32_t n) { function Fanout (line 360) | static int Fanout(Prog* prog, std::vector* histogram) { function ascii_strcasecmp (line 641) | static int ascii_strcasecmp(const char* a, const char* b, size_t len) { type re2_internal (line 1067) | namespace re2_internal { function Parse (line 1070) | bool Parse(const char* str, size_t n, void* dest) { function Parse (line 1076) | bool Parse(const char* str, size_t n, std::string* dest) { function Parse (line 1083) | bool Parse(const char* str, size_t n, absl::string_view* dest) { function Parse (line 1090) | bool Parse(const char* str, size_t n, char* dest) { function Parse (line 1098) | bool Parse(const char* str, size_t n, signed char* dest) { function Parse (line 1106) | bool Parse(const char* str, size_t n, unsigned char* dest) { function Parse (line 1174) | bool Parse(const char* str, size_t n, float* dest) { function Parse (line 1190) | bool Parse(const char* str, size_t n, double* dest) { function Parse (line 1206) | bool Parse(const char* str, size_t n, long* dest, int radix) { function Parse (line 1221) | bool Parse(const char* str, size_t n, unsigned long* dest, int radix) { function Parse (line 1242) | bool Parse(const char* str, size_t n, short* dest, int radix) { function Parse (line 1252) | bool Parse(const char* str, size_t n, unsigned short* dest, int radi... function Parse (line 1262) | bool Parse(const char* str, size_t n, int* dest, int radix) { function Parse (line 1272) | bool Parse(const char* str, size_t n, unsigned int* dest, int radix) { function Parse (line 1282) | bool Parse(const char* str, size_t n, long long* dest, int radix) { function Parse (line 1297) | bool Parse(const char* str, size_t n, unsigned long long* dest, int ... type hooks (line 1318) | namespace hooks { function Store (line 1326) | void Store(T* cb) { cb_.store(cb, std::memory_order_release); } function T (line 1327) | T* Load() const { return cb_.load(std::memory_order_acquire); } function DoNothing (line 1341) | static void DoNothing(const T&) {} FILE: re2/re2.h function namespace (line 229) | namespace re2 { function namespace (line 234) | namespace re2 { function ProgramSize (line 328) | int ProgramSize() const; function FullMatch (line 411) | bool FullMatch(absl::string_view text, const RE2& re, A&&... a) { function PartialMatch (line 427) | bool PartialMatch(absl::string_view text, const RE2& re, A&&... a) { function Consume (line 445) | bool Consume(absl::string_view* input, const RE2& re, A&&... a) { function FindAndConsume (line 463) | bool FindAndConsume(absl::string_view* input, const RE2& re, A&&... a) { type Anchor (line 542) | enum Anchor { function class (line 618) | class Options { function namespace (line 815) | namespace re2_internal { FILE: re2/regexp.cc type re2 (line 29) | namespace re2 { type RefStorage (line 80) | struct RefStorage { function Regexp (line 103) | Regexp* Regexp::Incref() { function Regexp (line 200) | Regexp* Regexp::HaveMatch(int match_id, ParseFlags flags) { function Regexp (line 206) | Regexp* Regexp::StarPlusOrQuest(RegexpOp op, Regexp* sub, ParseFlags f... function Regexp (line 235) | Regexp* Regexp::Plus(Regexp* sub, ParseFlags flags) { function Regexp (line 239) | Regexp* Regexp::Star(Regexp* sub, ParseFlags flags) { function Regexp (line 243) | Regexp* Regexp::Quest(Regexp* sub, ParseFlags flags) { function Regexp (line 247) | Regexp* Regexp::ConcatOrAlternate(RegexpOp op, Regexp** sub, int nsub, function Regexp (line 295) | Regexp* Regexp::Concat(Regexp** sub, int nsub, ParseFlags flags) { function Regexp (line 299) | Regexp* Regexp::Alternate(Regexp** sub, int nsub, ParseFlags flags) { function Regexp (line 303) | Regexp* Regexp::AlternateNoFactor(Regexp** sub, int nsub, ParseFlags f... function Regexp (line 307) | Regexp* Regexp::Capture(Regexp* sub, ParseFlags flags, int cap) { function Regexp (line 315) | Regexp* Regexp::Repeat(Regexp* sub, ParseFlags flags, int min, int max) { function Regexp (line 324) | Regexp* Regexp::NewLiteral(Rune rune, ParseFlags flags) { function Regexp (line 330) | Regexp* Regexp::LiteralString(Rune* runes, int nrunes, ParseFlags flag... function Regexp (line 341) | Regexp* Regexp::NewCharClass(CharClass* cc, ParseFlags flags) { function TopEqual (line 359) | static bool TopEqual(Regexp* a, Regexp* b) { type RegexpStatusCode (line 529) | enum RegexpStatusCode class NumCapturesWalker (line 553) | class NumCapturesWalker : public Regexp::Walker { method NumCapturesWalker (line 555) | NumCapturesWalker() : ncapture_(0) {} method ncapture (line 556) | int ncapture() { return ncapture_; } method Ignored (line 558) | virtual Ignored PreVisit(Regexp* re, Ignored ignored, bool* stop) { method Ignored (line 564) | virtual Ignored ShortVisit(Regexp* re, Ignored ignored) { method NumCapturesWalker (line 575) | NumCapturesWalker(const NumCapturesWalker&) = delete; method NumCapturesWalker (line 576) | NumCapturesWalker& operator=(const NumCapturesWalker&) = delete; class NamedCapturesWalker (line 586) | class NamedCapturesWalker : public Regexp::Walker { method NamedCapturesWalker (line 588) | NamedCapturesWalker() : map_(NULL) {} method Ignored (line 597) | virtual Ignored PreVisit(Regexp* re, Ignored ignored, bool* stop) { method Ignored (line 611) | virtual Ignored ShortVisit(Regexp* re, Ignored ignored) { method NamedCapturesWalker (line 622) | NamedCapturesWalker(const NamedCapturesWalker&) = delete; method NamedCapturesWalker (line 623) | NamedCapturesWalker& operator=(const NamedCapturesWalker&) = delete; class CaptureNamesWalker (line 633) | class CaptureNamesWalker : public Regexp::Walker { method CaptureNamesWalker (line 635) | CaptureNamesWalker() : map_(NULL) {} method Ignored (line 644) | virtual Ignored PreVisit(Regexp* re, Ignored ignored, bool* stop) { method Ignored (line 655) | virtual Ignored ShortVisit(Regexp* re, Ignored ignored) { method CaptureNamesWalker (line 666) | CaptureNamesWalker(const CaptureNamesWalker&) = delete; method CaptureNamesWalker (line 667) | CaptureNamesWalker& operator=(const CaptureNamesWalker&) = delete; function ConvertRunesToBytes (line 676) | void ConvertRunesToBytes(bool latin1, Rune* runes, int nrunes, function CharClassBuilder (line 855) | CharClassBuilder* CharClassBuilder::Copy() { function CharClass (line 939) | CharClass* CharClass::New(size_t maxranges) { function CharClass (line 955) | CharClass* CharClass::Negate() { function CharClass (line 992) | CharClass* CharClassBuilder::GetCharClass() { FILE: re2/regexp.h function namespace (line 101) | namespace re2 { function class (line 277) | class Regexp { type std (line 631) | typedef std::set RuneRangeSet; function class (line 633) | class CharClassBuilder { function Regexp (line 685) | inline Regexp::ParseFlags operator~(Regexp::ParseFlags a) { FILE: re2/set.cc type re2 (line 23) | namespace re2 { FILE: re2/set.h function namespace (line 16) | namespace re2 { function namespace (line 21) | namespace re2 { FILE: re2/simplify.cc type re2 (line 21) | namespace re2 { class CoalesceWalker (line 109) | class CoalesceWalker : public Regexp::Walker { method CoalesceWalker (line 111) | CoalesceWalker() {} method CoalesceWalker (line 131) | CoalesceWalker(const CoalesceWalker&) = delete; method CoalesceWalker (line 132) | CoalesceWalker& operator=(const CoalesceWalker&) = delete; class SimplifyWalker (line 139) | class SimplifyWalker : public Regexp::Walker { method SimplifyWalker (line 141) | SimplifyWalker() {} method SimplifyWalker (line 167) | SimplifyWalker(const SimplifyWalker&) = delete; method SimplifyWalker (line 168) | SimplifyWalker& operator=(const SimplifyWalker&) = delete; function Regexp (line 180) | Regexp* Regexp::Simplify() { function ChildArgsChanged (line 207) | static bool ChildArgsChanged(Regexp* re, Regexp** child_args) { function Regexp (line 221) | Regexp* CoalesceWalker::Copy(Regexp* re) { function Regexp (line 225) | Regexp* CoalesceWalker::ShortVisit(Regexp* re, Regexp* parent_arg) { function Regexp (line 233) | Regexp* CoalesceWalker::PostVisit(Regexp* re, function Regexp (line 447) | Regexp* SimplifyWalker::Copy(Regexp* re) { function Regexp (line 451) | Regexp* SimplifyWalker::ShortVisit(Regexp* re, Regexp* parent_arg) { function Regexp (line 459) | Regexp* SimplifyWalker::PreVisit(Regexp* re, Regexp* parent_arg, bool*... function Regexp (line 467) | Regexp* SimplifyWalker::PostVisit(Regexp* re, function Regexp (line 576) | Regexp* SimplifyWalker::Concat2(Regexp* re1, Regexp* re2, function IsEmptyOp (line 587) | static bool IsEmptyOp(Regexp* re) { function Regexp (line 602) | Regexp* SimplifyWalker::SimplifyRepeat(Regexp* re, int min, int max, function Regexp (line 677) | Regexp* SimplifyWalker::SimplifyCharClass(Regexp* re) { FILE: re2/sparse_array.h function namespace (line 109) | namespace re2 { FILE: re2/sparse_set.h function namespace (line 68) | namespace re2 { type SparseSetT (line 262) | typedef SparseSetT SparseSet; FILE: re2/stringpiece.h function namespace (line 10) | namespace re2 { FILE: re2/testing/backtrack.cc type re2 (line 38) | namespace re2 { class Backtracker (line 56) | class Backtracker { method Backtracker (line 86) | Backtracker(const Backtracker&) = delete; method Backtracker (line 87) | Backtracker& operator=(const Backtracker&) = delete; FILE: re2/testing/charclass_test.cc type re2 (line 15) | namespace re2 { type CCTest (line 17) | struct CCTest { function Broke (line 91) | static void Broke(const char *desc, const CCTest* t, CharClass* cc) { function ShouldContain (line 114) | bool ShouldContain(CCTest *t, int x) { function CharClass (line 123) | CharClass* Negate(CharClass *cc) { function Delete (line 127) | void Delete(CharClass* cc) { function CharClassBuilder (line 131) | CharClassBuilder* Negate(CharClassBuilder* cc) { function Delete (line 137) | void Delete(CharClassBuilder* cc) { function CorrectCC (line 142) | bool CorrectCC(CharClass *cc, CCTest *t, const char *desc) { function TEST (line 200) | TEST(TestCharClassBuilder, Adds) { FILE: re2/testing/compile_test.cc type re2 (line 18) | namespace re2 { type Test (line 26) | struct Test { function TEST (line 132) | TEST(TestRegexpCompileToProg, Simple) { function DumpByteMap (line 163) | static void DumpByteMap(absl::string_view pattern, Regexp::ParseFlags ... function TEST (line 185) | TEST(TestCompile, Latin1Ranges) { function TEST (line 197) | TEST(TestCompile, OtherByteMapTests) { function TEST (line 232) | TEST(TestCompile, UTF8Ranges) { function TEST (line 252) | TEST(TestCompile, InsufficientMemory) { function Dump (line 264) | static void Dump(absl::string_view pattern, Regexp::ParseFlags flags, function TEST (line 286) | TEST(TestCompile, Bug26705922) { function TEST (line 343) | TEST(TestCompile, Bug35237384) { FILE: re2/testing/dfa_test.cc function ABSL_FLAG (line 27) | ABSL_FLAG(int, repeat, 2, "Repetition count."); FILE: re2/testing/dump.cc type re2 (line 29) | namespace re2 { function DumpRegexpAppending (line 58) | static void DumpRegexpAppending(Regexp* re, std::string* s) { FILE: re2/testing/exhaustive1_test.cc type re2 (line 14) | namespace re2 { function TEST (line 17) | TEST(Repetition, Simple) { function TEST (line 29) | TEST(Repetition, Capturing) { FILE: re2/testing/exhaustive2_test.cc type re2 (line 16) | namespace re2 { function TEST (line 19) | TEST(EmptyString, Exhaustive) { function TEST (line 26) | TEST(Punctuation, Literals) { function TEST (line 38) | TEST(LineEnds, Exhaustive) { FILE: re2/testing/exhaustive3_test.cc type re2 (line 17) | namespace re2 { function TEST (line 20) | TEST(CharacterClasses, Exhaustive) { function TEST (line 28) | TEST(CharacterClasses, ExhaustiveAB) { function UTF8 (line 36) | static std::string UTF8(Rune r) { function TEST (line 73) | TEST(InterestingUTF8, SingleOps) { function TEST (line 86) | TEST(InterestingUTF8, AB) { FILE: re2/testing/exhaustive_test.cc type re2 (line 10) | namespace re2 { function TEST (line 13) | TEST(EgrepLiterals, Lowercase) { function TEST (line 18) | TEST(EgrepLiterals, MixedCase) { function TEST (line 23) | TEST(EgrepLiterals, FoldCase) { function TEST (line 31) | TEST(EgrepLiterals, UTF8) { FILE: re2/testing/exhaustive_tester.cc type re2 (line 44) | namespace re2 { function PrintResult (line 68) | static void PrintResult(const RE2& re, absl::string_view input, function ExhaustiveTest (line 160) | void ExhaustiveTest(int maxatoms, int maxops, function EgrepTest (line 188) | void EgrepTest(int maxatoms, int maxops, const std::string& alphabet, FILE: re2/testing/exhaustive_tester.h function namespace (line 16) | namespace re2 { FILE: re2/testing/filtered_re2_test.cc type re2 (line 19) | namespace re2 { type FilterTestVars (line 21) | struct FilterTestVars { method FilterTestVars (line 22) | FilterTestVars() {} method FilterTestVars (line 23) | explicit FilterTestVars(int min_atom_len) : f(min_atom_len) {} function TEST (line 32) | TEST(FilteredRE2Test, EmptyTest) { function TEST (line 46) | TEST(FilteredRE2Test, SmallOrTest) { function TEST (line 59) | TEST(FilteredRE2Test, SmallLatinTest) { type AtomTest (line 75) | struct AtomTest { function AddRegexpsAndCompile (line 150) | void AddRegexpsAndCompile(const char* regexps[], function CheckExpectedAtoms (line 160) | bool CheckExpectedAtoms(const char* atoms[], function TEST (line 188) | TEST(FilteredRE2Test, AtomTests) { function FindAtomIndices (line 207) | void FindAtomIndices(const std::vector& atoms, function TEST (line 221) | TEST(FilteredRE2Test, MatchEmptyPattern) { function TEST (line 239) | TEST(FilteredRE2Test, MatchTests) { function TEST (line 284) | TEST(FilteredRE2Test, EmptyStringInStringSetBug) { function TEST (line 298) | TEST(FilteredRE2Test, MoveSemantics) { FILE: re2/testing/mimics_pcre_test.cc type re2 (line 12) | namespace re2 { type PCRETest (line 14) | struct PCRETest { function TEST (line 62) | TEST(MimicsPCRE, SimpleTests) { FILE: re2/testing/null_walker.cc type re2 (line 9) | namespace re2 { class NullWalker (line 13) | class NullWalker : public Regexp::Walker { method NullWalker (line 15) | NullWalker() {} method ShortVisit (line 20) | virtual bool ShortVisit(Regexp* re, bool a) { method NullWalker (line 29) | NullWalker(const NullWalker&) = delete; method NullWalker (line 30) | NullWalker& operator=(const NullWalker&) = delete; FILE: re2/testing/parse_test.cc type re2 (line 16) | namespace re2 { type Test (line 23) | struct Test { function RegexpEqualTestingOnly (line 255) | bool RegexpEqualTestingOnly(Regexp* a, Regexp* b) { function TestParse (line 259) | void TestParse(const Test* tests, int ntests, Regexp::ParseFlags flags, function TEST (line 292) | TEST(TestParse, SimpleRegexps) { function TEST (line 309) | TEST(TestParse, FoldCase) { function TEST (line 318) | TEST(TestParse, Literal) { function TEST (line 331) | TEST(TestParse, MatchNL) { function TEST (line 343) | TEST(TestParse, NoMatchNL) { function TEST (line 394) | TEST(TestParse, Prefix) { function TEST (line 410) | TEST(TestParse, Nested) { function TEST (line 471) | TEST(TestParse, InvalidRegexps) { function TEST (line 495) | TEST(TestToString, EquivalentParse) { function TEST (line 535) | TEST(NamedCaptures, ErrorArgs) { function TEST (line 561) | TEST(LookAround, ErrorArgs) { FILE: re2/testing/possible_match_test.cc type re2 (line 22) | namespace re2 { function TEST (line 26) | TEST(CplusplusStrings, EightBit) { type PrefixTest (line 32) | struct PrefixTest { function TEST (line 112) | TEST(PossibleMatchRange, HandWritten) { function TEST (line 137) | TEST(PossibleMatchRange, Failures) { class PossibleMatchTester (line 174) | class PossibleMatchTester : public RegexpGenerator { method PossibleMatchTester (line 176) | PossibleMatchTester(int maxatoms, method regexps (line 186) | int regexps() { return regexps_; } method tests (line 187) | int tests() { return tests_; } method PossibleMatchTester (line 198) | PossibleMatchTester(const PossibleMatchTester&) = delete; method PossibleMatchTester (line 199) | PossibleMatchTester& operator=(const PossibleMatchTester&) = delete; function TEST (line 234) | TEST(PossibleMatchRange, Exhaustive) { FILE: re2/testing/random_test.cc type re2 (line 21) | namespace re2 { function RandomTest (line 26) | static void RandomTest(int maxatoms, int maxops, function TEST (line 52) | TEST(Random, SmallEgrepLiterals) { function TEST (line 59) | TEST(Random, BigEgrepLiterals) { function TEST (line 67) | TEST(Random, SmallEgrepCaptures) { function TEST (line 75) | TEST(Random, BigEgrepCaptures) { function TEST (line 85) | TEST(Random, Complicated) { FILE: re2/testing/re2_arg_test.cc type SuccessTable (line 21) | struct SuccessTable { function ParseFrom (line 140) | bool ParseFrom(const char* str, size_t n) { function ParseFrom (line 149) | bool ParseFrom(const char* str, size_t n) { function ParseFrom (line 154) | void ParseFrom(const char* str) {} FILE: re2/testing/re2_test.cc type re2 (line 32) | namespace re2 { function TEST (line 34) | TEST(RE2, HexTests) { function TEST (line 58) | TEST(RE2, OctalTests) { FILE: re2/testing/regexp_benchmark.cc type re2 (line 28) | namespace re2 { function Test (line 37) | void Test() { function MemoryUsage (line 57) | void MemoryUsage() { function NumCPUs (line 126) | int NumCPUs() { function RandomText (line 161) | std::string RandomText(int64_t nbytes) { function Search (line 182) | void Search(benchmark::State& state, const char* regexp, SearchImpl* s... function Search_Easy0_CachedDFA (line 212) | void Search_Easy0_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy0_CachedNFA (line 213) | void Search_Easy0_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy0_CachedPCRE (line 214) | void Search_Easy0_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy0_CachedRE2 (line 215) | void Search_Easy0_CachedRE2(benchmark::State& state) { Search(stat... function Search_Easy1_CachedDFA (line 224) | void Search_Easy1_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy1_CachedNFA (line 225) | void Search_Easy1_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy1_CachedPCRE (line 226) | void Search_Easy1_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy1_CachedRE2 (line 227) | void Search_Easy1_CachedRE2(benchmark::State& state) { Search(stat... function Search_Easy2_CachedDFA (line 236) | void Search_Easy2_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy2_CachedNFA (line 237) | void Search_Easy2_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy2_CachedPCRE (line 238) | void Search_Easy2_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy2_CachedRE2 (line 239) | void Search_Easy2_CachedRE2(benchmark::State& state) { Search(stat... function Search_Medium_CachedDFA (line 248) | void Search_Medium_CachedDFA(benchmark::State& state) { Search(sta... function Search_Medium_CachedNFA (line 249) | void Search_Medium_CachedNFA(benchmark::State& state) { Search(sta... function Search_Medium_CachedPCRE (line 250) | void Search_Medium_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Medium_CachedRE2 (line 251) | void Search_Medium_CachedRE2(benchmark::State& state) { Search(sta... function Search_Hard_CachedDFA (line 260) | void Search_Hard_CachedDFA(benchmark::State& state) { Search(state... function Search_Hard_CachedNFA (line 261) | void Search_Hard_CachedNFA(benchmark::State& state) { Search(state... function Search_Hard_CachedPCRE (line 262) | void Search_Hard_CachedPCRE(benchmark::State& state) { Search(state... function Search_Hard_CachedRE2 (line 263) | void Search_Hard_CachedRE2(benchmark::State& state) { Search(state... function Search_Fanout_CachedDFA (line 272) | void Search_Fanout_CachedDFA(benchmark::State& state) { Search(sta... function Search_Fanout_CachedNFA (line 273) | void Search_Fanout_CachedNFA(benchmark::State& state) { Search(sta... function Search_Fanout_CachedPCRE (line 274) | void Search_Fanout_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Fanout_CachedRE2 (line 275) | void Search_Fanout_CachedRE2(benchmark::State& state) { Search(sta... function Search_Parens_CachedDFA (line 284) | void Search_Parens_CachedDFA(benchmark::State& state) { Search(sta... function Search_Parens_CachedNFA (line 285) | void Search_Parens_CachedNFA(benchmark::State& state) { Search(sta... function Search_Parens_CachedPCRE (line 286) | void Search_Parens_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Parens_CachedRE2 (line 287) | void Search_Parens_CachedRE2(benchmark::State& state) { Search(sta... function SearchBigFixed (line 296) | void SearchBigFixed(benchmark::State& state, SearchImpl* search) { function Search_BigFixed_CachedDFA (line 306) | void Search_BigFixed_CachedDFA(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedNFA (line 307) | void Search_BigFixed_CachedNFA(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedPCRE (line 308) | void Search_BigFixed_CachedPCRE(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedRE2 (line 309) | void Search_BigFixed_CachedRE2(benchmark::State& state) { SearchBi... function FindAndConsume (line 320) | void FindAndConsume(benchmark::State& state) { function SearchSuccess (line 337) | void SearchSuccess(benchmark::State& state, const char* regexp, function Search_Success_DFA (line 346) | void Search_Success_DFA(benchmark::State& state) { SearchSuccess(s... function Search_Success_NFA (line 347) | void Search_Success_NFA(benchmark::State& state) { SearchSuccess(s... function Search_Success_PCRE (line 348) | void Search_Success_PCRE(benchmark::State& state) { SearchSuccess(s... function Search_Success_RE2 (line 349) | void Search_Success_RE2(benchmark::State& state) { SearchSuccess(s... function Search_Success_OnePass (line 350) | void Search_Success_OnePass(benchmark::State& state) { SearchSuccess(s... function Search_Success_CachedDFA (line 360) | void Search_Success_CachedDFA(benchmark::State& state) { SearchSuc... function Search_Success_CachedNFA (line 361) | void Search_Success_CachedNFA(benchmark::State& state) { SearchSuc... function Search_Success_CachedPCRE (line 362) | void Search_Success_CachedPCRE(benchmark::State& state) { SearchSuc... function Search_Success_CachedRE2 (line 363) | void Search_Success_CachedRE2(benchmark::State& state) { SearchSuc... function Search_Success_CachedOnePass (line 364) | void Search_Success_CachedOnePass(benchmark::State& state) { SearchSuc... function Search_Success1_DFA (line 377) | void Search_Success1_DFA(benchmark::State& state) { SearchSuccess... function Search_Success1_NFA (line 378) | void Search_Success1_NFA(benchmark::State& state) { SearchSuccess... function Search_Success1_PCRE (line 379) | void Search_Success1_PCRE(benchmark::State& state) { SearchSuccess... function Search_Success1_RE2 (line 380) | void Search_Success1_RE2(benchmark::State& state) { SearchSuccess... function Search_Success1_BitState (line 381) | void Search_Success1_BitState(benchmark::State& state) { SearchSuccess... function Search_Success1_CachedDFA (line 391) | void Search_Success1_CachedDFA(benchmark::State& state) { SearchS... function Search_Success1_CachedNFA (line 392) | void Search_Success1_CachedNFA(benchmark::State& state) { SearchS... function Search_Success1_CachedPCRE (line 393) | void Search_Success1_CachedPCRE(benchmark::State& state) { SearchS... function Search_Success1_CachedRE2 (line 394) | void Search_Success1_CachedRE2(benchmark::State& state) { SearchS... function Search_Success1_CachedBitState (line 395) | void Search_Success1_CachedBitState(benchmark::State& state) { SearchS... function SearchAltMatch (line 408) | void SearchAltMatch(benchmark::State& state, SearchImpl* search) { function Search_AltMatch_DFA (line 414) | void Search_AltMatch_DFA(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_NFA (line 415) | void Search_AltMatch_NFA(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_OnePass (line 416) | void Search_AltMatch_OnePass(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_BitState (line 417) | void Search_AltMatch_BitState(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_PCRE (line 418) | void Search_AltMatch_PCRE(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_RE2 (line 419) | void Search_AltMatch_RE2(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_CachedDFA (line 430) | void Search_AltMatch_CachedDFA(benchmark::State& state) { SearchA... function Search_AltMatch_CachedNFA (line 431) | void Search_AltMatch_CachedNFA(benchmark::State& state) { SearchA... function Search_AltMatch_CachedOnePass (line 432) | void Search_AltMatch_CachedOnePass(benchmark::State& state) { SearchA... function Search_AltMatch_CachedBitState (line 433) | void Search_AltMatch_CachedBitState(benchmark::State& state) { SearchA... function Search_AltMatch_CachedPCRE (line 434) | void Search_AltMatch_CachedPCRE(benchmark::State& state) { SearchA... function Search_AltMatch_CachedRE2 (line 435) | void Search_AltMatch_CachedRE2(benchmark::State& state) { SearchA... function SearchDigits (line 448) | void SearchDigits(benchmark::State& state, SearchImpl* search) { function Search_Digits_DFA (line 454) | void Search_Digits_DFA(benchmark::State& state) { SearchDigits... function Search_Digits_NFA (line 455) | void Search_Digits_NFA(benchmark::State& state) { SearchDigits... function Search_Digits_OnePass (line 456) | void Search_Digits_OnePass(benchmark::State& state) { SearchDigits... function Search_Digits_PCRE (line 457) | void Search_Digits_PCRE(benchmark::State& state) { SearchDigits... function Search_Digits_RE2 (line 458) | void Search_Digits_RE2(benchmark::State& state) { SearchDigits... function Search_Digits_BitState (line 459) | void Search_Digits_BitState(benchmark::State& state) { SearchDigits... function Parse3Digits (line 472) | void Parse3Digits(benchmark::State& state, function Parse_Digits_NFA (line 479) | void Parse_Digits_NFA(benchmark::State& state) { Parse3Digits(... function Parse_Digits_OnePass (line 480) | void Parse_Digits_OnePass(benchmark::State& state) { Parse3Digits(... function Parse_Digits_PCRE (line 481) | void Parse_Digits_PCRE(benchmark::State& state) { Parse3Digits(... function Parse_Digits_RE2 (line 482) | void Parse_Digits_RE2(benchmark::State& state) { Parse3Digits(... function Parse_Digits_Backtrack (line 483) | void Parse_Digits_Backtrack(benchmark::State& state) { Parse3Digits(... function Parse_Digits_BitState (line 484) | void Parse_Digits_BitState(benchmark::State& state) { Parse3Digits(... function Parse_CachedDigits_NFA (line 495) | void Parse_CachedDigits_NFA(benchmark::State& state) { Parse3D... function Parse_CachedDigits_OnePass (line 496) | void Parse_CachedDigits_OnePass(benchmark::State& state) { Parse3D... function Parse_CachedDigits_PCRE (line 497) | void Parse_CachedDigits_PCRE(benchmark::State& state) { Parse3D... function Parse_CachedDigits_RE2 (line 498) | void Parse_CachedDigits_RE2(benchmark::State& state) { Parse3D... function Parse_CachedDigits_Backtrack (line 499) | void Parse_CachedDigits_Backtrack(benchmark::State& state) { Parse3D... function Parse_CachedDigits_BitState (line 500) | void Parse_CachedDigits_BitState(benchmark::State& state) { Parse3D... function Parse3DigitDs (line 511) | void Parse3DigitDs(benchmark::State& state, function Parse_DigitDs_NFA (line 518) | void Parse_DigitDs_NFA(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_OnePass (line 519) | void Parse_DigitDs_OnePass(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_PCRE (line 520) | void Parse_DigitDs_PCRE(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_RE2 (line 521) | void Parse_DigitDs_RE2(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_Backtrack (line 522) | void Parse_DigitDs_Backtrack(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_BitState (line 523) | void Parse_DigitDs_BitState(benchmark::State& state) { Parse3DigitD... function Parse_CachedDigitDs_NFA (line 534) | void Parse_CachedDigitDs_NFA(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_OnePass (line 535) | void Parse_CachedDigitDs_OnePass(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_PCRE (line 536) | void Parse_CachedDigitDs_PCRE(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_RE2 (line 537) | void Parse_CachedDigitDs_RE2(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_Backtrack (line 538) | void Parse_CachedDigitDs_Backtrack(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_BitState (line 539) | void Parse_CachedDigitDs_BitState(benchmark::State& state) { Parse3... function Parse1Split (line 552) | void Parse1Split(benchmark::State& state, function Parse_Split_NFA (line 559) | void Parse_Split_NFA(benchmark::State& state) { Parse1Split(st... function Parse_Split_OnePass (line 560) | void Parse_Split_OnePass(benchmark::State& state) { Parse1Split(st... function Parse_Split_PCRE (line 561) | void Parse_Split_PCRE(benchmark::State& state) { Parse1Split(st... function Parse_Split_RE2 (line 562) | void Parse_Split_RE2(benchmark::State& state) { Parse1Split(st... function Parse_Split_BitState (line 563) | void Parse_Split_BitState(benchmark::State& state) { Parse1Split(st... function Parse_CachedSplit_NFA (line 573) | void Parse_CachedSplit_NFA(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_OnePass (line 574) | void Parse_CachedSplit_OnePass(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_PCRE (line 575) | void Parse_CachedSplit_PCRE(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_RE2 (line 576) | void Parse_CachedSplit_RE2(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_BitState (line 577) | void Parse_CachedSplit_BitState(benchmark::State& state) { Parse1Sp... function Parse1SplitHard (line 589) | void Parse1SplitHard(benchmark::State& state, function Parse_SplitHard_NFA (line 596) | void Parse_SplitHard_NFA(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_PCRE (line 597) | void Parse_SplitHard_PCRE(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_RE2 (line 598) | void Parse_SplitHard_RE2(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_BitState (line 599) | void Parse_SplitHard_BitState(benchmark::State& state) { Parse1Spli... function Parse_CachedSplitHard_NFA (line 608) | void Parse_CachedSplitHard_NFA(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_PCRE (line 609) | void Parse_CachedSplitHard_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_RE2 (line 610) | void Parse_CachedSplitHard_RE2(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_BitState (line 611) | void Parse_CachedSplitHard_BitState(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_Backtrack (line 612) | void Parse_CachedSplitHard_Backtrack(benchmark::State& state) { Parse1... function Parse1SplitBig1 (line 624) | void Parse1SplitBig1(benchmark::State& state, function Parse_CachedSplitBig1_PCRE (line 634) | void Parse_CachedSplitBig1_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitBig1_RE2 (line 635) | void Parse_CachedSplitBig1_RE2(benchmark::State& state) { Parse1... function Parse1SplitBig2 (line 644) | void Parse1SplitBig2(benchmark::State& state, function Parse_CachedSplitBig2_PCRE (line 654) | void Parse_CachedSplitBig2_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitBig2_RE2 (line 655) | void Parse_CachedSplitBig2_RE2(benchmark::State& state) { Parse1... function ParseRegexp (line 665) | void ParseRegexp(benchmark::State& state, const std::string& regexp) { function SimplifyRegexp (line 673) | void SimplifyRegexp(benchmark::State& state, const std::string& regexp) { function NullWalkRegexp (line 684) | void NullWalkRegexp(benchmark::State& state, const std::string& regexp) { function SimplifyCompileRegexp (line 693) | void SimplifyCompileRegexp(benchmark::State& state, const std::string&... function CompileRegexp (line 707) | void CompileRegexp(benchmark::State& state, const std::string& regexp) { function CompileToProg (line 718) | void CompileToProg(benchmark::State& state, const std::string& regexp) { function CompileByteMap (line 729) | void CompileByteMap(benchmark::State& state, const std::string& regexp) { function CompilePCRE (line 741) | void CompilePCRE(benchmark::State& state, const std::string& regexp) { function CompileRE2 (line 748) | void CompileRE2(benchmark::State& state, const std::string& regexp) { function RunBuild (line 755) | void RunBuild(benchmark::State& state, const std::string& regexp, function BM_PCRE_Compile (line 768) | void BM_PCRE_Compile(benchmark::State& state) { RunBuild(s... function BM_Regexp_Parse (line 769) | void BM_Regexp_Parse(benchmark::State& state) { RunBuild(s... function BM_Regexp_Simplify (line 770) | void BM_Regexp_Simplify(benchmark::State& state) { RunBuild(s... function BM_CompileToProg (line 771) | void BM_CompileToProg(benchmark::State& state) { RunBuild(s... function BM_CompileByteMap (line 772) | void BM_CompileByteMap(benchmark::State& state) { RunBuild(s... function BM_Regexp_Compile (line 773) | void BM_Regexp_Compile(benchmark::State& state) { RunBuild(s... function BM_Regexp_SimplifyCompile (line 774) | void BM_Regexp_SimplifyCompile(benchmark::State& state) { RunBuild(s... function BM_Regexp_NullWalk (line 775) | void BM_Regexp_NullWalk(benchmark::State& state) { RunBuild(s... function BM_RE2_Compile (line 776) | void BM_RE2_Compile(benchmark::State& state) { RunBuild(s... function SearchPhone (line 792) | void SearchPhone(benchmark::State& state, ParseImpl* search) { function SearchPhone_CachedPCRE (line 799) | void SearchPhone_CachedPCRE(benchmark::State& state) { function SearchPhone_CachedRE2 (line 803) | void SearchPhone_CachedRE2(benchmark::State& state) { function SearchDFA (line 865) | void SearchDFA(benchmark::State& state, const char* regexp, function SearchNFA (line 883) | void SearchNFA(benchmark::State& state, const char* regexp, function SearchOnePass (line 899) | void SearchOnePass(benchmark::State& state, const char* regexp, function SearchBitState (line 916) | void SearchBitState(benchmark::State& state, const char* regexp, function SearchPCRE (line 933) | void SearchPCRE(benchmark::State& state, const char* regexp, function SearchRE2 (line 947) | void SearchRE2(benchmark::State& state, const char* regexp, function Prog (line 965) | Prog* GetCachedProg(const char* regexp) { function PCRE (line 983) | PCRE* GetCachedPCRE(const char* regexp) { function RE2 (line 996) | RE2* GetCachedRE2(const char* regexp) { function SearchCachedDFA (line 1009) | void SearchCachedDFA(benchmark::State& state, const char* regexp, function SearchCachedNFA (line 1022) | void SearchCachedNFA(benchmark::State& state, const char* regexp, function SearchCachedOnePass (line 1033) | void SearchCachedOnePass(benchmark::State& state, const char* regexp, function SearchCachedBitState (line 1045) | void SearchCachedBitState(benchmark::State& state, const char* regexp, function SearchCachedPCRE (line 1057) | void SearchCachedPCRE(benchmark::State& state, const char* regexp, function SearchCachedRE2 (line 1070) | void SearchCachedRE2(benchmark::State& state, const char* regexp, function Parse3NFA (line 1086) | void Parse3NFA(benchmark::State& state, const char* regexp, function Parse3OnePass (line 1101) | void Parse3OnePass(benchmark::State& state, const char* regexp, function Parse3BitState (line 1117) | void Parse3BitState(benchmark::State& state, const char* regexp, function Parse3Backtrack (line 1133) | void Parse3Backtrack(benchmark::State& state, const char* regexp, function Parse3PCRE (line 1148) | void Parse3PCRE(benchmark::State& state, const char* regexp, function Parse3RE2 (line 1158) | void Parse3RE2(benchmark::State& state, const char* regexp, function Parse3CachedNFA (line 1168) | void Parse3CachedNFA(benchmark::State& state, const char* regexp, function Parse3CachedOnePass (line 1178) | void Parse3CachedOnePass(benchmark::State& state, const char* regexp, function Parse3CachedBitState (line 1189) | void Parse3CachedBitState(benchmark::State& state, const char* regexp, function Parse3CachedBacktrack (line 1200) | void Parse3CachedBacktrack(benchmark::State& state, const char* regexp, function Parse3CachedPCRE (line 1210) | void Parse3CachedPCRE(benchmark::State& state, const char* regexp, function Parse3CachedRE2 (line 1219) | void Parse3CachedRE2(benchmark::State& state, const char* regexp, function Parse1NFA (line 1231) | void Parse1NFA(benchmark::State& state, const char* regexp, function Parse1OnePass (line 1246) | void Parse1OnePass(benchmark::State& state, const char* regexp, function Parse1BitState (line 1262) | void Parse1BitState(benchmark::State& state, const char* regexp, function Parse1PCRE (line 1278) | void Parse1PCRE(benchmark::State& state, const char* regexp, function Parse1RE2 (line 1288) | void Parse1RE2(benchmark::State& state, const char* regexp, function Parse1CachedNFA (line 1298) | void Parse1CachedNFA(benchmark::State& state, const char* regexp, function Parse1CachedOnePass (line 1308) | void Parse1CachedOnePass(benchmark::State& state, const char* regexp, function Parse1CachedBitState (line 1319) | void Parse1CachedBitState(benchmark::State& state, const char* regexp, function Parse1CachedBacktrack (line 1330) | void Parse1CachedBacktrack(benchmark::State& state, const char* regexp, function Parse1CachedPCRE (line 1340) | void Parse1CachedPCRE(benchmark::State& state, const char* regexp, function Parse1CachedRE2 (line 1349) | void Parse1CachedRE2(benchmark::State& state, const char* regexp, function SearchParse2CachedPCRE (line 1358) | void SearchParse2CachedPCRE(benchmark::State& state, const char* regexp, function SearchParse2CachedRE2 (line 1367) | void SearchParse2CachedRE2(benchmark::State& state, const char* regexp, function SearchParse1CachedPCRE (line 1376) | void SearchParse1CachedPCRE(benchmark::State& state, const char* regexp, function SearchParse1CachedRE2 (line 1385) | void SearchParse1CachedRE2(benchmark::State& state, const char* regexp, function EmptyPartialMatchPCRE (line 1394) | void EmptyPartialMatchPCRE(benchmark::State& state) { function EmptyPartialMatchRE2 (line 1401) | void EmptyPartialMatchRE2(benchmark::State& state) { function SimplePartialMatchPCRE (line 1412) | void SimplePartialMatchPCRE(benchmark::State& state) { function SimplePartialMatchRE2 (line 1419) | void SimplePartialMatchRE2(benchmark::State& state) { function HTTPPartialMatchPCRE (line 1434) | void HTTPPartialMatchPCRE(benchmark::State& state) { function HTTPPartialMatchRE2 (line 1442) | void HTTPPartialMatchRE2(benchmark::State& state) { function SmallHTTPPartialMatchPCRE (line 1458) | void SmallHTTPPartialMatchPCRE(benchmark::State& state) { function SmallHTTPPartialMatchRE2 (line 1466) | void SmallHTTPPartialMatchRE2(benchmark::State& state) { function DotMatchPCRE (line 1479) | void DotMatchPCRE(benchmark::State& state) { function DotMatchRE2 (line 1487) | void DotMatchRE2(benchmark::State& state) { function ASCIIMatchPCRE (line 1500) | void ASCIIMatchPCRE(benchmark::State& state) { function ASCIIMatchRE2 (line 1508) | void ASCIIMatchRE2(benchmark::State& state) { function FullMatchPCRE (line 1521) | void FullMatchPCRE(benchmark::State& state, const char *regexp) { function FullMatchRE2 (line 1531) | void FullMatchRE2(benchmark::State& state, const char *regexp) { function FullMatch_DotStar_CachedPCRE (line 1541) | void FullMatch_DotStar_CachedPCRE(benchmark::State& state) { function FullMatch_DotStar_CachedRE2 (line 1544) | void FullMatch_DotStar_CachedRE2(benchmark::State& state) { function FullMatch_DotStarDollar_CachedPCRE (line 1548) | void FullMatch_DotStarDollar_CachedPCRE(benchmark::State& state) { function FullMatch_DotStarDollar_CachedRE2 (line 1551) | void FullMatch_DotStarDollar_CachedRE2(benchmark::State& state) { function FullMatch_DotStarCapture_CachedPCRE (line 1555) | void FullMatch_DotStarCapture_CachedPCRE(benchmark::State& state) { function FullMatch_DotStarCapture_CachedRE2 (line 1558) | void FullMatch_DotStarCapture_CachedRE2(benchmark::State& state) { function PossibleMatchRangeCommon (line 1577) | void PossibleMatchRangeCommon(benchmark::State& state, const char* reg... function PossibleMatchRange_Trivial (line 1587) | void PossibleMatchRange_Trivial(benchmark::State& state) { function PossibleMatchRange_Complex (line 1590) | void PossibleMatchRange_Complex(benchmark::State& state) { function PossibleMatchRange_Prefix (line 1593) | void PossibleMatchRange_Prefix(benchmark::State& state) { function PossibleMatchRange_NoProg (line 1596) | void PossibleMatchRange_NoProg(benchmark::State& state) { type re2 (line 35) | namespace re2 { function Test (line 37) | void Test() { function MemoryUsage (line 57) | void MemoryUsage() { function NumCPUs (line 126) | int NumCPUs() { function RandomText (line 161) | std::string RandomText(int64_t nbytes) { function Search (line 182) | void Search(benchmark::State& state, const char* regexp, SearchImpl* s... function Search_Easy0_CachedDFA (line 212) | void Search_Easy0_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy0_CachedNFA (line 213) | void Search_Easy0_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy0_CachedPCRE (line 214) | void Search_Easy0_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy0_CachedRE2 (line 215) | void Search_Easy0_CachedRE2(benchmark::State& state) { Search(stat... function Search_Easy1_CachedDFA (line 224) | void Search_Easy1_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy1_CachedNFA (line 225) | void Search_Easy1_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy1_CachedPCRE (line 226) | void Search_Easy1_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy1_CachedRE2 (line 227) | void Search_Easy1_CachedRE2(benchmark::State& state) { Search(stat... function Search_Easy2_CachedDFA (line 236) | void Search_Easy2_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy2_CachedNFA (line 237) | void Search_Easy2_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy2_CachedPCRE (line 238) | void Search_Easy2_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy2_CachedRE2 (line 239) | void Search_Easy2_CachedRE2(benchmark::State& state) { Search(stat... function Search_Medium_CachedDFA (line 248) | void Search_Medium_CachedDFA(benchmark::State& state) { Search(sta... function Search_Medium_CachedNFA (line 249) | void Search_Medium_CachedNFA(benchmark::State& state) { Search(sta... function Search_Medium_CachedPCRE (line 250) | void Search_Medium_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Medium_CachedRE2 (line 251) | void Search_Medium_CachedRE2(benchmark::State& state) { Search(sta... function Search_Hard_CachedDFA (line 260) | void Search_Hard_CachedDFA(benchmark::State& state) { Search(state... function Search_Hard_CachedNFA (line 261) | void Search_Hard_CachedNFA(benchmark::State& state) { Search(state... function Search_Hard_CachedPCRE (line 262) | void Search_Hard_CachedPCRE(benchmark::State& state) { Search(state... function Search_Hard_CachedRE2 (line 263) | void Search_Hard_CachedRE2(benchmark::State& state) { Search(state... function Search_Fanout_CachedDFA (line 272) | void Search_Fanout_CachedDFA(benchmark::State& state) { Search(sta... function Search_Fanout_CachedNFA (line 273) | void Search_Fanout_CachedNFA(benchmark::State& state) { Search(sta... function Search_Fanout_CachedPCRE (line 274) | void Search_Fanout_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Fanout_CachedRE2 (line 275) | void Search_Fanout_CachedRE2(benchmark::State& state) { Search(sta... function Search_Parens_CachedDFA (line 284) | void Search_Parens_CachedDFA(benchmark::State& state) { Search(sta... function Search_Parens_CachedNFA (line 285) | void Search_Parens_CachedNFA(benchmark::State& state) { Search(sta... function Search_Parens_CachedPCRE (line 286) | void Search_Parens_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Parens_CachedRE2 (line 287) | void Search_Parens_CachedRE2(benchmark::State& state) { Search(sta... function SearchBigFixed (line 296) | void SearchBigFixed(benchmark::State& state, SearchImpl* search) { function Search_BigFixed_CachedDFA (line 306) | void Search_BigFixed_CachedDFA(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedNFA (line 307) | void Search_BigFixed_CachedNFA(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedPCRE (line 308) | void Search_BigFixed_CachedPCRE(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedRE2 (line 309) | void Search_BigFixed_CachedRE2(benchmark::State& state) { SearchBi... function FindAndConsume (line 320) | void FindAndConsume(benchmark::State& state) { function SearchSuccess (line 337) | void SearchSuccess(benchmark::State& state, const char* regexp, function Search_Success_DFA (line 346) | void Search_Success_DFA(benchmark::State& state) { SearchSuccess(s... function Search_Success_NFA (line 347) | void Search_Success_NFA(benchmark::State& state) { SearchSuccess(s... function Search_Success_PCRE (line 348) | void Search_Success_PCRE(benchmark::State& state) { SearchSuccess(s... function Search_Success_RE2 (line 349) | void Search_Success_RE2(benchmark::State& state) { SearchSuccess(s... function Search_Success_OnePass (line 350) | void Search_Success_OnePass(benchmark::State& state) { SearchSuccess(s... function Search_Success_CachedDFA (line 360) | void Search_Success_CachedDFA(benchmark::State& state) { SearchSuc... function Search_Success_CachedNFA (line 361) | void Search_Success_CachedNFA(benchmark::State& state) { SearchSuc... function Search_Success_CachedPCRE (line 362) | void Search_Success_CachedPCRE(benchmark::State& state) { SearchSuc... function Search_Success_CachedRE2 (line 363) | void Search_Success_CachedRE2(benchmark::State& state) { SearchSuc... function Search_Success_CachedOnePass (line 364) | void Search_Success_CachedOnePass(benchmark::State& state) { SearchSuc... function Search_Success1_DFA (line 377) | void Search_Success1_DFA(benchmark::State& state) { SearchSuccess... function Search_Success1_NFA (line 378) | void Search_Success1_NFA(benchmark::State& state) { SearchSuccess... function Search_Success1_PCRE (line 379) | void Search_Success1_PCRE(benchmark::State& state) { SearchSuccess... function Search_Success1_RE2 (line 380) | void Search_Success1_RE2(benchmark::State& state) { SearchSuccess... function Search_Success1_BitState (line 381) | void Search_Success1_BitState(benchmark::State& state) { SearchSuccess... function Search_Success1_CachedDFA (line 391) | void Search_Success1_CachedDFA(benchmark::State& state) { SearchS... function Search_Success1_CachedNFA (line 392) | void Search_Success1_CachedNFA(benchmark::State& state) { SearchS... function Search_Success1_CachedPCRE (line 393) | void Search_Success1_CachedPCRE(benchmark::State& state) { SearchS... function Search_Success1_CachedRE2 (line 394) | void Search_Success1_CachedRE2(benchmark::State& state) { SearchS... function Search_Success1_CachedBitState (line 395) | void Search_Success1_CachedBitState(benchmark::State& state) { SearchS... function SearchAltMatch (line 408) | void SearchAltMatch(benchmark::State& state, SearchImpl* search) { function Search_AltMatch_DFA (line 414) | void Search_AltMatch_DFA(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_NFA (line 415) | void Search_AltMatch_NFA(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_OnePass (line 416) | void Search_AltMatch_OnePass(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_BitState (line 417) | void Search_AltMatch_BitState(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_PCRE (line 418) | void Search_AltMatch_PCRE(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_RE2 (line 419) | void Search_AltMatch_RE2(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_CachedDFA (line 430) | void Search_AltMatch_CachedDFA(benchmark::State& state) { SearchA... function Search_AltMatch_CachedNFA (line 431) | void Search_AltMatch_CachedNFA(benchmark::State& state) { SearchA... function Search_AltMatch_CachedOnePass (line 432) | void Search_AltMatch_CachedOnePass(benchmark::State& state) { SearchA... function Search_AltMatch_CachedBitState (line 433) | void Search_AltMatch_CachedBitState(benchmark::State& state) { SearchA... function Search_AltMatch_CachedPCRE (line 434) | void Search_AltMatch_CachedPCRE(benchmark::State& state) { SearchA... function Search_AltMatch_CachedRE2 (line 435) | void Search_AltMatch_CachedRE2(benchmark::State& state) { SearchA... function SearchDigits (line 448) | void SearchDigits(benchmark::State& state, SearchImpl* search) { function Search_Digits_DFA (line 454) | void Search_Digits_DFA(benchmark::State& state) { SearchDigits... function Search_Digits_NFA (line 455) | void Search_Digits_NFA(benchmark::State& state) { SearchDigits... function Search_Digits_OnePass (line 456) | void Search_Digits_OnePass(benchmark::State& state) { SearchDigits... function Search_Digits_PCRE (line 457) | void Search_Digits_PCRE(benchmark::State& state) { SearchDigits... function Search_Digits_RE2 (line 458) | void Search_Digits_RE2(benchmark::State& state) { SearchDigits... function Search_Digits_BitState (line 459) | void Search_Digits_BitState(benchmark::State& state) { SearchDigits... function Parse3Digits (line 472) | void Parse3Digits(benchmark::State& state, function Parse_Digits_NFA (line 479) | void Parse_Digits_NFA(benchmark::State& state) { Parse3Digits(... function Parse_Digits_OnePass (line 480) | void Parse_Digits_OnePass(benchmark::State& state) { Parse3Digits(... function Parse_Digits_PCRE (line 481) | void Parse_Digits_PCRE(benchmark::State& state) { Parse3Digits(... function Parse_Digits_RE2 (line 482) | void Parse_Digits_RE2(benchmark::State& state) { Parse3Digits(... function Parse_Digits_Backtrack (line 483) | void Parse_Digits_Backtrack(benchmark::State& state) { Parse3Digits(... function Parse_Digits_BitState (line 484) | void Parse_Digits_BitState(benchmark::State& state) { Parse3Digits(... function Parse_CachedDigits_NFA (line 495) | void Parse_CachedDigits_NFA(benchmark::State& state) { Parse3D... function Parse_CachedDigits_OnePass (line 496) | void Parse_CachedDigits_OnePass(benchmark::State& state) { Parse3D... function Parse_CachedDigits_PCRE (line 497) | void Parse_CachedDigits_PCRE(benchmark::State& state) { Parse3D... function Parse_CachedDigits_RE2 (line 498) | void Parse_CachedDigits_RE2(benchmark::State& state) { Parse3D... function Parse_CachedDigits_Backtrack (line 499) | void Parse_CachedDigits_Backtrack(benchmark::State& state) { Parse3D... function Parse_CachedDigits_BitState (line 500) | void Parse_CachedDigits_BitState(benchmark::State& state) { Parse3D... function Parse3DigitDs (line 511) | void Parse3DigitDs(benchmark::State& state, function Parse_DigitDs_NFA (line 518) | void Parse_DigitDs_NFA(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_OnePass (line 519) | void Parse_DigitDs_OnePass(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_PCRE (line 520) | void Parse_DigitDs_PCRE(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_RE2 (line 521) | void Parse_DigitDs_RE2(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_Backtrack (line 522) | void Parse_DigitDs_Backtrack(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_BitState (line 523) | void Parse_DigitDs_BitState(benchmark::State& state) { Parse3DigitD... function Parse_CachedDigitDs_NFA (line 534) | void Parse_CachedDigitDs_NFA(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_OnePass (line 535) | void Parse_CachedDigitDs_OnePass(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_PCRE (line 536) | void Parse_CachedDigitDs_PCRE(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_RE2 (line 537) | void Parse_CachedDigitDs_RE2(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_Backtrack (line 538) | void Parse_CachedDigitDs_Backtrack(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_BitState (line 539) | void Parse_CachedDigitDs_BitState(benchmark::State& state) { Parse3... function Parse1Split (line 552) | void Parse1Split(benchmark::State& state, function Parse_Split_NFA (line 559) | void Parse_Split_NFA(benchmark::State& state) { Parse1Split(st... function Parse_Split_OnePass (line 560) | void Parse_Split_OnePass(benchmark::State& state) { Parse1Split(st... function Parse_Split_PCRE (line 561) | void Parse_Split_PCRE(benchmark::State& state) { Parse1Split(st... function Parse_Split_RE2 (line 562) | void Parse_Split_RE2(benchmark::State& state) { Parse1Split(st... function Parse_Split_BitState (line 563) | void Parse_Split_BitState(benchmark::State& state) { Parse1Split(st... function Parse_CachedSplit_NFA (line 573) | void Parse_CachedSplit_NFA(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_OnePass (line 574) | void Parse_CachedSplit_OnePass(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_PCRE (line 575) | void Parse_CachedSplit_PCRE(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_RE2 (line 576) | void Parse_CachedSplit_RE2(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_BitState (line 577) | void Parse_CachedSplit_BitState(benchmark::State& state) { Parse1Sp... function Parse1SplitHard (line 589) | void Parse1SplitHard(benchmark::State& state, function Parse_SplitHard_NFA (line 596) | void Parse_SplitHard_NFA(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_PCRE (line 597) | void Parse_SplitHard_PCRE(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_RE2 (line 598) | void Parse_SplitHard_RE2(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_BitState (line 599) | void Parse_SplitHard_BitState(benchmark::State& state) { Parse1Spli... function Parse_CachedSplitHard_NFA (line 608) | void Parse_CachedSplitHard_NFA(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_PCRE (line 609) | void Parse_CachedSplitHard_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_RE2 (line 610) | void Parse_CachedSplitHard_RE2(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_BitState (line 611) | void Parse_CachedSplitHard_BitState(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_Backtrack (line 612) | void Parse_CachedSplitHard_Backtrack(benchmark::State& state) { Parse1... function Parse1SplitBig1 (line 624) | void Parse1SplitBig1(benchmark::State& state, function Parse_CachedSplitBig1_PCRE (line 634) | void Parse_CachedSplitBig1_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitBig1_RE2 (line 635) | void Parse_CachedSplitBig1_RE2(benchmark::State& state) { Parse1... function Parse1SplitBig2 (line 644) | void Parse1SplitBig2(benchmark::State& state, function Parse_CachedSplitBig2_PCRE (line 654) | void Parse_CachedSplitBig2_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitBig2_RE2 (line 655) | void Parse_CachedSplitBig2_RE2(benchmark::State& state) { Parse1... function ParseRegexp (line 665) | void ParseRegexp(benchmark::State& state, const std::string& regexp) { function SimplifyRegexp (line 673) | void SimplifyRegexp(benchmark::State& state, const std::string& regexp) { function NullWalkRegexp (line 684) | void NullWalkRegexp(benchmark::State& state, const std::string& regexp) { function SimplifyCompileRegexp (line 693) | void SimplifyCompileRegexp(benchmark::State& state, const std::string&... function CompileRegexp (line 707) | void CompileRegexp(benchmark::State& state, const std::string& regexp) { function CompileToProg (line 718) | void CompileToProg(benchmark::State& state, const std::string& regexp) { function CompileByteMap (line 729) | void CompileByteMap(benchmark::State& state, const std::string& regexp) { function CompilePCRE (line 741) | void CompilePCRE(benchmark::State& state, const std::string& regexp) { function CompileRE2 (line 748) | void CompileRE2(benchmark::State& state, const std::string& regexp) { function RunBuild (line 755) | void RunBuild(benchmark::State& state, const std::string& regexp, function BM_PCRE_Compile (line 768) | void BM_PCRE_Compile(benchmark::State& state) { RunBuild(s... function BM_Regexp_Parse (line 769) | void BM_Regexp_Parse(benchmark::State& state) { RunBuild(s... function BM_Regexp_Simplify (line 770) | void BM_Regexp_Simplify(benchmark::State& state) { RunBuild(s... function BM_CompileToProg (line 771) | void BM_CompileToProg(benchmark::State& state) { RunBuild(s... function BM_CompileByteMap (line 772) | void BM_CompileByteMap(benchmark::State& state) { RunBuild(s... function BM_Regexp_Compile (line 773) | void BM_Regexp_Compile(benchmark::State& state) { RunBuild(s... function BM_Regexp_SimplifyCompile (line 774) | void BM_Regexp_SimplifyCompile(benchmark::State& state) { RunBuild(s... function BM_Regexp_NullWalk (line 775) | void BM_Regexp_NullWalk(benchmark::State& state) { RunBuild(s... function BM_RE2_Compile (line 776) | void BM_RE2_Compile(benchmark::State& state) { RunBuild(s... function SearchPhone (line 792) | void SearchPhone(benchmark::State& state, ParseImpl* search) { function SearchPhone_CachedPCRE (line 799) | void SearchPhone_CachedPCRE(benchmark::State& state) { function SearchPhone_CachedRE2 (line 803) | void SearchPhone_CachedRE2(benchmark::State& state) { function SearchDFA (line 865) | void SearchDFA(benchmark::State& state, const char* regexp, function SearchNFA (line 883) | void SearchNFA(benchmark::State& state, const char* regexp, function SearchOnePass (line 899) | void SearchOnePass(benchmark::State& state, const char* regexp, function SearchBitState (line 916) | void SearchBitState(benchmark::State& state, const char* regexp, function SearchPCRE (line 933) | void SearchPCRE(benchmark::State& state, const char* regexp, function SearchRE2 (line 947) | void SearchRE2(benchmark::State& state, const char* regexp, function Prog (line 965) | Prog* GetCachedProg(const char* regexp) { function PCRE (line 983) | PCRE* GetCachedPCRE(const char* regexp) { function RE2 (line 996) | RE2* GetCachedRE2(const char* regexp) { function SearchCachedDFA (line 1009) | void SearchCachedDFA(benchmark::State& state, const char* regexp, function SearchCachedNFA (line 1022) | void SearchCachedNFA(benchmark::State& state, const char* regexp, function SearchCachedOnePass (line 1033) | void SearchCachedOnePass(benchmark::State& state, const char* regexp, function SearchCachedBitState (line 1045) | void SearchCachedBitState(benchmark::State& state, const char* regexp, function SearchCachedPCRE (line 1057) | void SearchCachedPCRE(benchmark::State& state, const char* regexp, function SearchCachedRE2 (line 1070) | void SearchCachedRE2(benchmark::State& state, const char* regexp, function Parse3NFA (line 1086) | void Parse3NFA(benchmark::State& state, const char* regexp, function Parse3OnePass (line 1101) | void Parse3OnePass(benchmark::State& state, const char* regexp, function Parse3BitState (line 1117) | void Parse3BitState(benchmark::State& state, const char* regexp, function Parse3Backtrack (line 1133) | void Parse3Backtrack(benchmark::State& state, const char* regexp, function Parse3PCRE (line 1148) | void Parse3PCRE(benchmark::State& state, const char* regexp, function Parse3RE2 (line 1158) | void Parse3RE2(benchmark::State& state, const char* regexp, function Parse3CachedNFA (line 1168) | void Parse3CachedNFA(benchmark::State& state, const char* regexp, function Parse3CachedOnePass (line 1178) | void Parse3CachedOnePass(benchmark::State& state, const char* regexp, function Parse3CachedBitState (line 1189) | void Parse3CachedBitState(benchmark::State& state, const char* regexp, function Parse3CachedBacktrack (line 1200) | void Parse3CachedBacktrack(benchmark::State& state, const char* regexp, function Parse3CachedPCRE (line 1210) | void Parse3CachedPCRE(benchmark::State& state, const char* regexp, function Parse3CachedRE2 (line 1219) | void Parse3CachedRE2(benchmark::State& state, const char* regexp, function Parse1NFA (line 1231) | void Parse1NFA(benchmark::State& state, const char* regexp, function Parse1OnePass (line 1246) | void Parse1OnePass(benchmark::State& state, const char* regexp, function Parse1BitState (line 1262) | void Parse1BitState(benchmark::State& state, const char* regexp, function Parse1PCRE (line 1278) | void Parse1PCRE(benchmark::State& state, const char* regexp, function Parse1RE2 (line 1288) | void Parse1RE2(benchmark::State& state, const char* regexp, function Parse1CachedNFA (line 1298) | void Parse1CachedNFA(benchmark::State& state, const char* regexp, function Parse1CachedOnePass (line 1308) | void Parse1CachedOnePass(benchmark::State& state, const char* regexp, function Parse1CachedBitState (line 1319) | void Parse1CachedBitState(benchmark::State& state, const char* regexp, function Parse1CachedBacktrack (line 1330) | void Parse1CachedBacktrack(benchmark::State& state, const char* regexp, function Parse1CachedPCRE (line 1340) | void Parse1CachedPCRE(benchmark::State& state, const char* regexp, function Parse1CachedRE2 (line 1349) | void Parse1CachedRE2(benchmark::State& state, const char* regexp, function SearchParse2CachedPCRE (line 1358) | void SearchParse2CachedPCRE(benchmark::State& state, const char* regexp, function SearchParse2CachedRE2 (line 1367) | void SearchParse2CachedRE2(benchmark::State& state, const char* regexp, function SearchParse1CachedPCRE (line 1376) | void SearchParse1CachedPCRE(benchmark::State& state, const char* regexp, function SearchParse1CachedRE2 (line 1385) | void SearchParse1CachedRE2(benchmark::State& state, const char* regexp, function EmptyPartialMatchPCRE (line 1394) | void EmptyPartialMatchPCRE(benchmark::State& state) { function EmptyPartialMatchRE2 (line 1401) | void EmptyPartialMatchRE2(benchmark::State& state) { function SimplePartialMatchPCRE (line 1412) | void SimplePartialMatchPCRE(benchmark::State& state) { function SimplePartialMatchRE2 (line 1419) | void SimplePartialMatchRE2(benchmark::State& state) { function HTTPPartialMatchPCRE (line 1434) | void HTTPPartialMatchPCRE(benchmark::State& state) { function HTTPPartialMatchRE2 (line 1442) | void HTTPPartialMatchRE2(benchmark::State& state) { function SmallHTTPPartialMatchPCRE (line 1458) | void SmallHTTPPartialMatchPCRE(benchmark::State& state) { function SmallHTTPPartialMatchRE2 (line 1466) | void SmallHTTPPartialMatchRE2(benchmark::State& state) { function DotMatchPCRE (line 1479) | void DotMatchPCRE(benchmark::State& state) { function DotMatchRE2 (line 1487) | void DotMatchRE2(benchmark::State& state) { function ASCIIMatchPCRE (line 1500) | void ASCIIMatchPCRE(benchmark::State& state) { function ASCIIMatchRE2 (line 1508) | void ASCIIMatchRE2(benchmark::State& state) { function FullMatchPCRE (line 1521) | void FullMatchPCRE(benchmark::State& state, const char *regexp) { function FullMatchRE2 (line 1531) | void FullMatchRE2(benchmark::State& state, const char *regexp) { function FullMatch_DotStar_CachedPCRE (line 1541) | void FullMatch_DotStar_CachedPCRE(benchmark::State& state) { function FullMatch_DotStar_CachedRE2 (line 1544) | void FullMatch_DotStar_CachedRE2(benchmark::State& state) { function FullMatch_DotStarDollar_CachedPCRE (line 1548) | void FullMatch_DotStarDollar_CachedPCRE(benchmark::State& state) { function FullMatch_DotStarDollar_CachedRE2 (line 1551) | void FullMatch_DotStarDollar_CachedRE2(benchmark::State& state) { function FullMatch_DotStarCapture_CachedPCRE (line 1555) | void FullMatch_DotStarCapture_CachedPCRE(benchmark::State& state) { function FullMatch_DotStarCapture_CachedRE2 (line 1558) | void FullMatch_DotStarCapture_CachedRE2(benchmark::State& state) { function PossibleMatchRangeCommon (line 1577) | void PossibleMatchRangeCommon(benchmark::State& state, const char* reg... function PossibleMatchRange_Trivial (line 1587) | void PossibleMatchRange_Trivial(benchmark::State& state) { function PossibleMatchRange_Complex (line 1590) | void PossibleMatchRange_Complex(benchmark::State& state) { function PossibleMatchRange_Prefix (line 1593) | void PossibleMatchRange_Prefix(benchmark::State& state) { function PossibleMatchRange_NoProg (line 1596) | void PossibleMatchRange_NoProg(benchmark::State& state) { type re2 (line 766) | namespace re2 { function Test (line 37) | void Test() { function MemoryUsage (line 57) | void MemoryUsage() { function NumCPUs (line 126) | int NumCPUs() { function RandomText (line 161) | std::string RandomText(int64_t nbytes) { function Search (line 182) | void Search(benchmark::State& state, const char* regexp, SearchImpl* s... function Search_Easy0_CachedDFA (line 212) | void Search_Easy0_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy0_CachedNFA (line 213) | void Search_Easy0_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy0_CachedPCRE (line 214) | void Search_Easy0_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy0_CachedRE2 (line 215) | void Search_Easy0_CachedRE2(benchmark::State& state) { Search(stat... function Search_Easy1_CachedDFA (line 224) | void Search_Easy1_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy1_CachedNFA (line 225) | void Search_Easy1_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy1_CachedPCRE (line 226) | void Search_Easy1_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy1_CachedRE2 (line 227) | void Search_Easy1_CachedRE2(benchmark::State& state) { Search(stat... function Search_Easy2_CachedDFA (line 236) | void Search_Easy2_CachedDFA(benchmark::State& state) { Search(stat... function Search_Easy2_CachedNFA (line 237) | void Search_Easy2_CachedNFA(benchmark::State& state) { Search(stat... function Search_Easy2_CachedPCRE (line 238) | void Search_Easy2_CachedPCRE(benchmark::State& state) { Search(stat... function Search_Easy2_CachedRE2 (line 239) | void Search_Easy2_CachedRE2(benchmark::State& state) { Search(stat... function Search_Medium_CachedDFA (line 248) | void Search_Medium_CachedDFA(benchmark::State& state) { Search(sta... function Search_Medium_CachedNFA (line 249) | void Search_Medium_CachedNFA(benchmark::State& state) { Search(sta... function Search_Medium_CachedPCRE (line 250) | void Search_Medium_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Medium_CachedRE2 (line 251) | void Search_Medium_CachedRE2(benchmark::State& state) { Search(sta... function Search_Hard_CachedDFA (line 260) | void Search_Hard_CachedDFA(benchmark::State& state) { Search(state... function Search_Hard_CachedNFA (line 261) | void Search_Hard_CachedNFA(benchmark::State& state) { Search(state... function Search_Hard_CachedPCRE (line 262) | void Search_Hard_CachedPCRE(benchmark::State& state) { Search(state... function Search_Hard_CachedRE2 (line 263) | void Search_Hard_CachedRE2(benchmark::State& state) { Search(state... function Search_Fanout_CachedDFA (line 272) | void Search_Fanout_CachedDFA(benchmark::State& state) { Search(sta... function Search_Fanout_CachedNFA (line 273) | void Search_Fanout_CachedNFA(benchmark::State& state) { Search(sta... function Search_Fanout_CachedPCRE (line 274) | void Search_Fanout_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Fanout_CachedRE2 (line 275) | void Search_Fanout_CachedRE2(benchmark::State& state) { Search(sta... function Search_Parens_CachedDFA (line 284) | void Search_Parens_CachedDFA(benchmark::State& state) { Search(sta... function Search_Parens_CachedNFA (line 285) | void Search_Parens_CachedNFA(benchmark::State& state) { Search(sta... function Search_Parens_CachedPCRE (line 286) | void Search_Parens_CachedPCRE(benchmark::State& state) { Search(sta... function Search_Parens_CachedRE2 (line 287) | void Search_Parens_CachedRE2(benchmark::State& state) { Search(sta... function SearchBigFixed (line 296) | void SearchBigFixed(benchmark::State& state, SearchImpl* search) { function Search_BigFixed_CachedDFA (line 306) | void Search_BigFixed_CachedDFA(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedNFA (line 307) | void Search_BigFixed_CachedNFA(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedPCRE (line 308) | void Search_BigFixed_CachedPCRE(benchmark::State& state) { SearchBi... function Search_BigFixed_CachedRE2 (line 309) | void Search_BigFixed_CachedRE2(benchmark::State& state) { SearchBi... function FindAndConsume (line 320) | void FindAndConsume(benchmark::State& state) { function SearchSuccess (line 337) | void SearchSuccess(benchmark::State& state, const char* regexp, function Search_Success_DFA (line 346) | void Search_Success_DFA(benchmark::State& state) { SearchSuccess(s... function Search_Success_NFA (line 347) | void Search_Success_NFA(benchmark::State& state) { SearchSuccess(s... function Search_Success_PCRE (line 348) | void Search_Success_PCRE(benchmark::State& state) { SearchSuccess(s... function Search_Success_RE2 (line 349) | void Search_Success_RE2(benchmark::State& state) { SearchSuccess(s... function Search_Success_OnePass (line 350) | void Search_Success_OnePass(benchmark::State& state) { SearchSuccess(s... function Search_Success_CachedDFA (line 360) | void Search_Success_CachedDFA(benchmark::State& state) { SearchSuc... function Search_Success_CachedNFA (line 361) | void Search_Success_CachedNFA(benchmark::State& state) { SearchSuc... function Search_Success_CachedPCRE (line 362) | void Search_Success_CachedPCRE(benchmark::State& state) { SearchSuc... function Search_Success_CachedRE2 (line 363) | void Search_Success_CachedRE2(benchmark::State& state) { SearchSuc... function Search_Success_CachedOnePass (line 364) | void Search_Success_CachedOnePass(benchmark::State& state) { SearchSuc... function Search_Success1_DFA (line 377) | void Search_Success1_DFA(benchmark::State& state) { SearchSuccess... function Search_Success1_NFA (line 378) | void Search_Success1_NFA(benchmark::State& state) { SearchSuccess... function Search_Success1_PCRE (line 379) | void Search_Success1_PCRE(benchmark::State& state) { SearchSuccess... function Search_Success1_RE2 (line 380) | void Search_Success1_RE2(benchmark::State& state) { SearchSuccess... function Search_Success1_BitState (line 381) | void Search_Success1_BitState(benchmark::State& state) { SearchSuccess... function Search_Success1_CachedDFA (line 391) | void Search_Success1_CachedDFA(benchmark::State& state) { SearchS... function Search_Success1_CachedNFA (line 392) | void Search_Success1_CachedNFA(benchmark::State& state) { SearchS... function Search_Success1_CachedPCRE (line 393) | void Search_Success1_CachedPCRE(benchmark::State& state) { SearchS... function Search_Success1_CachedRE2 (line 394) | void Search_Success1_CachedRE2(benchmark::State& state) { SearchS... function Search_Success1_CachedBitState (line 395) | void Search_Success1_CachedBitState(benchmark::State& state) { SearchS... function SearchAltMatch (line 408) | void SearchAltMatch(benchmark::State& state, SearchImpl* search) { function Search_AltMatch_DFA (line 414) | void Search_AltMatch_DFA(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_NFA (line 415) | void Search_AltMatch_NFA(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_OnePass (line 416) | void Search_AltMatch_OnePass(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_BitState (line 417) | void Search_AltMatch_BitState(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_PCRE (line 418) | void Search_AltMatch_PCRE(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_RE2 (line 419) | void Search_AltMatch_RE2(benchmark::State& state) { SearchAltMatc... function Search_AltMatch_CachedDFA (line 430) | void Search_AltMatch_CachedDFA(benchmark::State& state) { SearchA... function Search_AltMatch_CachedNFA (line 431) | void Search_AltMatch_CachedNFA(benchmark::State& state) { SearchA... function Search_AltMatch_CachedOnePass (line 432) | void Search_AltMatch_CachedOnePass(benchmark::State& state) { SearchA... function Search_AltMatch_CachedBitState (line 433) | void Search_AltMatch_CachedBitState(benchmark::State& state) { SearchA... function Search_AltMatch_CachedPCRE (line 434) | void Search_AltMatch_CachedPCRE(benchmark::State& state) { SearchA... function Search_AltMatch_CachedRE2 (line 435) | void Search_AltMatch_CachedRE2(benchmark::State& state) { SearchA... function SearchDigits (line 448) | void SearchDigits(benchmark::State& state, SearchImpl* search) { function Search_Digits_DFA (line 454) | void Search_Digits_DFA(benchmark::State& state) { SearchDigits... function Search_Digits_NFA (line 455) | void Search_Digits_NFA(benchmark::State& state) { SearchDigits... function Search_Digits_OnePass (line 456) | void Search_Digits_OnePass(benchmark::State& state) { SearchDigits... function Search_Digits_PCRE (line 457) | void Search_Digits_PCRE(benchmark::State& state) { SearchDigits... function Search_Digits_RE2 (line 458) | void Search_Digits_RE2(benchmark::State& state) { SearchDigits... function Search_Digits_BitState (line 459) | void Search_Digits_BitState(benchmark::State& state) { SearchDigits... function Parse3Digits (line 472) | void Parse3Digits(benchmark::State& state, function Parse_Digits_NFA (line 479) | void Parse_Digits_NFA(benchmark::State& state) { Parse3Digits(... function Parse_Digits_OnePass (line 480) | void Parse_Digits_OnePass(benchmark::State& state) { Parse3Digits(... function Parse_Digits_PCRE (line 481) | void Parse_Digits_PCRE(benchmark::State& state) { Parse3Digits(... function Parse_Digits_RE2 (line 482) | void Parse_Digits_RE2(benchmark::State& state) { Parse3Digits(... function Parse_Digits_Backtrack (line 483) | void Parse_Digits_Backtrack(benchmark::State& state) { Parse3Digits(... function Parse_Digits_BitState (line 484) | void Parse_Digits_BitState(benchmark::State& state) { Parse3Digits(... function Parse_CachedDigits_NFA (line 495) | void Parse_CachedDigits_NFA(benchmark::State& state) { Parse3D... function Parse_CachedDigits_OnePass (line 496) | void Parse_CachedDigits_OnePass(benchmark::State& state) { Parse3D... function Parse_CachedDigits_PCRE (line 497) | void Parse_CachedDigits_PCRE(benchmark::State& state) { Parse3D... function Parse_CachedDigits_RE2 (line 498) | void Parse_CachedDigits_RE2(benchmark::State& state) { Parse3D... function Parse_CachedDigits_Backtrack (line 499) | void Parse_CachedDigits_Backtrack(benchmark::State& state) { Parse3D... function Parse_CachedDigits_BitState (line 500) | void Parse_CachedDigits_BitState(benchmark::State& state) { Parse3D... function Parse3DigitDs (line 511) | void Parse3DigitDs(benchmark::State& state, function Parse_DigitDs_NFA (line 518) | void Parse_DigitDs_NFA(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_OnePass (line 519) | void Parse_DigitDs_OnePass(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_PCRE (line 520) | void Parse_DigitDs_PCRE(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_RE2 (line 521) | void Parse_DigitDs_RE2(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_Backtrack (line 522) | void Parse_DigitDs_Backtrack(benchmark::State& state) { Parse3DigitD... function Parse_DigitDs_BitState (line 523) | void Parse_DigitDs_BitState(benchmark::State& state) { Parse3DigitD... function Parse_CachedDigitDs_NFA (line 534) | void Parse_CachedDigitDs_NFA(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_OnePass (line 535) | void Parse_CachedDigitDs_OnePass(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_PCRE (line 536) | void Parse_CachedDigitDs_PCRE(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_RE2 (line 537) | void Parse_CachedDigitDs_RE2(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_Backtrack (line 538) | void Parse_CachedDigitDs_Backtrack(benchmark::State& state) { Parse3... function Parse_CachedDigitDs_BitState (line 539) | void Parse_CachedDigitDs_BitState(benchmark::State& state) { Parse3... function Parse1Split (line 552) | void Parse1Split(benchmark::State& state, function Parse_Split_NFA (line 559) | void Parse_Split_NFA(benchmark::State& state) { Parse1Split(st... function Parse_Split_OnePass (line 560) | void Parse_Split_OnePass(benchmark::State& state) { Parse1Split(st... function Parse_Split_PCRE (line 561) | void Parse_Split_PCRE(benchmark::State& state) { Parse1Split(st... function Parse_Split_RE2 (line 562) | void Parse_Split_RE2(benchmark::State& state) { Parse1Split(st... function Parse_Split_BitState (line 563) | void Parse_Split_BitState(benchmark::State& state) { Parse1Split(st... function Parse_CachedSplit_NFA (line 573) | void Parse_CachedSplit_NFA(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_OnePass (line 574) | void Parse_CachedSplit_OnePass(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_PCRE (line 575) | void Parse_CachedSplit_PCRE(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_RE2 (line 576) | void Parse_CachedSplit_RE2(benchmark::State& state) { Parse1Sp... function Parse_CachedSplit_BitState (line 577) | void Parse_CachedSplit_BitState(benchmark::State& state) { Parse1Sp... function Parse1SplitHard (line 589) | void Parse1SplitHard(benchmark::State& state, function Parse_SplitHard_NFA (line 596) | void Parse_SplitHard_NFA(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_PCRE (line 597) | void Parse_SplitHard_PCRE(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_RE2 (line 598) | void Parse_SplitHard_RE2(benchmark::State& state) { Parse1Spli... function Parse_SplitHard_BitState (line 599) | void Parse_SplitHard_BitState(benchmark::State& state) { Parse1Spli... function Parse_CachedSplitHard_NFA (line 608) | void Parse_CachedSplitHard_NFA(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_PCRE (line 609) | void Parse_CachedSplitHard_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_RE2 (line 610) | void Parse_CachedSplitHard_RE2(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_BitState (line 611) | void Parse_CachedSplitHard_BitState(benchmark::State& state) { Parse1... function Parse_CachedSplitHard_Backtrack (line 612) | void Parse_CachedSplitHard_Backtrack(benchmark::State& state) { Parse1... function Parse1SplitBig1 (line 624) | void Parse1SplitBig1(benchmark::State& state, function Parse_CachedSplitBig1_PCRE (line 634) | void Parse_CachedSplitBig1_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitBig1_RE2 (line 635) | void Parse_CachedSplitBig1_RE2(benchmark::State& state) { Parse1... function Parse1SplitBig2 (line 644) | void Parse1SplitBig2(benchmark::State& state, function Parse_CachedSplitBig2_PCRE (line 654) | void Parse_CachedSplitBig2_PCRE(benchmark::State& state) { Parse1... function Parse_CachedSplitBig2_RE2 (line 655) | void Parse_CachedSplitBig2_RE2(benchmark::State& state) { Parse1... function ParseRegexp (line 665) | void ParseRegexp(benchmark::State& state, const std::string& regexp) { function SimplifyRegexp (line 673) | void SimplifyRegexp(benchmark::State& state, const std::string& regexp) { function NullWalkRegexp (line 684) | void NullWalkRegexp(benchmark::State& state, const std::string& regexp) { function SimplifyCompileRegexp (line 693) | void SimplifyCompileRegexp(benchmark::State& state, const std::string&... function CompileRegexp (line 707) | void CompileRegexp(benchmark::State& state, const std::string& regexp) { function CompileToProg (line 718) | void CompileToProg(benchmark::State& state, const std::string& regexp) { function CompileByteMap (line 729) | void CompileByteMap(benchmark::State& state, const std::string& regexp) { function CompilePCRE (line 741) | void CompilePCRE(benchmark::State& state, const std::string& regexp) { function CompileRE2 (line 748) | void CompileRE2(benchmark::State& state, const std::string& regexp) { function RunBuild (line 755) | void RunBuild(benchmark::State& state, const std::string& regexp, function BM_PCRE_Compile (line 768) | void BM_PCRE_Compile(benchmark::State& state) { RunBuild(s... function BM_Regexp_Parse (line 769) | void BM_Regexp_Parse(benchmark::State& state) { RunBuild(s... function BM_Regexp_Simplify (line 770) | void BM_Regexp_Simplify(benchmark::State& state) { RunBuild(s... function BM_CompileToProg (line 771) | void BM_CompileToProg(benchmark::State& state) { RunBuild(s... function BM_CompileByteMap (line 772) | void BM_CompileByteMap(benchmark::State& state) { RunBuild(s... function BM_Regexp_Compile (line 773) | void BM_Regexp_Compile(benchmark::State& state) { RunBuild(s... function BM_Regexp_SimplifyCompile (line 774) | void BM_Regexp_SimplifyCompile(benchmark::State& state) { RunBuild(s... function BM_Regexp_NullWalk (line 775) | void BM_Regexp_NullWalk(benchmark::State& state) { RunBuild(s... function BM_RE2_Compile (line 776) | void BM_RE2_Compile(benchmark::State& state) { RunBuild(s... function SearchPhone (line 792) | void SearchPhone(benchmark::State& state, ParseImpl* search) { function SearchPhone_CachedPCRE (line 799) | void SearchPhone_CachedPCRE(benchmark::State& state) { function SearchPhone_CachedRE2 (line 803) | void SearchPhone_CachedRE2(benchmark::State& state) { function SearchDFA (line 865) | void SearchDFA(benchmark::State& state, const char* regexp, function SearchNFA (line 883) | void SearchNFA(benchmark::State& state, const char* regexp, function SearchOnePass (line 899) | void SearchOnePass(benchmark::State& state, const char* regexp, function SearchBitState (line 916) | void SearchBitState(benchmark::State& state, const char* regexp, function SearchPCRE (line 933) | void SearchPCRE(benchmark::State& state, const char* regexp, function SearchRE2 (line 947) | void SearchRE2(benchmark::State& state, const char* regexp, function Prog (line 965) | Prog* GetCachedProg(const char* regexp) { function PCRE (line 983) | PCRE* GetCachedPCRE(const char* regexp) { function RE2 (line 996) | RE2* GetCachedRE2(const char* regexp) { function SearchCachedDFA (line 1009) | void SearchCachedDFA(benchmark::State& state, const char* regexp, function SearchCachedNFA (line 1022) | void SearchCachedNFA(benchmark::State& state, const char* regexp, function SearchCachedOnePass (line 1033) | void SearchCachedOnePass(benchmark::State& state, const char* regexp, function SearchCachedBitState (line 1045) | void SearchCachedBitState(benchmark::State& state, const char* regexp, function SearchCachedPCRE (line 1057) | void SearchCachedPCRE(benchmark::State& state, const char* regexp, function SearchCachedRE2 (line 1070) | void SearchCachedRE2(benchmark::State& state, const char* regexp, function Parse3NFA (line 1086) | void Parse3NFA(benchmark::State& state, const char* regexp, function Parse3OnePass (line 1101) | void Parse3OnePass(benchmark::State& state, const char* regexp, function Parse3BitState (line 1117) | void Parse3BitState(benchmark::State& state, const char* regexp, function Parse3Backtrack (line 1133) | void Parse3Backtrack(benchmark::State& state, const char* regexp, function Parse3PCRE (line 1148) | void Parse3PCRE(benchmark::State& state, const char* regexp, function Parse3RE2 (line 1158) | void Parse3RE2(benchmark::State& state, const char* regexp, function Parse3CachedNFA (line 1168) | void Parse3CachedNFA(benchmark::State& state, const char* regexp, function Parse3CachedOnePass (line 1178) | void Parse3CachedOnePass(benchmark::State& state, const char* regexp, function Parse3CachedBitState (line 1189) | void Parse3CachedBitState(benchmark::State& state, const char* regexp, function Parse3CachedBacktrack (line 1200) | void Parse3CachedBacktrack(benchmark::State& state, const char* regexp, function Parse3CachedPCRE (line 1210) | void Parse3CachedPCRE(benchmark::State& state, const char* regexp, function Parse3CachedRE2 (line 1219) | void Parse3CachedRE2(benchmark::State& state, const char* regexp, function Parse1NFA (line 1231) | void Parse1NFA(benchmark::State& state, const char* regexp, function Parse1OnePass (line 1246) | void Parse1OnePass(benchmark::State& state, const char* regexp, function Parse1BitState (line 1262) | void Parse1BitState(benchmark::State& state, const char* regexp, function Parse1PCRE (line 1278) | void Parse1PCRE(benchmark::State& state, const char* regexp, function Parse1RE2 (line 1288) | void Parse1RE2(benchmark::State& state, const char* regexp, function Parse1CachedNFA (line 1298) | void Parse1CachedNFA(benchmark::State& state, const char* regexp, function Parse1CachedOnePass (line 1308) | void Parse1CachedOnePass(benchmark::State& state, const char* regexp, function Parse1CachedBitState (line 1319) | void Parse1CachedBitState(benchmark::State& state, const char* regexp, function Parse1CachedBacktrack (line 1330) | void Parse1CachedBacktrack(benchmark::State& state, const char* regexp, function Parse1CachedPCRE (line 1340) | void Parse1CachedPCRE(benchmark::State& state, const char* regexp, function Parse1CachedRE2 (line 1349) | void Parse1CachedRE2(benchmark::State& state, const char* regexp, function SearchParse2CachedPCRE (line 1358) | void SearchParse2CachedPCRE(benchmark::State& state, const char* regexp, function SearchParse2CachedRE2 (line 1367) | void SearchParse2CachedRE2(benchmark::State& state, const char* regexp, function SearchParse1CachedPCRE (line 1376) | void SearchParse1CachedPCRE(benchmark::State& state, const char* regexp, function SearchParse1CachedRE2 (line 1385) | void SearchParse1CachedRE2(benchmark::State& state, const char* regexp, function EmptyPartialMatchPCRE (line 1394) | void EmptyPartialMatchPCRE(benchmark::State& state) { function EmptyPartialMatchRE2 (line 1401) | void EmptyPartialMatchRE2(benchmark::State& state) { function SimplePartialMatchPCRE (line 1412) | void SimplePartialMatchPCRE(benchmark::State& state) { function SimplePartialMatchRE2 (line 1419) | void SimplePartialMatchRE2(benchmark::State& state) { function HTTPPartialMatchPCRE (line 1434) | void HTTPPartialMatchPCRE(benchmark::State& state) { function HTTPPartialMatchRE2 (line 1442) | void HTTPPartialMatchRE2(benchmark::State& state) { function SmallHTTPPartialMatchPCRE (line 1458) | void SmallHTTPPartialMatchPCRE(benchmark::State& state) { function SmallHTTPPartialMatchRE2 (line 1466) | void SmallHTTPPartialMatchRE2(benchmark::State& state) { function DotMatchPCRE (line 1479) | void DotMatchPCRE(benchmark::State& state) { function DotMatchRE2 (line 1487) | void DotMatchRE2(benchmark::State& state) { function ASCIIMatchPCRE (line 1500) | void ASCIIMatchPCRE(benchmark::State& state) { function ASCIIMatchRE2 (line 1508) | void ASCIIMatchRE2(benchmark::State& state) { function FullMatchPCRE (line 1521) | void FullMatchPCRE(benchmark::State& state, const char *regexp) { function FullMatchRE2 (line 1531) | void FullMatchRE2(benchmark::State& state, const char *regexp) { function FullMatch_DotStar_CachedPCRE (line 1541) | void FullMatch_DotStar_CachedPCRE(benchmark::State& state) { function FullMatch_DotStar_CachedRE2 (line 1544) | void FullMatch_DotStar_CachedRE2(benchmark::State& state) { function FullMatch_DotStarDollar_CachedPCRE (line 1548) | void FullMatch_DotStarDollar_CachedPCRE(benchmark::State& state) { function FullMatch_DotStarDollar_CachedRE2 (line 1551) | void FullMatch_DotStarDollar_CachedRE2(benchmark::State& state) { function FullMatch_DotStarCapture_CachedPCRE (line 1555) | void FullMatch_DotStarCapture_CachedPCRE(benchmark::State& state) { function FullMatch_DotStarCapture_CachedRE2 (line 1558) | void FullMatch_DotStarCapture_CachedRE2(benchmark::State& state) { function PossibleMatchRangeCommon (line 1577) | void PossibleMatchRangeCommon(benchmark::State& state, const char* reg... function PossibleMatchRange_Trivial (line 1587) | void PossibleMatchRange_Trivial(benchmark::State& state) { function PossibleMatchRange_Complex (line 1590) | void PossibleMatchRange_Complex(benchmark::State& state) { function PossibleMatchRange_Prefix (line 1593) | void PossibleMatchRange_Prefix(benchmark::State& state) { function PossibleMatchRange_NoProg (line 1596) | void PossibleMatchRange_NoProg(benchmark::State& state) { FILE: re2/testing/regexp_generator.cc type re2 (line 44) | namespace re2 { function CountArgs (line 89) | static int CountArgs(const std::string& s) { function Explode (line 249) | std::vector Explode(absl::string_view s) { function Split (line 264) | std::vector Split(absl::string_view sep, absl::string_vie... FILE: re2/testing/regexp_generator.h function namespace (line 19) | namespace re2 { FILE: re2/testing/regexp_test.cc type re2 (line 17) | namespace re2 { function TEST (line 20) | TEST(Regexp, BigRef) { function TEST (line 33) | TEST(Regexp, BigConcat) { function TEST (line 48) | TEST(Regexp, NamedCaptures) { function TEST (line 67) | TEST(Regexp, CaptureNames) { FILE: re2/testing/required_prefix_test.cc type re2 (line 14) | namespace re2 { type PrefixTest (line 16) | struct PrefixTest { function TEST (line 48) | TEST(RequiredPrefix, SimpleTests) { function TEST (line 110) | TEST(RequiredPrefixForAccel, SimpleTests) { function TEST (line 136) | TEST(RequiredPrefixForAccel, CaseFoldingForKAndS) { function TEST (line 175) | TEST(PrefixAccel, SimpleTests) { FILE: re2/testing/search_test.cc type re2 (line 20) | namespace re2 { type RegexpTest (line 22) | struct RegexpTest { function TEST (line 319) | TEST(Regexp, SearchTests) { FILE: re2/testing/set_test.cc type re2 (line 15) | namespace re2 { function TEST (line 17) | TEST(Set, Unanchored) { function TEST (line 49) | TEST(Set, UnanchoredFactored) { function TEST (line 81) | TEST(Set, UnanchoredDollar) { function TEST (line 99) | TEST(Set, UnanchoredWordBoundary) { function TEST (line 122) | TEST(Set, Anchored) { function TEST (line 155) | TEST(Set, EmptyUnanchored) { function TEST (line 171) | TEST(Set, EmptyAnchored) { function TEST (line 187) | TEST(Set, Prefix) { function TEST (line 210) | TEST(Set, MoveSemantics) { FILE: re2/testing/simplify_test.cc type re2 (line 14) | namespace re2 { type Test (line 16) | struct Test { function TEST (line 263) | TEST(TestSimplify, SimpleRegexps) { FILE: re2/testing/string_generator.cc type re2 (line 21) | namespace re2 { function DeBruijnString (line 117) | std::string DeBruijnString(int n) { FILE: re2/testing/string_generator.h function namespace (line 20) | namespace re2 { FILE: re2/testing/string_generator_test.cc type re2 (line 19) | namespace re2 { function IntegerPower (line 22) | static int64_t IntegerPower(int i, int e) { function RunTest (line 38) | static void RunTest(int len, const std::string& alphabet, bool donull) { function TEST (line 86) | TEST(StringGenerator, NoLength) { function TEST (line 90) | TEST(StringGenerator, NoLengthNoAlphabet) { function TEST (line 94) | TEST(StringGenerator, NoAlphabet) { function TEST (line 98) | TEST(StringGenerator, Simple) { function TEST (line 102) | TEST(StringGenerator, UTF8) { function TEST (line 106) | TEST(StringGenerator, GenNULL) { FILE: re2/testing/tester.cc function Engines (line 65) | static uint32_t Engines() { type TestInstance::Result (line 94) | struct TestInstance::Result { method Result (line 95) | Result() method ClearSubmatch (line 104) | void ClearSubmatch() { function FormatCapture (line 121) | static std::string FormatCapture(absl::string_view text, function NonASCII (line 131) | static bool NonASCII(absl::string_view text) { function FormatKind (line 139) | static std::string FormatKind(Prog::MatchKind kind) { function FormatAnchor (line 154) | static std::string FormatAnchor(Prog::Anchor anchor) { type ParseMode (line 164) | struct ParseMode { function FormatMode (line 182) | static std::string FormatMode(Regexp::ParseFlags flags) { function ResultOkay (line 503) | static bool ResultOkay(const Result& r, const Result& correct) { function TestRegexpOnText (line 684) | bool TestRegexpOnText(absl::string_view regexp, FILE: re2/testing/tester.h function namespace (line 19) | namespace re2 { FILE: re2/tostring.cc type re2 (line 18) | namespace re2 { class ToStringWalker (line 37) | class ToStringWalker : public Regexp::Walker { method ToStringWalker (line 39) | explicit ToStringWalker(std::string* t) : t_(t) {} method ShortVisit (line 44) | virtual int ShortVisit(Regexp* re, int parent_arg) { method ToStringWalker (line 51) | ToStringWalker(const ToStringWalker&) = delete; method ToStringWalker (line 52) | ToStringWalker& operator=(const ToStringWalker&) = delete; function AppendLiteral (line 129) | static void AppendLiteral(std::string *t, Rune r, bool foldcase) { function AppendCCChar (line 306) | static void AppendCCChar(std::string* t, Rune r) { function AppendCCRange (line 341) | static void AppendCCRange(std::string* t, Rune lo, Rune hi) { FILE: re2/unicode.py class Error (line 22) | class Error(Exception): class InputError (line 26) | class InputError(Error): function _UInt (line 30) | def _UInt(s): function _URange (line 52) | def _URange(s): function _ParseContinue (line 78) | def _ParseContinue(s): function ReadUnicodeTable (line 105) | def ReadUnicodeTable(filename, nfields, doline): function CaseGroups (line 206) | def CaseGroups(unicode_dir=_UNICODE_DIR): function Scripts (line 240) | def Scripts(unicode_dir=_UNICODE_DIR): function Categories (line 261) | def Categories(unicode_dir=_UNICODE_DIR): FILE: re2/unicode_casefold.cc type re2 (line 7) | namespace re2 { FILE: re2/unicode_casefold.h function namespace (line 46) | namespace re2 { FILE: re2/unicode_groups.cc type re2 (line 7) | namespace re2 { FILE: re2/unicode_groups.h function namespace (line 25) | namespace re2 { FILE: re2/walker-inl.h function namespace (line 23) | namespace re2 { FILE: testinstall.cc function main (line 9) | int main() { FILE: util/malloc_counter.h function namespace (line 8) | namespace testing { FILE: util/pcre.cc function ABSL_FLAG (line 36) | ABSL_FLAG(int, regexp_stack_limit, 256 << 10, function parse_double_float (line 895) | static bool parse_double_float(const char* str, size_t n, bool isfloat, FILE: util/pcre.h function namespace (line 168) | namespace re2 { type pcre (line 172) | struct pcre function namespace (line 173) | namespace re2 { function namespace (line 188) | namespace re2 { function class (line 511) | class PCRE_Options { function class (line 558) | class PCRE::Arg { function PCRE (line 639) | inline PCRE::Arg::Arg() : arg_(NULL), parser_(parse_null) { } FILE: util/rune.cc type re2 (line 20) | namespace re2 { function chartorune (line 50) | int function runetochar (line 126) | int function runelen (line 183) | int function fullrune (line 191) | int function utflen (line 211) | int FILE: util/strutil.cc type re2 (line 7) | namespace re2 { function PrefixSuccessor (line 9) | void PrefixSuccessor(std::string* prefix) { FILE: util/strutil.h function namespace (line 10) | namespace re2 { FILE: util/utf.h function namespace (line 23) | namespace re2 {