| Add_80_10ffff() | re2::Compiler | |
| Add_80_10ffff() | re2::Compiler | |
| AddRuneRange(Rune lo, Rune hi, bool foldcase) | re2::Compiler | |
| AddRuneRange(Rune lo, Rune hi, bool foldcase) | re2::Compiler | |
| AddRuneRangeLatin1(Rune lo, Rune hi, bool foldcase) | re2::Compiler | |
| AddRuneRangeLatin1(Rune lo, Rune hi, bool foldcase) | re2::Compiler | |
| AddRuneRangeUTF8(Rune lo, Rune hi, bool foldcase) | re2::Compiler | |
| AddRuneRangeUTF8(Rune lo, Rune hi, bool foldcase) | re2::Compiler | |
| AddSuffix(int id) | re2::Compiler | |
| AddSuffix(int id) | re2::Compiler | |
| AddSuffixRecursive(int root, int id) | re2::Compiler | |
| AddSuffixRecursive(int root, int id) | re2::Compiler | |
| AllocInst(int n) | re2::Compiler | |
| AllocInst(int n) | re2::Compiler | |
| Alt(Frag a, Frag b) | re2::Compiler | |
| Alt(Frag a, Frag b) | re2::Compiler | |
| anchor_ | re2::Compiler | private |
| BeginRange() | re2::Compiler | |
| BeginRange() | re2::Compiler | |
| ByteRange(int lo, int hi, bool foldcase) | re2::Compiler | |
| ByteRange(int lo, int hi, bool foldcase) | re2::Compiler | |
| ByteRangeEqual(int id1, int id2) | re2::Compiler | |
| ByteRangeEqual(int id1, int id2) | re2::Compiler | |
| CachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next) | re2::Compiler | |
| CachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next) | re2::Compiler | |
| Capture(Frag a, int n) | re2::Compiler | |
| Capture(Frag a, int n) | re2::Compiler | |
| Cat(Frag a, Frag b) | re2::Compiler | |
| Cat(Frag a, Frag b) | re2::Compiler | |
| Compile(Regexp *re, bool reversed, int64_t max_mem) | re2::Compiler | static |
| Compile(Regexp *re, bool reversed, int64_t max_mem) | re2::Compiler | static |
| Compiler() | re2::Compiler | explicit |
| Compiler(const Compiler &)=delete | re2::Compiler | private |
| Compiler() | re2::Compiler | explicit |
| Compiler(const Compiler &)=delete | re2::Compiler | private |
| CompileSet(Regexp *re, RE2::Anchor anchor, int64_t max_mem) | re2::Compiler | static |
| CompileSet(Regexp *re, RE2::Anchor anchor, int64_t max_mem) | re2::Compiler | static |
| Copy(Frag arg) | re2::Compiler | virtual |
| Copy(Frag arg) | re2::Compiler | virtual |
| DotStar() | re2::Compiler | |
| DotStar() | re2::Compiler | |
| EmptyWidth(EmptyOp op) | re2::Compiler | |
| EmptyWidth(EmptyOp op) | re2::Compiler | |
| encoding_ | re2::Compiler | private |
| EndRange() | re2::Compiler | |
| EndRange() | re2::Compiler | |
| failed_ | re2::Compiler | private |
| FindByteRange(int root, int id) | re2::Compiler | |
| FindByteRange(int root, int id) | re2::Compiler | |
| Finish() | re2::Compiler | |
| Finish(Regexp *re) | re2::Compiler | |
| inst_ | re2::Compiler | private |
| IsCachedRuneByteSuffix(int id) | re2::Compiler | |
| IsCachedRuneByteSuffix(int id) | re2::Compiler | |
| Literal(Rune r, bool foldcase) | re2::Compiler | |
| Literal(Rune r, bool foldcase) | re2::Compiler | |
| Match(int32_t id) | re2::Compiler | |
| Match(int32_t id) | re2::Compiler | |
| max_mem_ | re2::Compiler | private |
| max_ninst_ | re2::Compiler | private |
| max_visits_ | re2::Regexp::Walker< Frag > | private |
| ninst_ | re2::Compiler | private |
| NoMatch() | re2::Compiler | |
| NoMatch() | re2::Compiler | |
| Nop() | re2::Compiler | |
| Nop() | re2::Compiler | |
| operator=(const Compiler &)=delete | re2::Compiler | private |
| operator=(const Compiler &)=delete | re2::Compiler | private |
| Plus(Frag a, bool nongreedy) | re2::Compiler | |
| Plus(Frag a, bool nongreedy) | re2::Compiler | |
| PostVisit(Regexp *re, Frag parent_arg, Frag pre_arg, Frag *child_args, int nchild_args) | re2::Compiler | virtual |
| PostVisit(Regexp *re, Frag parent_arg, Frag pre_arg, Frag *child_args, int nchild_args) | re2::Compiler | virtual |
| PreVisit(Regexp *re, Frag parent_arg, bool *stop) | re2::Compiler | virtual |
| PreVisit(Regexp *re, Frag parent_arg, bool *stop) | re2::Compiler | virtual |
| prog_ | re2::Compiler | private |
| Quest(Frag a, bool nongreedy) | re2::Compiler | |
| Quest(Frag a, bool nongreedy) | re2::Compiler | |
| Reset() | re2::Regexp::Walker< Frag > | |
| Reset() | re2::Regexp::Walker< Frag > | |
| reversed_ | re2::Compiler | private |
| rune_cache_ | re2::Compiler | private |
| rune_range_ | re2::Compiler | private |
| Setup(Regexp::ParseFlags, int64_t, RE2::Anchor) | re2::Compiler | |
| Setup(Regexp::ParseFlags flags, int64_t max_mem, RE2::Anchor anchor) | re2::Compiler | |
| ShortVisit(Regexp *re, Frag parent_arg) | re2::Compiler | virtual |
| ShortVisit(Regexp *re, Frag parent_arg) | re2::Compiler | virtual |
| stack_ | re2::Regexp::Walker< Frag > | private |
| stack_ | re2::Regexp::Walker< Frag > | private |
| Star(Frag a, bool nongreedy) | re2::Compiler | |
| Star(Frag a, bool nongreedy) | re2::Compiler | |
| stopped_early() | re2::Regexp::Walker< Frag > | inline |
| stopped_early() | re2::Regexp::Walker< Frag > | inline |
| stopped_early_ | re2::Regexp::Walker< Frag > | private |
| UncachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next) | re2::Compiler | |
| UncachedRuneByteSuffix(uint8_t lo, uint8_t hi, bool foldcase, int next) | re2::Compiler | |
| Walk(Regexp *re, Frag top_arg) | re2::Regexp::Walker< Frag > | |
| Walk(Regexp *re, Frag top_arg) | re2::Regexp::Walker< Frag > | |
| Walker() | re2::Regexp::Walker< Frag > | |
| Walker(const Walker &)=delete | re2::Regexp::Walker< Frag > | private |
| Walker() | re2::Regexp::Walker< Frag > | |
| Walker(const Walker &)=delete | re2::Regexp::Walker< Frag > | private |
| WalkExponential(Regexp *re, Frag top_arg, int max_visits) | re2::Regexp::Walker< Frag > | |
| WalkExponential(Regexp *re, Frag top_arg, int max_visits) | re2::Regexp::Walker< Frag > | |
| WalkInternal(Regexp *re, Frag top_arg, bool use_copy) | re2::Regexp::Walker< Frag > | private |
| WalkInternal(Regexp *re, Frag top_arg, bool use_copy) | re2::Regexp::Walker< Frag > | private |
| ~Compiler() | re2::Compiler | |
| ~Compiler() | re2::Compiler | |
| ~Walker() | re2::Regexp::Walker< Frag > | virtual |
| ~Walker() | re2::Regexp::Walker< Frag > | virtual |