| OLD | NEW |
| 1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef V8_REGEXP_REGEXP_AST_H_ | 5 #ifndef V8_REGEXP_REGEXP_AST_H_ |
| 6 #define V8_REGEXP_REGEXP_AST_H_ | 6 #define V8_REGEXP_REGEXP_AST_H_ |
| 7 | 7 |
| 8 #include "src/objects.h" | 8 #include "src/objects.h" |
| 9 #include "src/utils.h" | 9 #include "src/utils.h" |
| 10 #include "src/zone-containers.h" | 10 #include "src/zone/zone-containers.h" |
| 11 #include "src/zone.h" | 11 #include "src/zone/zone.h" |
| 12 | 12 |
| 13 namespace v8 { | 13 namespace v8 { |
| 14 namespace internal { | 14 namespace internal { |
| 15 | 15 |
| 16 #define FOR_EACH_REG_EXP_TREE_TYPE(VISIT) \ | 16 #define FOR_EACH_REG_EXP_TREE_TYPE(VISIT) \ |
| 17 VISIT(Disjunction) \ | 17 VISIT(Disjunction) \ |
| 18 VISIT(Alternative) \ | 18 VISIT(Alternative) \ |
| 19 VISIT(Assertion) \ | 19 VISIT(Assertion) \ |
| 20 VISIT(CharacterClass) \ | 20 VISIT(CharacterClass) \ |
| 21 VISIT(Atom) \ | 21 VISIT(Atom) \ |
| (...skipping 503 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 525 RegExpEmpty* AsEmpty() override; | 525 RegExpEmpty* AsEmpty() override; |
| 526 bool IsEmpty() override; | 526 bool IsEmpty() override; |
| 527 int min_match() override { return 0; } | 527 int min_match() override { return 0; } |
| 528 int max_match() override { return 0; } | 528 int max_match() override { return 0; } |
| 529 }; | 529 }; |
| 530 | 530 |
| 531 } // namespace internal | 531 } // namespace internal |
| 532 } // namespace v8 | 532 } // namespace v8 |
| 533 | 533 |
| 534 #endif // V8_REGEXP_REGEXP_AST_H_ | 534 #endif // V8_REGEXP_REGEXP_AST_H_ |
| OLD | NEW |