29template <
bool constnode>
32 internalWalk(examinee);
35template <
bool constnode>
38 if (_examiner->examine(examinee)) walkChildren(examinee);
39 _examiner->post(examinee);
42template <
bool constnode>
44 for (
int i = 0; i < parent->
numChildren(); i++) internalWalk(parent->
child(i));
int numChildren() const
Number of children.
const ExprNode * child(size_t i) const
Get 0 indexed child.
void internalWalk(T_NODE *examinee)
void walkChildren(T_NODE *parent)
void walk(T_NODE *examinee)
Preorder walk.