#include <Tree.hpp>


Public Member Functions | |
| ChildNodesIterator (const Node &n) | |
| ~ChildNodesIterator () | |
| void | operator++ () |
| void | operator++ (int) |
| bool | isValid () const |
| OA_ptr< Node > | current () const |
ChildNodesIterator iterates over all the child nodes of a node. Thus, it skips the null edges.
Definition at line 381 of file Tree.hpp.
| OA::Tree::ChildNodesIterator::ChildNodesIterator | ( | const Node & | n | ) | [inline] |
| OA::Tree::ChildNodesIterator::~ChildNodesIterator | ( | ) | [inline] |
Reimplemented in OA::ExprTree::ChildNodesIterator, OA::ExprTree::ChildNodesIterator, and OA::NewExprTree::ChildNodesIterator.
Reimplemented from OA::Tree::OutEdgesIterator.
Reimplemented in OA::ExprTree::ChildNodesIterator, OA::ExprTree::ChildNodesIterator, and OA::NewExprTree::ChildNodesIterator.
Definition at line 388 of file Tree.hpp.
Referenced by OA::Tree::create_postorder_links(), OA::Tree::create_preorder_links(), OA::NewExprTree::ChildNodesIterator::current(), and OA::ExprTree::ChildNodesIterator::current().
| bool OA::Tree::ChildNodesIterator::isValid | ( | ) | const [inline, virtual] |
Reimplemented from OA::Tree::OutEdgesIterator.
Definition at line 387 of file Tree.hpp.
Referenced by OA::Tree::create_postorder_links(), OA::Tree::create_preorder_links(), OA::OutputNewExprTreeVisitor::visitOpNode(), OA::OutputExprTreeVisitor::visitOpNode(), OA::MemRefsVisitor::visitOpNode(), OA::AffineExpr::AffineExprExprTreeVisitor::visitOpNode(), OA::LinearityLocsVisitor::visitOpNode(), OA::EvalToConstVisitor::visitOpNode(), and OA::DifferentiableLocsVisitor::visitOpNode().
| void OA::Tree::ChildNodesIterator::operator++ | ( | ) | [inline, virtual] |
The ++ operator for OutEdgesIterator skips all null edges.
Reimplemented from OA::Tree::OutEdgesIterator.
| void OA::Tree::ChildNodesIterator::operator++ | ( | int | ) | [inline] |
Reimplemented from OA::Tree::OutEdgesIterator.
1.7.1