Go to the source code of this file.
◆ DECLARE_VISIT [1/3]
#define DECLARE_VISIT |
( |
|
Type | ) |
virtual void Visit##Type(Type##Node* that) = 0; |
◆ DECLARE_VISIT [2/3]
#define DECLARE_VISIT |
( |
|
Type | ) |
virtual void Visit##Type(Type##Node* that); |
◆ DECLARE_VISIT [3/3]
#define DECLARE_VISIT |
( |
|
Type | ) |
virtual void Visit##Type(Type##Node* that); |
◆ FOR_EACH_NODE_TYPE
#define FOR_EACH_NODE_TYPE |
( |
|
VISIT | ) |
|
Value: VISIT(End) \
VISIT(Action) \
VISIT(Choice) \
VISIT(BackReference) \
VISIT(Assertion) \
VISIT(Text)
Definition at line 382 of file jsregexp.h.
◆ FOR_EACH_REG_EXP_TREE_TYPE
#define FOR_EACH_REG_EXP_TREE_TYPE |
( |
|
VISIT | ) |
|
Value: VISIT(Disjunction) \
VISIT(Alternative) \
VISIT(Assertion) \
VISIT(CharacterClass) \
VISIT(Atom) \
VISIT(Quantifier) \
VISIT(Capture) \
VISIT(Lookahead) \
VISIT(BackReference) \
VISIT(Empty) \
VISIT(Text)
Definition at line 391 of file jsregexp.h.
◆ FORWARD_DECLARE
#define FORWARD_DECLARE |
( |
|
Name | ) |
class RegExp##Name; |