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

  /external/chromium_org/v8/src/
ast.cc 685 RegExp##Name* RegExpTree::As##Name() { \
688 bool RegExpTree::Is##Name() { return false; }
701 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
746 ZoneList<RegExpTree*>* nodes = this->nodes();
748 RegExpTree* node = nodes->at(i);
757 ZoneList<RegExpTree*>* nodes = this->nodes();
759 RegExpTree* node = nodes->at(i);
768 ZoneList<RegExpTree*>* alternatives = this->alternatives();
778 ZoneList<RegExpTree*>* alternatives = this->alternatives();
926 if (that->max() == RegExpTree::kInfinity)
    [all...]
parser.h 221 void AddAtom(RegExpTree* tree);
222 void AddAssertion(RegExpTree* tree);
226 RegExpTree* ToRegExp();
237 BufferedZoneList<RegExpTree, 2> terms_;
238 BufferedZoneList<RegExpTree, 2> text_;
239 BufferedZoneList<RegExpTree, 2> alternatives_;
261 RegExpTree* ParsePattern();
262 RegExpTree* ParseDisjunction();
263 RegExpTree* ParseGroup();
264 RegExpTree* ParseCharacterClass()
    [all...]
ast.h     [all...]
parser.cc 40 RegExpTree* atom = new(zone()) RegExpAtom(characters_->ToConstVector());
80 void RegExpBuilder::AddAtom(RegExpTree* term) {
96 void RegExpBuilder::AddAssertion(RegExpTree* assert) {
111 RegExpTree* alternative;
125 RegExpTree* RegExpBuilder::ToRegExp() {
144 RegExpTree* atom;
    [all...]
jsregexp.h 19 class RegExpTree;
425 RegExpTree* tree() const { return tree_; }
438 TextElement(TextType text_type, RegExpTree* tree)
443 RegExpTree* tree_;
    [all...]
jsregexp.cc     [all...]
  /external/chromium_org/v8/test/cctest/
test-regexp.cc 357 CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity);
358 CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity);
360 CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity);
361 CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity);
363 CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity);
364 CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity);
366 CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity);
367 CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity);
368 CHECK_MIN_MAX("(?:a?)+", 0, RegExpTree::kInfinity);
369 CHECK_MIN_MAX("(?:a*)+", 0, RegExpTree::kInfinity)
    [all...]

Completed in 558 milliseconds