#include <tuple>\n-
#include <memory>\n-
#include <type_traits>\n-
#include <dune/typetree/nodetags.hh>\n-
#include <dune/typetree/childextraction.hh>\n-
#include <dune/typetree/typetraits.hh>\n+\n
Go to the source code of this file.
\n\n Namespaces | |
| namespace | Dune |
| namespace | Dune::TypeTree |
\n-Classes | |
| struct | Dune::TypeTree::DefaultVisitor |
| Visitor interface and base class for TypeTree visitors. More... | |
| struct | Dune::TypeTree::DefaultPairVisitor |
| Visitor interface and base class for visitors of pairs of TypeTrees. More... | |
| struct | Dune::TypeTree::Experimental::DefaultHybridVisitor |
| Hybrid visitor interface and base class for TypeTree hybrid visitors. More... | |
| struct | Dune::TypeTree::VisitDirectChildren |
| Mixin base class for visitors that only want to visit the direct children of a node. More... | |
| struct | Dune::TypeTree::VisitDirectChildren::VisitChild< Node1, Child1, Node2, Child2, TreePath > |
| Template struct for determining whether or not to visit a given child. More... | |
| struct | Dune::TypeTree::VisitTree |
| Mixin base class for visitors that want to visit the complete tree. More... | |
| struct | Dune::TypeTree::VisitTree::VisitChild< Node1, Child1, Node2, Child2, TreePath > |
| Template struct for determining whether or not to visit a given child. More... | |
| struct | Dune::TypeTree::StaticTraversal |
| Mixin base class for visitors that require a static TreePath during traversal. More... | |
| struct | Dune::TypeTree::DynamicTraversal |
| Mixin base class for visitors that only need a dynamic TreePath during traversal. More... | |
| struct | Dune::TypeTree::TreeVisitor |
| Convenience base class for visiting the entire tree. More... | |
| struct | Dune::TypeTree::DirectChildrenVisitor |
| Convenience base class for visiting the direct children of a node. More... | |
| struct | Dune::TypeTree::TreePairVisitor |
| Convenience base class for visiting an entire tree pair. More... | |
| struct | Dune::TypeTree::DirectChildrenPairVisitor |
| Convenience base class for visiting the direct children of a node pair. More... | |
| struct | Dune::TypeTree::Experimental::Info::LeafCounterVisitor |
| struct | Dune::TypeTree::Experimental::Info::NodeCounterVisitor |
| struct | Dune::TypeTree::Experimental::Info::DepthVisitor |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::TypeTree |
| namespace | Dune::TypeTree::Experimental |
| namespace | Dune::TypeTree::Experimental::Info |
| namespace | Dune::TypeTree::Detail |
\n Functions | |
| template<typename Tree > | |
| auto | Dune::TypeTree::Experimental::Info::depth (const Tree &tree) |
| The depth of the TypeTree. | |
| template<typename Tree > | |
| constexpr auto | Dune::TypeTree::Experimental::Info::depth () |
| The depth of the Tree. | |
| template<typename Tree > | |
| auto | Dune::TypeTree::Experimental::Info::nodeCount (const Tree &tree) |
| The total number of nodes in the Tree. | |
| template<typename Tree > | |
| auto | Dune::TypeTree::Experimental::Info::leafCount (const Tree &tree) |
| The number of leaf nodes in the Tree. | |
\n-Variables | |
| template<typename Tree > | |
| constexpr bool | Dune::TypeTree::Experimental::Info::isDynamic = std::is_same<std::size_t, decltype(leafCount(std::declval<Tree>()))>{} |
| true if any of the nodes in the tree only has dynamic degree. | |
| template<class T1 , class T2 , class TreePath , class V , std::enable_if_t<(std::decay_t< T1 >::isLeaf or std::decay_t< T2 >::isLeaf), int > = 0> | |
| void | Dune::TypeTree::Detail::applyToTreePair (T1 &&tree1, T2 &&tree2, TreePath treePath, V &&visitor) |
| template<typename Tree1 , typename Tree2 , typename Visitor > | |
| void | Dune::TypeTree::applyToTreePair (Tree1 &&tree1, Tree2 &&tree2, Visitor &&visitor) |
| Apply visitor to a pair of TypeTrees. | |
\n Generated by
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,106 +1,35 @@\n dune-typetree\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs | _\bV_\ba_\br_\bi_\ba_\bb_\bl_\be_\bs\n-visitor.hh File Reference\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n+pairtraversal.hh File Reference\n+#include \n- \n+ \n
\n visitor.hh
pairtraversal.hh
\n Go to the documentation of this file.
\n \n \n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n
\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n-\n-\n-\n-\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n- 229 template<typename T1, typename Child1, typename T2, typename Child2, typename TreePath, typename ChildIndex>
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-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:223
constexpr std::size_t treePathSize(const HybridTreePath< T... > &)
Returns the size (number of components) of the given HybridTreePath.
Definition treepath.hh:199
\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+void applyToTreePair(Tree1 &&tree1, Tree2 &&tree2, Visitor &&visitor)
Apply visitor to a pair of TypeTrees.
Definition pairtraversal.hh:126
constexpr HybridTreePath< T..., std::size_t > push_back(const HybridTreePath< T... > &tp, std::size_t i)
Appends a run time index to a HybridTreePath.
Definition treepath.hh:281
constexpr HybridTreePath< T... > hybridTreePath(const T &... t)
Constructs a new HybridTreePath from the given indices.
Definition treepath.hh:180
constexpr HybridTreePath< T... > treePath(const T &... t)
Constructs a new HybridTreePath from the given indices.
Definition treepath.hh:191
HybridTreePath< Dune::index_constant< i >... > TreePath
Definition treepath.hh:521
Definition accumulate_static.hh:13
auto hybridApplyToTree(Tree &&tree, Visitor &&visitor, Init &&init)
Apply hybrid visitor to TypeTree.
Definition accumulate_static.hh:698
constexpr bool isDynamic
true if any of the nodes in the tree only has dynamic degree.
Definition visitor.hh:537
auto leafCount(const Tree &tree)
The number of leaf nodes in the Tree.
Definition visitor.hh:530
auto nodeCount(const Tree &tree)
The total number of nodes in the Tree.
Definition visitor.hh:522
constexpr auto depth()
The depth of the Tree.
Definition visitor.hh:514
void applyToTreePair(T1 &&tree1, T2 &&tree2, TreePath treePath, V &&visitor)
Definition pairtraversal.hh:38
A hybrid version of TreePath that supports both compile time and run time indices.
Definition treepath.hh:79
Visitor interface and base class for TypeTree visitors.
Definition visitor.hh:47
void in(T &&, TreePath) const
Method for infix tree traversal.
Definition visitor.hh:70
void afterChild(T &&, Child &&, TreePath, ChildIndex) const
Method for child-parent traversal.
Definition visitor.hh:120
void beforeChild(T &&, Child &&, TreePath, ChildIndex) const
Method for parent-child traversal.
Definition visitor.hh:105
void post(T &&, TreePath) const
Method for postfix tree traversal.
Definition visitor.hh:81
void leaf(T &&, TreePath) const
Method for leaf traversal.
Definition visitor.hh:91
void pre(T &&, TreePath) const
Method for prefix tree traversal.
Definition visitor.hh:58
Visitor interface and base class for visitors of pairs of TypeTrees.
Definition visitor.hh:162
void leaf(T1 &&, T2 &&, TreePath) const
Method for leaf traversal.
Definition visitor.hh:214
void beforeChild(T1 &&, Child1 &&, T2 &&, Child2 &&, TreePath, ChildIndex) const
Method for parent-child traversal.
Definition visitor.hh:230
void pre(T1 &&, T2 &&, TreePath) const
Method for prefix tree traversal.
Definition visitor.hh:174
void post(T1 &&, T2 &&, TreePath) const
Method for postfix traversal.
Definition visitor.hh:199
void in(T1 &&, T2 &&, TreePath) const
Method for infix tree traversal.
Definition visitor.hh:187
void afterChild(T1 &&, Child1 &&, T2 &&, Child2 &&, TreePath, ChildIndex) const
Method for child-parent traversal.
Definition visitor.hh:246
Hybrid visitor interface and base class for TypeTree hybrid visitors.
Definition visitor.hh:284
auto post(T &&, TreePath, const U &u) const
Method for postfix tree traversal.
Definition visitor.hh:314
auto pre(T &&, TreePath, const U &u) const
Method for prefix tree traversal.
Definition visitor.hh:294
auto leaf(T &&, TreePath, const U &u) const
Method for leaf traversal.
Definition visitor.hh:324
auto afterChild(T &&, Child &&, TreePath, ChildIndex, const U &u) const
Method for child-parent traversal.
Definition visitor.hh:344
auto in(T &&, TreePath, const U &u) const
Method for infix tree traversal.
Definition visitor.hh:304
auto beforeChild(T &&, Child &&, TreePath, ChildIndex, const U &u) const
Method for parent-child traversal.
Definition visitor.hh:334
Mixin base class for visitors that only want to visit the direct children of a node.
Definition visitor.hh:356
Template struct for determining whether or not to visit a given child.
Definition visitor.hh:368
static const bool value
Do not visit any child.
Definition visitor.hh:370
Mixin base class for visitors that want to visit the complete tree.
Definition visitor.hh:382
Template struct for determining whether or not to visit a given child.
Definition visitor.hh:394
static const bool value
Visit any child.
Definition visitor.hh:396
Mixin base class for visitors that require a static TreePath during traversal.
Definition visitor.hh:410
static const TreePathType::Type treePathType
Use the static tree traversal algorithm.
Definition visitor.hh:412
Mixin base class for visitors that only need a dynamic TreePath during traversal.
Definition visitor.hh:424
static const TreePathType::Type treePathType
Use the dynamic tree traversal algorithm.
Definition visitor.hh:426
Convenience base class for visiting the entire tree.
Definition visitor.hh:433
Convenience base class for visiting the direct children of a node.
Definition visitor.hh:439
Convenience base class for visiting an entire tree pair.
Definition visitor.hh:445
Convenience base class for visiting the direct children of a node pair.
Definition visitor.hh:451
Definition visitor.hh:459
auto leaf(Tree &&, TreePath, U u) const
Definition visitor.hh:473
auto beforeChild(Tree &&, Child &&, TreePath, ChildIndex, U u) const
Definition visitor.hh:461
std::size_t beforeChild(Tree &&, Child &&, TreePath, std::size_t, U u) const
Definition visitor.hh:467
Definition visitor.hh:482
auto pre(Tree &&, TreePath, U u) const
Definition visitor.hh:484
Definition visitor.hh:493
auto leaf(Tree &&, TreePath, U u) const
Definition visitor.hh:495
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,482 +1,164 @@\n dune-typetree\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-visitor.hh\n+pairtraversal.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3\n-4#ifndef DUNE_TYPETREE_VISITOR_HH\n-5#define DUNE_TYPETREE_VISITOR_HH\n+4#ifndef DUNE_TYPETREE_PAIRTRAVERSAL_HH\n+5#define DUNE_TYPETREE_PAIRTRAVERSAL_HH\n 6\n-7#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bt_\br_\be_\be_\bp_\ba_\bt_\bh_\b._\bh_\bh>\n-8#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bu_\bt_\bi_\bl_\bi_\bt_\by_\b._\bh_\bh>\n-9\n-10namespace _\bD_\bu_\bn_\be {\n-11 namespace TypeTree {\n-12\n-19\n-_\b4_\b6 struct _\bD_\be_\bf_\ba_\bu_\bl_\bt_\bV_\bi_\bs_\bi_\bt_\bo_\br\n-47 {\n-48\n-50\n-57 template\n \n+ \n
\n \n Classes |\n Namespaces
\n- powernode.hh File Reference
filteredcompositenode.hh File Reference
\n-
\n-
\n-
\n+
\n+
\n
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n+
\n\n \n
\n
#include <cassert>\n-
#include <array>\n-
#include <memory>\n+
#include <memory>\n+
#include <tuple>\n
#include <type_traits>\n+
#include <dune/typetree/nodetags.hh>\n+
#include <dune/typetree/filters.hh>\n+
#include <dune/common/shared_ptr.hh>\n
#include <dune/common/typetraits.hh>\n-
#include <dune/common/std/type_traits.hh>\n-
#include <dune/typetree/nodetags.hh>\n-
#include <dune/typetree/utility.hh>\n-
#include <dune/typetree/childextraction.hh>\n-
#include <dune/typetree/typetraits.hh>\n+
#include <dune/common/indices.hh>\n
Go to the source code of this file.
\n\n Classes | |
| class | Dune::TypeTree::PowerNode< T, k > |
| Collect k instances of type T within a dune-typetree. More... | |
| class | Dune::TypeTree::FilteredCompositeNode< Node, Filter > |
| Base class for composite nodes representing a filtered view on an underlying composite node. More... | |
| struct | Dune::TypeTree::PowerNode< T, k >::Child< i > |
| Access to the type and storage type of the i-th child. More... | |
| struct | Dune::TypeTree::FilteredCompositeNode< Node, Filter >::Child< k > |
| Access to the type and storage type of the i-th child. More... | |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::TypeTree |
\n Namespaces | |
| namespace | Dune |
| namespace | Dune::TypeTree |
\n+Functions | |
| template<typename SourceNode , typename Transformation , typename Tag > | |
| void | Dune::TypeTree::registerNodeTransformation (SourceNode *, Transformation *, Tag *) |
| Register transformation descriptor to transform SourceNode with Transformation. | |
\n Generated by
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,49 +1,39 @@\n dune-typetree\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-proxynode.hh File Reference\n-#include \n- \n+ \n
\n proxynode.hh
transformation.hh
\n Go to the documentation of this file.
\n \n \n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
\n-\n-\n-\n-
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n- 30 static const bool proxiedNodeIsConst = std::is_const<typename std::remove_reference<ProxiedNode>::type>::value;
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n+\n+\n+\n+\n+\n+\n+ 70 typedef decltype(registerNodeTransformation(declptr<S>(),declptr<T>(),declptr<Tag>())) lookup_type;
\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-
\n+ 76 static_assert((!std::is_same<type,void>::value), "Unable to find valid transformation descriptor");
\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+ 92 template<typename SourceTree, typename Transformation, typename Tag = StartTag, bool recursive = true>
\n+\n+\n+\n+\n+\n+\n+
\n-\n-\n-\n- 98 typedef typename LookupNodeTransformation<SourceTree,Transformation,typename SourceTree::ImplementationTag>::type NodeTransformation;
\n+\n+\n+ 101 typedef typename TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transformed_type transformed_type;
\n+\n+\n+ 104 typedef typename TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transformed_storage_type transformed_storage_type;
\n+\n+\n \n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n \n+\n \n-\n-\n- 135 static const bool proxiedNodeIsConst = std::is_const<typename std::remove_reference<ProxiedNode>::type>::value;
\n+\n+\n+\n+\n+\n+
\n+\n+ 114 static transformed_type transform(const SourceTree& s, const Transformation& t = Transformation())
\n+\n+ 116 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(s,t);
\n+\n+\n+\n+\n+
\n+\n+ 122 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(s,t);
\n+\n+\n+
\n+\n+ 126 static transformed_type transform(std::shared_ptr<const SourceTree> sp, const Transformation& t = Transformation())
\n+\n+ 128 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(sp,t);
\n+\n+\n+\n+\n+
\n \n-\n-\n-\n+ 134 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(sp,t);
\n+\n+\n+
\n \n-\n-\n-\n-\n-\n-\n+ 139 static transformed_storage_type transform_storage(std::shared_ptr<const SourceTree> sp, const Transformation& t = Transformation())
\n \n-\n+ 141 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform_storage(sp,t);
\n \n+\n+
\n \n+\n+\n+ 146 static transformed_storage_type transform_storage(std::shared_ptr<const SourceTree> sp, Transformation& t)
\n+\n+ 148 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform_storage(sp,t);
\n+\n+\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n- 254 static const bool proxiedNodeIsConst = std::is_const<typename std::remove_reference<Node>::type>::value;
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+ 279 // The problem is that the transformed power node must be parameterized on the transformed child
\n+\n+ 281 // template of the node transformation struct called result (see example of such a specification
\n+\n+ 283 using NodeTransformation = typename LookupNodeTransformation<Source,Transformation,ImplementationTag<Source>>::type;
\n+ 284 using ChildNodeTransformation = typename LookupNodeTransformation<ChildType,Transformation,ImplementationTag<ChildType>>::type;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 295 using transformed_child_storage_type = typename ChildTreeTransformation::transformed_storage_type;
\n+\n+\n+ 298 using transformed_type = typename NodeTransformation::template result<transformed_child_type>::type;
\n+ 299 using transformed_storage_type = typename NodeTransformation::template result<transformed_child_type>::storage_type;
\n+\n+\n+\n+\n+ 304 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n+\n+ 306 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n+\n+\n+\n+\n+\n+\n+\n+ 314 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n+\n+ 316 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n+\n+\n+\n+\n+\n+ 322 static transformed_type transform(std::shared_ptr<const Source> source_ptr, Transformation& transformation)
\n+\n+ 324 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source_ptr->degree());
\n+\n+ 326 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n+\n+\n+\n \n-\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-typename std::decay_t< Node >::NodeTag NodeTag
Returns the node tag of the given Node.
Definition nodeinterface.hh:76
decltype(Node::degree()) StaticDegree
Returns the statically known degree of the given Node type as a std::integral_constant.
Definition nodeinterface.hh:113
332 static transformed_type transform(std::shared_ptr<const Source> source_ptr, const Transformation& transformation)
\n+\n+ 334 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source_ptr->degree());
\n+\n+ 336 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n+\n+\n+\n+\n+\n+ 342 static transformed_storage_type transform_storage(std::shared_ptr<const Source> source_ptr, Transformation& transformation)
\n+\n+ 344 auto children_storage = node_storage_provider<transformed_child_storage_type>(source_ptr->degree());
\n+\n+ 346 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n+\n+\n+\n+\n+\n+ 352 static transformed_storage_type transform_storage(std::shared_ptr<const Source> source_ptr, const Transformation& transformation)
\n+\n+ 354 auto children_storage = node_storage_provider<transformed_child_storage_type>(source_ptr->degree());
\n+\n+ 356 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 388 // helper struct that does the actual transformation for a composite node. We need this additional struct
\n+ 389 // to extract the template argument list with the types of all children from the node, which we cannot do
\n+ 390 // directly in the transformation<> template, as the type passed to transformation<> will usually be a
\n+ 391 // derived type and will normally have more template arguments than just the children. This declaration
\n+ 392 // just introduces the type of the helper struct, we always instantiate the specialization defined below;
\n+\n+\n+\n+ 396 // specialized version of the helper struct which extracts the template argument list with the children from
\n+ 397 // its second template parameter, which has to be CompositeNode::ChildTypes. Apart from that, the struct is
\n+ 398 // similar to the one for a PowerNode, but it obviously delegates transformation of the children to the TMP.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 446 Dune::Hybrid::Impl::evaluateFoldExpression<int>({(setElement<i>(storage, ChildTransformation<i>::transform_storage(s.template childStorage<i>(), std::forward<Trafo>(t))),0)...});
\n+\n+\n+\n+\n+ 451 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp, Trafo&& t, std::index_sequence<i...> indices)
\n+\n+\n+ 454 Dune::Hybrid::Impl::evaluateFoldExpression<int>({(setElement<i>(storage, ChildTransformation<i>::transform_storage(sp->template childStorage<i>(), std::forward<Trafo>(t))),0)...});
\n+ 455 return NodeTransformation::transform_storage(sp, std::forward<Trafo>(t), std::get<i>(storage)...);
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 478 typedef typename transform_composite_node<S,ChildTypes,T>::transformed_storage_type transformed_storage_type;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+void registerNodeTransformation(SourceNode *, Transformation *, Tag *)
Register transformation descriptor to transform SourceNode with Transformation.
Definition accumulate_static.hh:13
Tag designating a power node with runtime degree.
Definition nodetags.hh:22
Base class for nodes acting as a proxy for an existing node.
Definition proxynode.hh:253
Dune::TypeTree::NodeTag< Node > NodeTag
Definition proxynode.hh:270
static const bool isComposite
Mark this class as a composite in the dune-typetree.
Definition proxynode.hh:279
static const bool isLeaf
Mark this class as non leaf in the dune-typetree.
Definition proxynode.hh:273
static const bool isPower
Mark this class as a non power in the dune-typetree.
Definition proxynode.hh:276
std::enable_if< enabled, Node & >::type proxiedNode()
Returns the proxied node.
Definition proxynode.hh:312
static const std::size_t CHILDREN
The number of children.
Definition proxynode.hh:283
std::shared_ptr< const Node > proxiedNodeStorage() const
Returns the storage of the proxied node (const version).
Definition proxynode.hh:332
std::enable_if< enabled, std::shared_ptr< Node > >::type proxiedNodeStorage()
Returns the storage of the proxied node.
Definition proxynode.hh:326
ProxyNode(std::shared_ptr< Node > node)
Definition proxynode.hh:346
const Node & proxiedNode() const
Returns the proxied node (const version).
Definition proxynode.hh:318
Mixin class providing methods for child access with compile-time parameter.
Definition proxynode.hh:28
auto & child(index_constant< k >={})
Returns the i-th child.
Definition proxynode.hh:69
void setChild(ProxyChild &&child, typename std::enable_if< lazy_enabled< k >::value, void * >::type=0)
Sets the i-th child to the passed-in value.
Definition proxynode.hh:110
const ProxiedNode::NodeStorage & nodeStorage() const
Definition proxynode.hh:115
auto childStorage(index_constant< k >={})
Returns the storage of the i-th child.
Definition proxynode.hh:90
const auto & child(index_constant< k >={}) const
Returns the i-th child (const version).
Definition proxynode.hh:79
auto childStorage(index_constant< k >={}) const
Returns the storage of the i-th child (const version).
Definition proxynode.hh:103
Access to the type and storage type of the i-th child.
Definition proxynode.hh:58
Mixin class providing methods for child access with run-time parameter.
Definition proxynode.hh:131
auto & child(std::size_t i)
Returns the i-th child.
Definition proxynode.hh:160
auto childStorage(std::size_t i) const
Returns the storage of the i-th child (const version).
Definition proxynode.hh:192
void setChild(std::size_t i, ProxyChild &&child, typename std::enable_if< enabled, void * >::type=0)
Sets the i-th child to the passed-in value.
Definition proxynode.hh:199
const auto & child(std::size_t i) const
Returns the i-th child (const version).
Definition proxynode.hh:169
auto childStorage(std::size_t i)
Returns the storage of the i-th child.
Definition proxynode.hh:180
Tag-based dispatch to appropriate base class that provides necessary functionality.
Definition proxynode.hh:208
Node::NodeStorage NodeStorage
Definition proxynode.hh:222
Node::ChildTypes ChildTypes
Definition proxynode.hh:221
Node::NodeStorage NodeStorage
Definition proxynode.hh:231
Node::ChildType ChildType
Definition proxynode.hh:230
Node::NodeStorage NodeStorage
Definition proxynode.hh:240
Node::ChildType ChildType
Definition proxynode.hh:239
static transformed_type transform(std::shared_ptr< const SourceTree > sp, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:132
static transformed_type transform(std::shared_ptr< const SourceTree > sp, const Transformation &t=Transformation())
Apply transformation to an existing tree s.
Definition transformation.hh:126
static transformed_type transform(const SourceTree &s, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:120
transformed_type type
The type of the transformed tree.
Definition transformation.hh:109
static transformed_type transform(const SourceTree &s, const Transformation &t=Transformation())
Apply transformation to an existing tree s.
Definition transformation.hh:114
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, const Transformation &t=Transformation())
Definition transformation.hh:139
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, Transformation &t)
Definition transformation.hh:146
Meta function that evaluates its argument iff it inherits from meta_function.
Definition typetraits.hh:140
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,459 +1,629 @@\n dune-typetree\u00a02.9\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-proxynode.hh\n+transformation.hh\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-\n 2// vi: set et ts=4 sw=2 sts=2:\n 3\n-4#ifndef DUNE_TYPETREE_PROXYNODE_HH\n-5#define DUNE_TYPETREE_PROXYNODE_HH\n+4#ifndef DUNE_TYPETREE_TRANSFORMATION_HH\n+5#define DUNE_TYPETREE_TRANSFORMATION_HH\n 6\n-7#include