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

  /external/v8/src/
ast.cc 200 RegExp##Name* RegExpTree::As##Name() { \
203 bool RegExpTree::Is##Name() { return false; }
218 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
258 ZoneList<RegExpTree*>* nodes = this->nodes();
260 RegExpTree* node = nodes->at(i);
269 ZoneList<RegExpTree*>* alternatives = this->alternatives();
410 if (that->max() == RegExpTree::kInfinity) {
452 SmartPointer<const char> RegExpTree::ToString() {
459 RegExpDisjunction::RegExpDisjunction(ZoneList<RegExpTree*>* alternatives)
462 RegExpTree* first_alternative = alternatives->at(0)
    [all...]
ast.h     [all...]
parser.cc 411 void AddAtom(RegExpTree* tree);
412 void AddAssertion(RegExpTree* tree);
415 RegExpTree* ToRegExp();
422 BufferedZoneList<RegExpTree, 2> terms_;
423 BufferedZoneList<RegExpTree, 2> text_;
424 BufferedZoneList<RegExpTree, 2> alternatives_;
448 RegExpTree* atom = new RegExpAtom(characters_->ToConstVector());
488 void RegExpBuilder::AddAtom(RegExpTree* term) {
504 void RegExpBuilder::AddAssertion(RegExpTree* assert) {
519 RegExpTree* alternative
    [all...]
globals.h 256 class RegExpTree;
jsregexp.cc 619 void RegExpTree::AppendToText(RegExpText* text) {
    [all...]
jsregexp.h     [all...]
  /external/v8/test/cctest/
test-regexp.cc 319 CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity);
320 CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity);
322 CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity);
323 CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity);
325 CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity);
326 CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity);
328 CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity);
329 CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity);
330 CHECK_MIN_MAX("(?:a?)+", 0, RegExpTree::kInfinity);
331 CHECK_MIN_MAX("(?:a*)+", 0, RegExpTree::kInfinity)
    [all...]

Completed in 72 milliseconds