HomeSort by relevance Sort by last modified time
    Searched refs:RegExpTree (Results 1 - 8 of 8) sorted by null

  /external/v8/src/
parser.h 273 void AddAtom(RegExpTree* tree);
274 void AddAssertion(RegExpTree* tree);
277 RegExpTree* ToRegExp();
288 BufferedZoneList<RegExpTree, 2> terms_;
289 BufferedZoneList<RegExpTree, 2> text_;
290 BufferedZoneList<RegExpTree, 2> alternatives_;
310 RegExpTree* ParsePattern();
311 RegExpTree* ParseDisjunction();
312 RegExpTree* ParseGroup();
313 RegExpTree* ParseCharacterClass()
    [all...]
ast.h     [all...]
ast.cc 833 RegExp##Name* RegExpTree::As##Name() { \
836 bool RegExpTree::Is##Name() { return false; }
851 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
896 ZoneList<RegExpTree*>* nodes = this->nodes();
898 RegExpTree* node = nodes->at(i);
907 ZoneList<RegExpTree*>* nodes = this->nodes();
909 RegExpTree* node = nodes->at(i);
918 ZoneList<RegExpTree*>* alternatives = this->alternatives();
928 ZoneList<RegExpTree*>* alternatives = this->alternatives();
1074 if (that->max() == RegExpTree::kInfinity)
    [all...]
parser.cc 104 RegExpTree* atom = new(zone()) RegExpAtom(characters_->ToConstVector());
144 void RegExpBuilder::AddAtom(RegExpTree* term) {
160 void RegExpBuilder::AddAssertion(RegExpTree* assert) {
175 RegExpTree* alternative;
189 RegExpTree* RegExpBuilder::ToRegExp() {
209 RegExpTree* atom;
    [all...]
v8globals.h 160 class RegExpTree;
jsregexp.cc 721 void RegExpTree::AppendToText(RegExpText* text) {
    [all...]
jsregexp.h     [all...]
  /external/v8/test/cctest/
test-regexp.cc 335 CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity);
336 CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity);
338 CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity);
339 CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity);
341 CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity);
342 CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity);
344 CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity);
345 CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity);
346 CHECK_MIN_MAX("(?:a?)+", 0, RegExpTree::kInfinity);
347 CHECK_MIN_MAX("(?:a*)+", 0, RegExpTree::kInfinity)
    [all...]

Completed in 1038 milliseconds