DUNE PDELab (2.7)
visitor.hh
228 template<typename T1, typename Child1, typename T2, typename Child2, typename TreePath, typename ChildIndex>
229 void beforeChild(T1&& t1, Child1&& child1, T2&& t2, Child2&& child2, TreePath treePath, ChildIndex childIndex) const {}
244 template<typename T1, typename Child1, typename T2, typename Child2, typename TreePath, typename ChildIndex>
245 void afterChild(T1&& t1, Child1&& child1, T2&& t2, Child2&& child2, TreePath treePath, ChildIndex childIndex) const {}
A hybrid version of TreePath that supports both compile time and run time indices.
Definition: treepath.hh:79
constexpr HybridTreePath< T... > treePath(const T &... t)
Constructs a new HybridTreePath from the given indices.
Definition: treepath.hh:188
typename impl::_Child< Node, indices... >::type Child
Template alias for the type of a child node given by a list of child indices.
Definition: childextraction.hh:276
ImplementationDefined child(Node &&node, Indices... indices)
Extracts the child of a node given by a sequence of compile-time and run-time indices.
Definition: childextraction.hh:179
Visitor interface and base class for visitors of pairs of TypeTrees.
Definition: visitor.hh:161
void pre(T1 &&t1, T2 &&t2, TreePath treePath) const
Method for prefix tree traversal.
Definition: visitor.hh:173
void leaf(T1 &&t1, T2 &&t2, TreePath treePath) const
Method for leaf traversal.
Definition: visitor.hh:213
void afterChild(T1 &&t1, Child1 &&child1, T2 &&t2, Child2 &&child2, TreePath treePath, ChildIndex childIndex) const
Method for child-parent traversal.
Definition: visitor.hh:245
void post(T1 &&t1, T2 &&t2, TreePath treePath) const
Method for postfix traversal.
Definition: visitor.hh:198
void beforeChild(T1 &&t1, Child1 &&child1, T2 &&t2, Child2 &&child2, TreePath treePath, ChildIndex childIndex) const
Method for parent-child traversal.
Definition: visitor.hh:229
void in(T1 &&t1, T2 &&t2, TreePath treePath) const
Method for infix tree traversal.
Definition: visitor.hh:186
Visitor interface and base class for TypeTree visitors.
Definition: visitor.hh:46
void in(T &&t, TreePath treePath) const
Method for infix tree traversal.
Definition: visitor.hh:69
void pre(T &&t, TreePath treePath) const
Method for prefix tree traversal.
Definition: visitor.hh:57
void post(T &&t, TreePath treePath) const
Method for postfix tree traversal.
Definition: visitor.hh:80
void beforeChild(T &&t, Child &&child, TreePath treePath, ChildIndex childIndex) const
Method for parent-child traversal.
Definition: visitor.hh:104
void leaf(T &&t, TreePath treePath) const
Method for leaf traversal.
Definition: visitor.hh:90
void afterChild(T &&t, Child &&child, TreePath treePath, ChildIndex childIndex) const
Method for child-parent traversal.
Definition: visitor.hh:119
Convenience base class for visiting the direct children of a node pair.
Definition: visitor.hh:351
Convenience base class for visiting the direct children of a node.
Definition: visitor.hh:339
Mixin base class for visitors that only need a dynamic TreePath during traversal.
Definition: visitor.hh:324
static const TreePathType::Type treePathType
Use the dynamic tree traversal algorithm.
Definition: visitor.hh:326
Mixin base class for visitors that require a static TreePath during traversal.
Definition: visitor.hh:310
static const TreePathType::Type treePathType
Use the static tree traversal algorithm.
Definition: visitor.hh:312
Convenience base class for visiting an entire tree pair.
Definition: visitor.hh:345
Convenience base class for visiting the entire tree.
Definition: visitor.hh:333
Template struct for determining whether or not to visit a given child.
Definition: visitor.hh:268
static const bool value
Do not visit any child.
Definition: visitor.hh:270
Mixin base class for visitors that only want to visit the direct children of a node.
Definition: visitor.hh:256
Template struct for determining whether or not to visit a given child.
Definition: visitor.hh:294
static const bool value
Visit any child.
Definition: visitor.hh:296
Mixin base class for visitors that want to visit the complete tree.
Definition: visitor.hh:282
|
Legal Statements / Impressum |
Hosted by TU Dresden |
generated with Hugo v0.111.3
(Jul 15, 22:36, 2024)