#include <cstddef>\n-
#include <dune/typetree/nodeinterface.hh>\n+
#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
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::Detail |
| namespace | Dune::TypeTree::Experimental |
| namespace | Dune::TypeTree::Experimental::Info |
\n Functions | |
| 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. | |
| 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. | |
\n Generated by
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,35 +1,106 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\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 pairtraversal.hh
visitor.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
3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n-\n-\n-\n-\n-
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
\n-\n-\n-\n- 74 using preferDynamicTraversal = std::bool_constant<Visitor::treePathType == TreePathType::dynamic>;
\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\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 applyToTreePair(Tree1 &&tree1, Tree2 &&tree2, Visitor &&visitor)
Apply visitor to a pair of TypeTrees.
Definition pairtraversal.hh:128
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:416
constexpr auto hybridTreePath(const T &... t)
Constructs a new HybridTreePath from the given indices.
Definition treepath.hh:312
constexpr auto treePath(const T &... t)
Constructs a new HybridTreePath from the given indices.
Definition treepath.hh:326
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n+\n+\n+\n+ 231 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+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:225
constexpr std::size_t treePathSize(const HybridTreePath< T... > &)
Returns the size (number of components) of the given HybridTreePath.
Definition treepath.hh:334
Definition accumulate_static.hh:16
void applyToTreePair(T1 &&tree1, T2 &&tree2, TreePath treePath, V &&visitor)
Definition pairtraversal.hh:40
auto hybridApplyToTree(Tree &&tree, Visitor &&visitor, Init &&init)
Apply hybrid visitor to TypeTree.
Definition accumulate_static.hh:701
constexpr bool isDynamic
true if any of the nodes in the tree only has dynamic degree.
Definition visitor.hh:539
auto leafCount(const Tree &tree)
The number of leaf nodes in the Tree.
Definition visitor.hh:532
auto nodeCount(const Tree &tree)
The total number of nodes in the Tree.
Definition visitor.hh:524
constexpr auto depth()
The depth of the Tree.
Definition visitor.hh:516
Visitor interface and base class for TypeTree visitors.
Definition visitor.hh:49
void in(T &&, TreePath) const
Method for infix tree traversal.
Definition visitor.hh:72
void afterChild(T &&, Child &&, TreePath, ChildIndex) const
Method for child-parent traversal.
Definition visitor.hh:122
void beforeChild(T &&, Child &&, TreePath, ChildIndex) const
Method for parent-child traversal.
Definition visitor.hh:107
void post(T &&, TreePath) const
Method for postfix tree traversal.
Definition visitor.hh:83
void leaf(T &&, TreePath) const
Method for leaf traversal.
Definition visitor.hh:93
void pre(T &&, TreePath) const
Method for prefix tree traversal.
Definition visitor.hh:60
Visitor interface and base class for visitors of pairs of TypeTrees.
Definition visitor.hh:164
void leaf(T1 &&, T2 &&, TreePath) const
Method for leaf traversal.
Definition visitor.hh:216
void beforeChild(T1 &&, Child1 &&, T2 &&, Child2 &&, TreePath, ChildIndex) const
Method for parent-child traversal.
Definition visitor.hh:232
void pre(T1 &&, T2 &&, TreePath) const
Method for prefix tree traversal.
Definition visitor.hh:176
void post(T1 &&, T2 &&, TreePath) const
Method for postfix traversal.
Definition visitor.hh:201
void in(T1 &&, T2 &&, TreePath) const
Method for infix tree traversal.
Definition visitor.hh:189
void afterChild(T1 &&, Child1 &&, T2 &&, Child2 &&, TreePath, ChildIndex) const
Method for child-parent traversal.
Definition visitor.hh:248
Hybrid visitor interface and base class for TypeTree hybrid visitors.
Definition visitor.hh:286
auto post(T &&, TreePath, const U &u) const
Method for postfix tree traversal.
Definition visitor.hh:316
auto pre(T &&, TreePath, const U &u) const
Method for prefix tree traversal.
Definition visitor.hh:296
auto leaf(T &&, TreePath, const U &u) const
Method for leaf traversal.
Definition visitor.hh:326
auto afterChild(T &&, Child &&, TreePath, ChildIndex, const U &u) const
Method for child-parent traversal.
Definition visitor.hh:346
auto in(T &&, TreePath, const U &u) const
Method for infix tree traversal.
Definition visitor.hh:306
auto beforeChild(T &&, Child &&, TreePath, ChildIndex, const U &u) const
Method for parent-child traversal.
Definition visitor.hh:336
Mixin base class for visitors that only want to visit the direct children of a node.
Definition visitor.hh:358
Template struct for determining whether or not to visit a given child.
Definition visitor.hh:370
static const bool value
Do not visit any child.
Definition visitor.hh:372
Mixin base class for visitors that want to visit the complete tree.
Definition visitor.hh:384
Template struct for determining whether or not to visit a given child.
Definition visitor.hh:396
static const bool value
Visit any child.
Definition visitor.hh:398
Mixin base class for visitors that require a static TreePath during traversal.
Definition visitor.hh:412
static const TreePathType::Type treePathType
Use the static tree traversal algorithm.
Definition visitor.hh:414
Mixin base class for visitors that only need a dynamic TreePath during traversal.
Definition visitor.hh:426
static const TreePathType::Type treePathType
Use the dynamic tree traversal algorithm.
Definition visitor.hh:428
Convenience base class for visiting the entire tree.
Definition visitor.hh:435
Convenience base class for visiting the direct children of a node.
Definition visitor.hh:441
Convenience base class for visiting an entire tree pair.
Definition visitor.hh:447
Convenience base class for visiting the direct children of a node pair.
Definition visitor.hh:453
Definition visitor.hh:461
auto leaf(Tree &&, TreePath, U u) const
Definition visitor.hh:475
auto beforeChild(Tree &&, Child &&, TreePath, ChildIndex, U u) const
Definition visitor.hh:463
std::size_t beforeChild(Tree &&, Child &&, TreePath, std::size_t, U u) const
Definition visitor.hh:469
Definition visitor.hh:484
auto pre(Tree &&, TreePath, U u) const
Definition visitor.hh:486
Definition visitor.hh:495
auto leaf(Tree &&, TreePath, U u) const
Definition visitor.hh:497
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,161 +1,481 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-pairtraversal.hh\n+visitor.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// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n PDELab-exception\n 5\n-6#ifndef DUNE_TYPETREE_PAIRTRAVERSAL_HH\n-7#define DUNE_TYPETREE_PAIRTRAVERSAL_HH\n+6#ifndef DUNE_TYPETREE_VISITOR_HH\n+7#define DUNE_TYPETREE_VISITOR_HH\n 8\n-9#include \n \n+ \n
\n \n Classes |\n Namespaces
\n- filteredcompositenode.hh File Reference
powernode.hh File Reference
\n-
\n-
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n
\n-
\n+
\n+
\n+
\n+
\n+
\n\n \n
\n
#include <memory>\n-
#include <tuple>\n+
#include <cassert>\n+
#include <array>\n+
#include <memory>\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/indices.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
Go to the source code of this file.
\n\n Classes | |
| class | Dune::TypeTree::FilteredCompositeNode< Node, Filter > |
| Base class for composite nodes representing a filtered view on an underlying composite node. More... | |
| class | Dune::TypeTree::PowerNode< T, k > |
| Collect k instances of type T within a dune-typetree. More... | |
| struct | Dune::TypeTree::FilteredCompositeNode< Node, Filter >::Child< k > |
| Access to the type and storage type of the i-th child. More... | |
| struct | Dune::TypeTree::PowerNode< T, k >::Child< i > |
| 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,39 +1,49 @@\n dune-typetree\u00a02.10\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\n-transformation.hh File Reference\n-#include \n- \n+ \n
\n transformation.hh
proxynode.hh
\n Go to the documentation of this file.
\n Generated by 1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,634 +1,446 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-transformation.hh\n+proxynode.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// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n PDELab-exception\n 5\n-6#ifndef DUNE_TYPETREE_TRANSFORMATION_HH\n-7#define DUNE_TYPETREE_TRANSFORMATION_HH\n+6#ifndef DUNE_TYPETREE_PROXYNODE_HH\n+7#define DUNE_TYPETREE_PROXYNODE_HH\n 8\n-9#include \n-10#include \n-11#include \n-12#include \n-13\n-14#include \n-15#include \n-16#include \n-17#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\ba_\bi_\bt_\bs_\b._\bh_\bh>\n-18#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bh>\n-19#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bt_\ba_\bg_\bs_\b._\bh_\bh>\n-20#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-21\n-22\n-23namespace _\bD_\bu_\bn_\be {\n-24 namespace TypeTree {\n-25\n-31#ifdef DOXYGEN\n-32\n-34\n-53 template\n-_\b5_\b4 void _\br_\be_\bg_\bi_\bs_\bt_\be_\br_\bN_\bo_\bd_\be_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn(SourceNode*, Transformation*, Tag*);\n+9#include \n+10#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bi_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b._\bh_\bh>\n+11#include <_\bd_\bu_\bn_\be_\b/_\bt_\by_\bp_\be_\bt_\br_\be_\be_\b/_\bn_\bo_\bd_\be_\bt_\ba_\bg_\bs_\b._\bh_\bh>\n+12#include \n+13#include \n+14#include \n+15\n+16namespace _\bD_\bu_\bn_\be {\n+17 namespace TypeTree {\n+18\n+24 template\n+25 class ProxyNode;\n+26\n+28 template\n+_\b2_\b9 class _\bS_\bt_\ba_\bt_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs\n+30 {\n+31\n+32 static const bool proxiedNodeIsConst = std::is_const::type>::value;\n+33\n+34 template\n+35 struct lazy_enabled\n+36 {\n+37 static const bool value = !proxiedNodeIsConst;\n+38 };\n+39\n+40 typedef _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\b<_\bP_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be_\b> _\bN_\bo_\bd_\be;\n+41\n+42 template\n+43 typename std::enable_if::type\n+44 node ()\n+45 {\n+46 return static_cast<_\bN_\bo_\bd_\be&>(*this);\n+47 }\n+48\n+49 const _\bN_\bo_\bd_\be& node () const\n+50 {\n+51 return static_cast(*this);\n+52 }\n+53\n+54 public:\n 55\n-56#else // DOXYGEN\n-57\n-68 template\n-69 struct LookupNodeTransformation\n-70 {\n-71\n-72 typedef decltype(_\br_\be_\bg_\bi_\bs_\bt_\be_\br_\bN_\bo_\bd_\be_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn(declptr(),declptr\n-(),declptr())) lookup_type;\n-73\n-74 typedef typename _\be_\bv_\ba_\bl_\bu_\ba_\bt_\be_\b__\bi_\bf_\b__\bm_\be_\bt_\ba_\b__\bf_\bu_\bn_\bc_\bt_\bi_\bo_\bn<\n-75 lookup_type\n-76 >::type type;\n+57 template\n+_\b5_\b8 struct _\bC_\bh_\bi_\bl_\bd\n+59 : public ProxiedNode::template _\bC_\bh_\bi_\bl_\bd\n+60 {};\n+61\n+64\n+66\n+69 template::value, int>::type = 0>\n+_\b7_\b1 auto& _\bc_\bh_\bi_\bl_\bd (index_constant = {})\n+72 {\n+73 return node().proxiedNode().template child();\n+74 }\n+75\n 77\n-78 static_assert((!std::is_same::value), \"Unable to find valid\n-transformation descriptor\");\n-79 };\n-80\n-81#endif // DOXYGEN\n-82\n-83\n+80 template\n+_\b8_\b1 const auto& _\bc_\bh_\bi_\bl_\bd (index_constant = {}) const\n+82 {\n+83 return node().proxiedNode().template child();\n+84 }\n 85\n-94 template\n-_\b9_\b5 struct _\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be\n-96 {\n-97\n-98#ifndef DOXYGEN\n-99\n-100 typedef typename\n-LookupNodeTransformation::type NodeTransformation;\n-101\n-102 // the type of the new tree that will result from this transformation\n-103 typedef typename\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>::transformed_type transformed_type;\n-104\n-105 // the storage type of the new tree that will result from this\n-transformation\n-106 typedef typename\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>::transformed_storage_type transformed_storage_type;\n-107\n-108#endif // DOXYGEN\n+87\n+90 template::value, int>::type = 0>\n+_\b9_\b2 auto _\bc_\bh_\bi_\bl_\bd_\bS_\bt_\bo_\br_\ba_\bg_\be (index_constant = {})\n+93 {\n+94 return node().proxiedNode().template childStorage();\n+95 }\n+96\n+98\n+104 template\n+_\b1_\b0_\b5 auto _\bc_\bh_\bi_\bl_\bd_\bS_\bt_\bo_\br_\ba_\bg_\be (index_constant = {}) const\n+106 {\n+107 return node().proxiedNode().template childStorage();\n+108 }\n 109\n-_\b1_\b1_\b1 typedef transformed_type _\bt_\by_\bp_\be;\n-112\n-_\b1_\b1_\b3 typedef _\bt_\by_\bp_\be _\bT_\by_\bp_\be;\n-114\n-_\b1_\b1_\b6 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(const SourceTree& s, const\n-Transformation& t = Transformation())\n-117 {\n-118 return\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(s,t);\n-119 }\n-120\n-_\b1_\b2_\b2 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(const SourceTree& s, Transformation& t)\n-123 {\n-124 return\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(s,t);\n-125 }\n-126\n-_\b1_\b2_\b8 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(std::shared_ptr sp,\n-const Transformation& t = Transformation())\n-129 {\n-130 return\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(sp,t);\n-131 }\n-132\n-_\b1_\b3_\b4 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(std::shared_ptr sp,\n-Transformation& t)\n-135 {\n-136 return\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(sp,t);\n-137 }\n+111 template\n+_\b1_\b1_\b2 void _\bs_\be_\bt_\bC_\bh_\bi_\bl_\bd (ProxyChild&& _\bc_\bh_\bi_\bl_\bd, typename std::\n+enable_if::value,void*>::type = 0)\n+113 {\n+114 node().proxiedNode().template setChild(std::forward(_\bc_\bh_\bi_\bl_\bd));\n+115 }\n+116\n+_\b1_\b1_\b7 const typename ProxiedNode::NodeStorage& _\bn_\bo_\bd_\be_\bS_\bt_\bo_\br_\ba_\bg_\be () const\n+118 {\n+119 return node().proxiedNode().nodeStorage();\n+120 }\n+121\n+122 };\n+123\n+125\n+130 template\n+_\b1_\b3_\b1 class _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs\n+132 : public _\bS_\bt_\ba_\bt_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs\n+133 {\n+134\n+135 typedef _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\b<_\bP_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be_\b> _\bN_\bo_\bd_\be;\n+136\n+137 static const bool proxiedNodeIsConst = std::is_const::type>::value;\n 138\n-_\b1_\b4_\b1 static transformed_storage_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\b__\bs_\bt_\bo_\br_\ba_\bg_\be(std::shared_ptr sp, const Transformation& t = Transformation())\n+139 template\n+140 typename std::enable_if::type\n+141 node ()\n 142 {\n-143 return\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\b__\bs_\bt_\bo_\br_\ba_\bg_\be(sp,t);\n+143 return static_cast<_\bN_\bo_\bd_\be&>(*this);\n 144 }\n 145\n-_\b1_\b4_\b8 static transformed_storage_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\b__\bs_\bt_\bo_\br_\ba_\bg_\be(std::shared_ptr sp, Transformation& t)\n-149 {\n-150 return\n-_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bT_\br_\be_\be_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b,_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\ba_\bt_\bi_\bo_\bn_\b,_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bS_\bo_\bu_\br_\bc_\be_\bT_\br_\be_\be_\b>,NodeTransformation::\n-recursive>_\b:_\b:_\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\b__\bs_\bt_\bo_\br_\ba_\bg_\be(sp,t);\n-151 }\n+146 const _\bN_\bo_\bd_\be& node () const\n+147 {\n+148 return static_cast(*this);\n+149 }\n+150\n+151 public:\n 152\n-153\n-154 };\n 155\n-156#ifndef DOXYGEN // internal per-node implementations of the transformation\n-algorithm\n 157\n-158 // handle a leaf node - this is easy\n-159 template\n-160 struct TransformTree\n-161 {\n-162 // get transformed type from specification\n-163 typedef typename LookupNodeTransformation>_\b:_\b:_\bt_\by_\bp_\be\n-NodeTransformation;\n-164\n-165 typedef typename NodeTransformation::transformed_type transformed_type;\n-166 typedef typename NodeTransformation::transformed_storage_type\n-transformed_storage_type;\n-167\n-168 // delegate instance transformation to per-node specification\n-169 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(const S& s, T& t)\n-170 {\n-171 return NodeTransformation::transform(s,t);\n-172 }\n-173\n-174 // delegate instance transformation to per-node specification\n-175 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(const S& s, const T& t)\n-176 {\n-177 return NodeTransformation::transform(s,t);\n-178 }\n-179\n-180 // delegate instance transformation to per-node specification\n-181 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(std::shared_ptr sp, T& t)\n-182 {\n-183 return NodeTransformation::transform(sp,t);\n-184 }\n-185\n-186 // delegate instance transformation to per-node specification\n-187 static transformed_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm(std::shared_ptr sp, const T& t)\n-188 {\n-189 return NodeTransformation::transform(sp,t);\n-190 }\n-191\n-192 static transformed_storage_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\b__\bs_\bt_\bo_\br_\ba_\bg_\be(std::shared_ptr\n-sp, T& t)\n-193 {\n-194 return NodeTransformation::transform_storage(sp,t);\n-195 }\n-196\n-197 static transformed_storage_type _\bt_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\b__\bs_\bt_\bo_\br_\ba_\bg_\be(std::shared_ptr\n-sp, const T& t)\n-198 {\n-199 return NodeTransformation::transform_storage(sp,t);\n-200 }\n-201\n-202 };\n-203\n-204\n-205 // common implementation for non-recursive transformation of non-leaf nodes\n-206 template\n-207 struct TransformTreeNonRecursive\n-208 {\n-209 // get transformed type from specification\n-210 typedef typename LookupNodeTransformation>::type\n-NodeTransformation;\n+160 template::type = 0>\n+_\b1_\b6_\b2 auto& _\bc_\bh_\bi_\bl_\bd (std::size_t i)\n+163 {\n+164 return node().proxiedNode().child(i);\n+165 }\n+166\n+168\n+_\b1_\b7_\b1 const auto& _\bc_\bh_\bi_\bl_\bd (std::size_t i) const\n+172 {\n+173 return node().proxiedNode().child(i);\n+174 }\n+175\n+177\n+180 template::type = 0>\n+_\b1_\b8_\b2 auto _\bc_\bh_\bi_\bl_\bd_\bS_\bt_\bo_\br_\ba_\bg_\be (std::size_t i)\n+183 {\n+184 return node().proxiedNode().childStorage(i);\n+185 }\n+186\n+188\n+_\b1_\b9_\b4 auto _\bc_\bh_\bi_\bl_\bd_\bS_\bt_\bo_\br_\ba_\bg_\be (std::size_t i) const\n+195 {\n+196 return node().proxiedNode().childStorage(i);\n+197 }\n+198\n+200 template\n+_\b2_\b0_\b1 void _\bs_\be_\bt_\bC_\bh_\bi_\bl_\bd (std::size_t i, ProxyChild&& _\bc_\bh_\bi_\bl_\bd, typename std::\n+enable_if::type = 0)\n+202 {\n+203 node().proxiedNode().setChild(i, std::forward(_\bc_\bh_\bi_\bl_\bd));\n+204 }\n+205\n+206 };\n+207\n+209 template\n+_\b2_\b1_\b0 struct _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\bB_\ba_\bs_\be;\n 211\n-212 typedef typename NodeTransformation::transformed_type transformed_type;\n-213 typedef typename NodeTransformation::transformed_storage_type\n-transformed_storage_type;\n-214\n-215 // delegate instance transformation to per-node specification\n-216 static transformed_type transform(const S& s, T& t)\n-217 {\n-218 return NodeTransformation::transform(s,t);\n-219 }\n-220\n-221 // delegate instance transformation to per-node specification\n-222 static transformed_type transform(const S& s, const T& t)\n-223 {\n-224 return NodeTransformation::transform(s,t);\n-225 }\n+213 template\n+_\b2_\b1_\b4 struct _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\bB_\ba_\bs_\be\n+215 {\n+216 };\n+217\n+219 template\n+_\b2_\b2_\b0 struct _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\bB_\ba_\bs_\be<_\bN_\bo_\bd_\be,_\bC_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\be_\bN_\bo_\bd_\be_\bT_\ba_\bg>\n+221 : public _\bS_\bt_\ba_\bt_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs\n+222 {\n+_\b2_\b2_\b3 typedef typename Node::ChildTypes _\bC_\bh_\bi_\bl_\bd_\bT_\by_\bp_\be_\bs;\n+_\b2_\b2_\b4 typedef typename Node::NodeStorage _\bN_\bo_\bd_\be_\bS_\bt_\bo_\br_\ba_\bg_\be;\n+225 };\n 226\n-227 // delegate instance transformation to per-node specification\n-228 static transformed_type transform(std::shared_ptr sp, T& t)\n-229 {\n-230 return NodeTransformation::transform(sp,t);\n-231 }\n-232\n-233 // delegate instance transformation to per-node specification\n-234 static transformed_type transform(std::shared_ptr sp, const T& t)\n-235 {\n-236 return NodeTransformation::transform(sp,t);\n-237 }\n-238\n-239 static transformed_storage_type transform_storage(std::shared_ptr\n-sp, T& t)\n+228 template\n+_\b2_\b2_\b9 struct _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\bB_\ba_\bs_\be<_\bN_\bo_\bd_\be,_\bP_\bo_\bw_\be_\br_\bN_\bo_\bd_\be_\bT_\ba_\bg>\n+230 : public _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs\n+231 {\n+_\b2_\b3_\b2 typedef typename Node::ChildType _\bC_\bh_\bi_\bl_\bd_\bT_\by_\bp_\be;\n+_\b2_\b3_\b3 typedef typename Node::NodeStorage _\bN_\bo_\bd_\be_\bS_\bt_\bo_\br_\ba_\bg_\be;\n+234 };\n+235\n+237 template\n+_\b2_\b3_\b8 struct _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\bB_\ba_\bs_\be<_\bN_\bo_\bd_\be,_\bD_\by_\bn_\ba_\bm_\bi_\bc_\bP_\bo_\bw_\be_\br_\bN_\bo_\bd_\be_\bT_\ba_\bg>\n+239 : public _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs\n 240 {\n-241 return NodeTransformation::transform_storage(sp,t);\n-242 }\n-243\n-244 static transformed_storage_type transform_storage(std::shared_ptr\n-sp, const T& t)\n-245 {\n-246 return NodeTransformation::transform_storage(sp,t);\n-247 }\n-248\n-249 };\n-250\n-251\n-252 namespace Impl {\n-253\n-254 // Helper class to handle recursive power nodes\n-255 template\n-256 class RecursivePowerTransformTree\n-257 {\n-258 // We only know two types of tags!\n-259 static_assert(std::is_same_v or std::\n-is_same_v);\n+_\b2_\b4_\b1 typedef typename Node::ChildType _\bC_\bh_\bi_\bl_\bd_\bT_\by_\bp_\be;\n+_\b2_\b4_\b2 typedef typename Node::NodeStorage _\bN_\bo_\bd_\be_\bS_\bt_\bo_\br_\ba_\bg_\be;\n+243 };\n+244\n+246\n+252 template\n+_\b2_\b5_\b3 class _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be\n+254 : public _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be_\bB_\ba_\bs_\be>\n+255 {\n+256 static const bool proxiedNodeIsConst = std::is_const::type>::value;\n+257\n+258 template \n+259 using HasStaticDegree = index_constant;\n 260\n-261 using ChildType = typename Source::ChildType;\n-262\n-263 // in case degree is dynamic, provid a vector correctly initialized\n-264 template\n-265 static auto node_storage_provider(const std::size_t& degree)\n-266 {\n-267 return std::vector(degree);\n-268 }\n+261 template \n+_\b2_\b6_\b2 static constexpr bool hasStaticDegree = Std::is_detected::value;\n+263\n+264 // accessor mixins need to be friends for access to proxiedNode()\n+265 friend class _\bS_\bt_\ba_\bt_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs;\n+266 friend class _\bD_\by_\bn_\ba_\bm_\bi_\bc_\bC_\bh_\bi_\bl_\bd_\bA_\bc_\bc_\be_\bs_\bs_\bo_\br_\bs;\n+267\n+268 public:\n 269\n-270 // in case degree is static, provid an array\n-271 template\n-272 static auto node_storage_provider(StaticIndex)\n-273 {\n-274 return std::array();\n-275 }\n+_\b2_\b7_\b0 typedef Node _\bP_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be;\n+271\n+_\b2_\b7_\b2 typedef _\bD_\bu_\bn_\be_\b:_\b:_\bT_\by_\bp_\be_\bT_\br_\be_\be_\b:_\b:_\bN_\bo_\bd_\be_\bT_\ba_\bg_\b<_\bN_\bo_\bd_\be_\b> _\bN_\bo_\bd_\be_\bT_\ba_\bg;\n+273\n+_\b2_\b7_\b5 static const bool _\bi_\bs_\bL_\be_\ba_\bf = Node::isLeaf;\n 276\n-277 public:\n-278 // get transformed type from specification\n-279 // Handling this transformation in a way that makes the per-node\n-specification easy to write\n-280 // is a little involved:\n-281 // The problem is that the transformed power node must be parameterized on\n-the transformed child\n-282 // type. So we need to transform the child type and pass the transformed\n-child type to an inner\n-283 // template of the node transformation struct called result (see example of\n-such a specification\n-284 // further down).\n-285 using NodeTransformation = typename\n-LookupNodeTransformation>::\n-type;\n-286 using ChildNodeTransformation = typename\n-LookupNodeTransformation>::\n-type;\n-287\n-288 private:\n-289 // Since every child is same type, is enough to get transformation once\n-290 using ChildTreeTransformation = TransformTree,\n-293 ChildNodeTransformation::recursive>;\n-294\n-295 // Get transformed type of children\n-296 using transformed_child_type = typename ChildTreeTransformation::\n-transformed_type;\n-297 using transformed_child_storage_type = typename ChildTreeTransformation::\n-transformed_storage_type;\n-298 public:\n-299 // Apply transformation from children to current node\n-300 using transformed_type = typename NodeTransformation::template\n-result::type;\n-301 using transformed_storage_type = typename NodeTransformation::template\n-result::storage_type;\n+_\b2_\b7_\b8 static const bool _\bi_\bs_\bP_\bo_\bw_\be_\br = Node::isPower;\n+279\n+_\b2_\b8_\b1 static const bool _\bi_\bs_\bC_\bo_\bm_\bp_\bo_\bs_\bi_\bt_\be = Node::isComposite;\n+282\n+283 template , int> = 0>\n+_\b2_\b8_\b5 static constexpr auto _\bd_\be_\bg_\br_\be_\be ()\n+286 {\n+287 return N::degree();\n+288 }\n+289\n+290 template , int> = 0>\n+_\b2_\b9_\b2 auto _\bd_\be_\bg_\br_\be_\be () const\n+293 {\n+294 return _\bp_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be().degree();\n+295 }\n+296\n+297\n+298 protected:\n+299\n 302\n-303 // Transform an instance of source tree.\n-304 static transformed_type transform(const Source& source, Transformation&\n-transformation)\n-305 {\n-306 auto children_storage = node_storage_provider>(source.degree());\n-307 for (std::size_t k = 0; k < source.degree(); ++k) {\n-308 children_storage[k] = ChildTreeTransformation::transform_storage\n-(source.childStorage(k),transformation);\n+304 template\n+305 typename std::enable_if::type\n+_\b3_\b0_\b6 _\bp_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be ()\n+307 {\n+308 return *_node;\n 309 }\n-310 return NodeTransformation::transform\n-(source,transformation,children_storage);\n-311 }\n-312\n-313 // Transform an instance of source tree.\n-314 static transformed_type transform(const Source& source, const\n-Transformation& transformation)\n-315 {\n-316 auto children_storage = node_storage_provider>(source.degree());\n-317 for (std::size_t k = 0; k < source.degree(); ++k) {\n-318 children_storage[k] = ChildTreeTransformation::transform_storage\n-(source.childStorage(k),transformation);\n-319 }\n-320 return NodeTransformation::transform\n-(source,transformation,children_storage);\n-321 }\n-322\n-323 // Transform an instance of source tree.\n-324 static transformed_type transform(std::shared_ptr source_ptr,\n-Transformation& transformation)\n-325 {\n-326 auto children_storage = node_storage_provider>(source_ptr->degree());\n-327 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {\n-328 children_storage[k] = ChildTreeTransformation::transform_storage\n-(source_ptr->childStorage(k),transformation);\n+310\n+_\b3_\b1_\b2 const Node& _\bp_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be () const\n+313 {\n+314 return *_node;\n+315 }\n+316\n+318 template\n+319 typename std::enable_if >::type\n+_\b3_\b2_\b0 _\bp_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be_\bS_\bt_\bo_\br_\ba_\bg_\be ()\n+321 {\n+322 return _node;\n+323 }\n+324\n+_\b3_\b2_\b6 std::shared_ptr _\bp_\br_\bo_\bx_\bi_\be_\bd_\bN_\bo_\bd_\be_\bS_\bt_\bo_\br_\ba_\bg_\be () const\n+327 {\n+328 return _node;\n 329 }\n-330 return NodeTransformation::transform\n-(source_ptr,transformation,children_storage);\n-331 }\n+330\n 332\n-333 // Transform an instance of source tree.\n-334 static transformed_type transform(std::shared_ptr source_ptr,\n-const Transformation& transformation)\n-335 {\n-336 auto children_storage = node_storage_provider>(source_ptr->degree());\n-337 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {\n-338 children_storage[k] = ChildTreeTransformation::transform_storage\n-(source_ptr->childStorage(k),transformation);\n-339 }\n-340 return NodeTransformation::transform\n-(source_ptr,transformation,children_storage);\n-341 }\n-342\n-343 // Transform an instance of source tree ptr.\n-344 static transformed_storage_type transform_storage(std::shared_ptr source_ptr, Transformation& transformation)\n-345 {\n-346 auto children_storage =\n-node_storage_provider(source_ptr->degree());\n-347 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {\n-348 children_storage[k] = ChildTreeTransformation::transform_storage\n-(source_ptr->childStorage(k),transformation);\n-349 }\n-350 return NodeTransformation::transform_storage\n-(source_ptr,transformation,children_storage);\n-351 }\n+335\n+_\b3_\b3_\b6 _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be (Node& node)\n+337 : _node(stackobject_to_shared_ptr(node))\n+338 {}\n+339\n+_\b3_\b4_\b0 _\bP_\br_\bo_\bx_\by_\bN_\bo_\bd_\be (std::shared_ptr node)\n+341 : _node(std::move(node))\n+342 {}\n+343\n+345\n+346 private:\n+347\n+348 std::shared_ptr _node;\n+349 };\n+350\n 352\n-353 // Transform an instance of source tree ptr.\n-354 static transformed_storage_type transform_storage(std::shared_ptr source_ptr, const Transformation& transformation)\n-355 {\n-356 auto children_storage =\n-node_storage_provider(source_ptr->degree());\n-357 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {\n-358 children_storage[k] = ChildTreeTransformation::transform_storage\n-(source_ptr->childStorage(k),transformation);\n-359 }\n-360 return NodeTransformation::transform_storage\n-(source_ptr,transformation,children_storage);\n-361 }\n-362\n-363 };\n-364 } // namespace Impl\n-365\n-366 // Recursive version of the PowerNode transformation for static nodes.\n-367 template\n-368 struct TransformTree\n-369 : public Impl::\n-RecursivePowerTransformTree\n-370 {};\n-371\n-372 // Recursive version of the DynamicPowerNode transformation for static\n-nodes.\n-373 template\n-374 struct TransformTree\n-375 : public Impl::\n-RecursivePowerTransformTree\n-376 {};\n-377\n-378 // non-recursive version of the PowerNode transformation.\n-379 template\n-380 struct TransformTree\n-381 : public TransformTreeNonRecursive
\n \n
\n \n 3// SPDX-FileCopyrightInfo: Copyright \u00a9 DUNE Project contributors, see file LICENSE.md in module root
\n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n
32 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- 72 typedef decltype(registerNodeTransformation(declptr<S>(),declptr<T>(),declptr<Tag>())) lookup_type;
\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n \n- 78 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- 94 template<typename SourceTree, typename Transformation, typename Tag = StartTag, bool recursive = true>
\n-\n-\n-\n-\n-\n-\n-
\n+\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+ 100 typedef typename LookupNodeTransformation<SourceTree,Transformation,typename SourceTree::ImplementationTag>::type NodeTransformation;
\n-\n-\n- 103 typedef typename TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transformed_type transformed_type;
\n-\n-\n- 106 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- 116 static transformed_type transform(const SourceTree& s, const Transformation& t = Transformation())
\n-\n- 118 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(s,t);
\n-\n-\n-\n-\n-
\n-\n- 124 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(s,t);
\n-\n-\n-
\n-\n- 128 static transformed_type transform(std::shared_ptr<const SourceTree> sp, const Transformation& t = Transformation())
\n-\n- 130 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(sp,t);
\n-\n-\n-\n-\n-
\n+\n+\n+\n+ 136 return TransformTree<SourceTree,Transformation,NodeTag<SourceTree>,NodeTransformation::recursive>::transform(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-\n-\n-\n-\n+\n+\n+ 137 static const bool proxiedNodeIsConst = std::is_const<typename std::remove_reference<ProxiedNode>::type>::value;
\n \n-\n-
\n \n- 141 static transformed_storage_type transform_storage(std::shared_ptr<const SourceTree> sp, const Transformation& t = Transformation())
\n+\n+\n+\n \n- 143 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- 148 static transformed_storage_type transform_storage(std::shared_ptr<const SourceTree> sp, Transformation& t)
\n-\n- 150 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+\n+\n+
\n+\n+\n+\n+\n+\n+\n+\n+
\n+\n \n-\n- 256 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- 281 // The problem is that the transformed power node must be parameterized on the transformed child
\n-\n- 283 // template of the node transformation struct called result (see example of such a specification
\n-\n- 285 using NodeTransformation = typename LookupNodeTransformation<Source,Transformation,ImplementationTag<Source>>::type;
\n- 286 using ChildNodeTransformation = typename LookupNodeTransformation<ChildType,Transformation,ImplementationTag<ChildType>>::type;
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n- 297 using transformed_child_storage_type = typename ChildTreeTransformation::transformed_storage_type;
\n-\n-\n- 300 using transformed_type = typename NodeTransformation::template result<transformed_child_type>::type;
\n- 301 using transformed_storage_type = typename NodeTransformation::template result<transformed_child_type>::storage_type;
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n-\n-\n-\n- 306 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n-\n- 308 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n-\n-\n-\n-\n-\n-\n-\n- 316 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n-\n- 318 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n-\n-\n-\n-\n-\n- 324 static transformed_type transform(std::shared_ptr<const Source> source_ptr, Transformation& transformation)
\n-\n- 326 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source_ptr->degree());
\n-\n- 328 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- 334 static transformed_type transform(std::shared_ptr<const Source> source_ptr, const Transformation& transformation)
\n-\n- 336 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source_ptr->degree());
\n-\n- 338 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-\n-\n-\n-\n-\n- 344 static transformed_storage_type transform_storage(std::shared_ptr<const Source> source_ptr, Transformation& transformation)
\n-\n- 346 auto children_storage = node_storage_provider<transformed_child_storage_type>(source_ptr->degree());
\n-\n-\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+ 354 static transformed_storage_type transform_storage(std::shared_ptr<const Source> source_ptr, const Transformation& transformation)
\n-\n- 356 auto children_storage = node_storage_provider<transformed_child_storage_type>(source_ptr->degree());
\n-\n- 358 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- 390 // helper struct that does the actual transformation for a composite node. We need this additional struct
\n- 391 // to extract the template argument list with the types of all children from the node, which we cannot do
\n- 392 // directly in the transformation<> template, as the type passed to transformation<> will usually be a
\n- 393 // derived type and will normally have more template arguments than just the children. This declaration
\n- 394 // just introduces the type of the helper struct, we always instantiate the specialization defined below;
\n-\n-\n-\n- 398 // specialized version of the helper struct which extracts the template argument list with the children from
\n- 399 // its second template parameter, which has to be CompositeNode::ChildTypes. Apart from that, the struct is
\n- 400 // 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- 448 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- 453 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp, Trafo&& t, std::index_sequence<i...> indices)
\n-\n-\n- 456 Dune::Hybrid::Impl::evaluateFoldExpression<int>({(setElement<i>(storage, ChildTransformation<i>::transform_storage(sp->template childStorage<i>(), std::forward<Trafo>(t))),0)...});
\n- 457 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- 480 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.
typename std::decay_t< Node >::NodeTag NodeTag
Returns the node tag of the given Node.
Definition nodeinterface.hh:70
Definition accumulate_static.hh:16
static transformed_type transform(std::shared_ptr< const SourceTree > sp, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:134
static transformed_type transform(std::shared_ptr< const SourceTree > sp, const Transformation &t=Transformation())
Apply transformation to an existing tree s.
Definition transformation.hh:128
static transformed_type transform(const SourceTree &s, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:122
transformed_type type
The type of the transformed tree.
Definition transformation.hh:111
static transformed_type transform(const SourceTree &s, const Transformation &t=Transformation())
Apply transformation to an existing tree s.
Definition transformation.hh:116
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, const Transformation &t=Transformation())
Definition transformation.hh:141
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, Transformation &t)
Definition transformation.hh:148
Meta function that evaluates its argument iff it inherits from meta_function.
Definition typetraits.hh:142
Tag designating a power node with runtime degree.
Definition nodetags.hh:24
Base class for nodes acting as a proxy for an existing node.
Definition proxynode.hh:255
Dune::TypeTree::NodeTag< Node > NodeTag
Definition proxynode.hh:272
static const bool isComposite
Mark this class as a composite in the dune-typetree.
Definition proxynode.hh:281
static const bool isLeaf
Mark this class as non leaf in the dune-typetree.
Definition proxynode.hh:275
static const bool isPower
Mark this class as a non power in the dune-typetree.
Definition proxynode.hh:278
std::enable_if< enabled, Node & >::type proxiedNode()
Returns the proxied node.
Definition proxynode.hh:306
std::shared_ptr< const Node > proxiedNodeStorage() const
Returns the storage of the proxied node (const version).
Definition proxynode.hh:326
std::enable_if< enabled, std::shared_ptr< Node > >::type proxiedNodeStorage()
Returns the storage of the proxied node.
Definition proxynode.hh:320
ProxyNode(std::shared_ptr< Node > node)
Definition proxynode.hh:340
const Node & proxiedNode() const
Returns the proxied node (const version).
Definition proxynode.hh:312
Mixin class providing methods for child access with compile-time parameter.
Definition proxynode.hh:30
auto & child(index_constant< k >={})
Returns the i-th child.
Definition proxynode.hh:71
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:112
const ProxiedNode::NodeStorage & nodeStorage() const
Definition proxynode.hh:117
auto childStorage(index_constant< k >={})
Returns the storage of the i-th child.
Definition proxynode.hh:92
const auto & child(index_constant< k >={}) const
Returns the i-th child (const version).
Definition proxynode.hh:81
auto childStorage(index_constant< k >={}) const
Returns the storage of the i-th child (const version).
Definition proxynode.hh:105
Access to the type and storage type of the i-th child.
Definition proxynode.hh:60
Mixin class providing methods for child access with run-time parameter.
Definition proxynode.hh:133
auto & child(std::size_t i)
Returns the i-th child.
Definition proxynode.hh:162
auto childStorage(std::size_t i) const
Returns the storage of the i-th child (const version).
Definition proxynode.hh:194
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:201
const auto & child(std::size_t i) const
Returns the i-th child (const version).
Definition proxynode.hh:171
auto childStorage(std::size_t i)
Returns the storage of the i-th child.
Definition proxynode.hh:182
Tag-based dispatch to appropriate base class that provides necessary functionality.
Definition proxynode.hh:210
Node::NodeStorage NodeStorage
Definition proxynode.hh:224
Node::ChildTypes ChildTypes
Definition proxynode.hh:223
Node::NodeStorage NodeStorage
Definition proxynode.hh:233
Node::ChildType ChildType
Definition proxynode.hh:232
Node::NodeStorage NodeStorage
Definition proxynode.hh:242
Node::ChildType ChildType
Definition proxynode.hh:241
\n Generated by
1.9.8\n \n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,634 +1,446 @@\n dune-typetree\u00a02.10\n Loading...\n Searching...\n No Matches\n * _\bd_\bu_\bn_\be\n * _\bt_\by_\bp_\be_\bt_\br_\be_\be\n-transformation.hh\n+proxynode.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// SPDX-FileCopyrightInfo: Copyright \u00c2\u00a9 DUNE Project contributors, see file\n LICENSE.md in module root\n 4// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-GPL-2.0-only-with-\n PDELab-exception\n 5\n-6#ifndef DUNE_TYPETREE_TRANSFORMATION_HH\n-7#define DUNE_TYPETREE_TRANSFORMATION_HH\n+6#ifndef DUNE_TYPETREE_PROXYNODE_HH\n+7#define DUNE_TYPETREE_PROXYNODE_HH\n 8\n-9#include