Post-order depth-first-search iterator. More...
#include <expr_iterator.h>
Post-order depth-first-search iterator.
Visits all children before visiting the parent node. For expression (a + (b * c)), visits: a, b, c, *, +
Definition at line 342 of file expr_iterator.h.
Definition at line 345 of file expr_iterator.h.
Definition at line 349 of file expr_iterator.h.
Definition at line 347 of file expr_iterator.h.
Definition at line 348 of file expr_iterator.h.
Definition at line 346 of file expr_iterator.h.
Create iterator starting at the supplied node (root).
Immediately descends to the leftmost leaf.
Definition at line 353 of file expr_iterator.h.
Create an end iterator.
Descend from the given expression to its leftmost leaf, pushing all nodes along the path onto the stack.
Definition at line 424 of file expr_iterator.h.
Definition at line 366 of file expr_iterator.h.
Dereference operator Dereferencing end() iterator is undefined behaviour.
Definition at line 408 of file expr_iterator.h.
Preincrement operator Do not call on the end() iterator.
Definition at line 373 of file expr_iterator.h.
Post-increment operator Expensive copy.
Avoid if possible
Definition at line 399 of file expr_iterator.h.
Dereference operator (member access) Dereferencing end() iterator is undefined behaviour.
Definition at line 416 of file expr_iterator.h.
Definition at line 361 of file expr_iterator.h.
Definition at line 436 of file expr_iterator.h.