\n
\n
\n-
4#ifndef DUNE_TYPETREE_TRANSFORMATION_HH \n-
5#define DUNE_TYPETREE_TRANSFORMATION_HH \n+
4#ifndef DUNE_TYPETREE_UTILITY_HH \n+
5#define DUNE_TYPETREE_UTILITY_HH \n
\n-
\n+
\n
\n-
\n+
\n
\n-
\n-
12#include <dune/common/hybridutilities.hh> \n-
13#include <dune/common/exceptions.hh> \n-
14#include <dune/common/typetraits.hh> \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
51 template<
typename SourceNode,
typename Transformation,
typename Tag>
\n-
\n-
\n-
\n+
\n+
\n+
13#include <dune/common/shared_ptr.hh> \n+
14#include <dune/common/indices.hh> \n+
15#include <dune/common/hybridutilities.hh> \n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
29 std::shared_ptr<T> convert_arg(
const T& t)
\n+
\n+
31 return std::make_shared<T>(t);
\n+
\n+
\n+
\n+
35 std::shared_ptr<T> convert_arg(T& t)
\n+
\n+
37 return stackobject_to_shared_ptr(t);
\n+
\n+
\n+
40 template<
typename BaseType,
typename T>
\n+
41 T& assertGridViewType(T& t)
\n+
\n+
43 static_assert((std::is_same<
typename BaseType::Traits::GridViewType,
\n+
44 typename T::Traits::GridViewType>::value),
\n+
45 "GridViewType must be equal in all components of composite type");
\n+
\n+
\n+
\n+
\n+
\n+
51 typename std::enable_if<!std::is_lvalue_reference<T>::value,std::shared_ptr<T> >::type convert_arg(T&& t)
\n+
\n+
53 return std::make_shared<T>(std::forward<T>(t));
\n+
\n
\n-
66 template<
typename S,
typename T,
typename Tag>
\n-
67 struct LookupNodeTransformation
\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-
92 template<
typename SourceTree,
typename Transformation,
typename Tag = StartTag,
bool recursive = true>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
98 typedef typename LookupNodeTransformation<SourceTree,Transformation,typename SourceTree::ImplementationTag>::type NodeTransformation;
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
57 namespace Experimental {
\n+
\n+
67 template<
class BinaryOp,
class Arg>
\n+
68 constexpr decltype(
auto)
\n+
69 left_fold(BinaryOp&& binary_op, Arg&& arg)
\n+
\n+
71 return std::forward<Arg>(arg);
\n+
\n+
\n+
95 template<
class BinaryOp,
class Init,
class Arg0,
class... Args>
\n+
96 constexpr decltype(
auto)
\n+
97 left_fold(BinaryOp&& binary_op, Init&& init, Arg0&& arg_0, Args&&... args)
\n+
\n+
\n+
100 std::forward<BinaryOp>(binary_op),
\n+
101 binary_op(std::forward<Init>(init), std::forward<Arg0>(arg_0)),
\n+
102 std::forward<Args>(args)...);
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
114 static transformed_type
transform(
const SourceTree& s,
const Transformation& t = Transformation())
\n-
\n-
\n-
\n-
\n-
\n-
\n-
120 static transformed_type
transform(
const SourceTree& s, Transformation& t)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
126 static transformed_type
transform(std::shared_ptr<const SourceTree> sp,
const Transformation& t = Transformation())
\n-
\n-
\n-
\n-
\n-
\n-
\n-
132 static transformed_type
transform(std::shared_ptr<const SourceTree> sp, Transformation& t)
\n-
\n-
\n-
\n-
\n+
\n+
107 using namespace Dune::Hybrid;
\n+
\n+
\n+
110 template<
class Op,
class... Args>
\n+
111 constexpr auto applyOperator(Op&& op, Args&&... args)
\n+
\n+
113 using T = std::common_type_t<Args...>;
\n+
114 return op(
static_cast<T
>(args)...);
\n+
\n+
\n+
117 template<
class Op,
class T, T... Args>
\n+
118 constexpr auto applyOperator(Op, std::integral_constant<T,Args>...)
\n+
\n+
120 static_assert(std::is_default_constructible_v<Op>,
\n+
121 "Operator in integral expressions shall be default constructible");
\n+
122 constexpr auto result = Op{}(T{Args}...);
\n+
123 return std::integral_constant<std::decay_t<
decltype(
result)>,
result>{};
\n+
\n+
\n+
\n+
\n+
128 template<
class... Args>
\n+
129 constexpr auto operator()(Args&&... args)
const \n+
\n+
131 using T = std::common_type_t<Args...>;
\n+
132 return std::max({
static_cast<T
>(args)...});
\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-
\n-
\n-
\n-
\n-
146 static transformed_storage_type
transform_storage(std::shared_ptr<const SourceTree> sp, Transformation& t)
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
137 static constexpr auto max = [](
const auto& a,
const auto& b)
\n+
\n+
139 return Detail::applyOperator(Detail::Max{}, a, b);
\n+
\n+
\n+
142 static constexpr auto plus = [](
const auto& a,
const auto& b)
\n+
\n+
144 return Detail::applyOperator(std::plus<>{}, a, b);
\n+
\n+
\n+
147 static constexpr auto minus = [](
const auto& a,
const auto& b)
\n+
\n+
149 return Detail::applyOperator(std::minus<>{}, a, b);
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
157 template<
typename S,
typename T,
bool recursive>
\n-
158 struct TransformTree<S,T,LeafNodeTag,recursive>
\n-
\n-
\n-
161 typedef typename LookupNodeTransformation<S,T,ImplementationTag<S>>
::type NodeTransformation;
\n-
\n-
163 typedef typename NodeTransformation::transformed_type transformed_type;
\n-
164 typedef typename NodeTransformation::transformed_storage_type transformed_storage_type;
\n-
\n-
\n-
167 static transformed_type
transform(
const S& s, T& t)
\n-
\n-
169 return NodeTransformation::transform(s,t);
\n-
\n-
\n-
\n-
173 static transformed_type
transform(
const S& s,
const T& t)
\n-
\n-
175 return NodeTransformation::transform(s,t);
\n-
\n-
\n-
\n-
179 static transformed_type
transform(std::shared_ptr<const S> sp, T& t)
\n-
\n-
181 return NodeTransformation::transform(sp,t);
\n-
\n-
\n-
\n-
185 static transformed_type
transform(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
187 return NodeTransformation::transform(sp,t);
\n-
\n+
\n+
\n+
\n+
166 template<
typename Tree,
typename Tag = StartTag>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
190 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp, T& t)
\n-
\n-
192 return NodeTransformation::transform_storage(sp,t);
\n-
\n+
\n+
\n+
\n+
\n
\n-
195 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
197 return NodeTransformation::transform_storage(sp,t);
\n-
\n+
\n+
196 template<
typename Node>
\n+
\n+
\n
\n-
\n+
200 static const std::size_t
depth = 1;
\n
\n-
\n-
\n-
204 template<
typename S,
typename T>
\n-
205 struct TransformTreeNonRecursive
\n-
\n-
\n-
208 typedef typename LookupNodeTransformation<S,T,ImplementationTag<S>>::type NodeTransformation;
\n-
\n-
210 typedef typename NodeTransformation::transformed_type transformed_type;
\n-
211 typedef typename NodeTransformation::transformed_storage_type transformed_storage_type;
\n-
\n-
\n-
214 static transformed_type transform(
const S& s, T& t)
\n-
\n-
216 return NodeTransformation::transform(s,t);
\n-
\n-
\n-
\n-
220 static transformed_type transform(
const S& s,
const T& t)
\n-
\n-
222 return NodeTransformation::transform(s,t);
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
210 template<
typename Node>
\n+
211 struct TreeInfo<Node,PowerNodeTag>
\n+
\n+
\n+
214 typedef TreeInfo<typename Node::ChildType,NodeTag<typename Node::ChildType>> ChildInfo;
\n+
\n+
216 static const std::size_t
depth = 1 + ChildInfo::depth;
\n+
\n+
218 static const std::size_t
nodeCount = 1 + StaticDegree<Node>::value * ChildInfo::nodeCount;
\n+
\n+
220 static const std::size_t
leafCount = StaticDegree<Node>::value * ChildInfo::leafCount;
\n+
\n+
\n+
\n
\n-
\n-
226 static transformed_type transform(std::shared_ptr<const S> sp, T& t)
\n-
\n-
228 return NodeTransformation::transform(sp,t);
\n-
\n-
\n-
\n-
232 static transformed_type transform(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
234 return NodeTransformation::transform(sp,t);
\n-
\n-
\n-
237 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp, T& t)
\n-
\n-
239 return NodeTransformation::transform_storage(sp,t);
\n-
\n-
\n-
242 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
244 return NodeTransformation::transform_storage(sp,t);
\n-
\n+
\n+
\n+
\n+
\n+
229 template<
typename Node, std::
size_t k, std::
size_t n>
\n+
230 struct generic_compositenode_children_info
\n+
\n+
\n+
233 typedef generic_compositenode_children_info<Node,k+1,n> NextChild;
\n+
\n+
\n+
236 typedef typename Node::template Child<k>::Type Child;
\n+
237 typedef NodeTag<Child> ChildTag;
\n+
238 typedef TreeInfo<Child,ChildTag> ChildInfo;
\n+
\n+
\n+
241 static const std::size_t maxDepth = ChildInfo::depth > NextChild::maxDepth ? ChildInfo::depth : NextChild::maxDepth;
\n+
\n+
243 static const std::size_t nodeCount = ChildInfo::nodeCount + NextChild::nodeCount;
\n+
\n+
245 static const std::size_t leafCount = ChildInfo::leafCount + NextChild::leafCount;
\n
\n-
\n+
\n
\n-
\n-
\n-
\n-
\n-
253 template<
class Source,
class Transformation,
class Tag>
\n-
254 class RecursivePowerTransformTree
\n-
\n-
\n-
257 static_assert(std::is_same_v<Tag,PowerNodeTag> or std::is_same_v<Tag,DynamicPowerNodeTag>);
\n-
\n-
259 using ChildType =
typename Source::ChildType;
\n-
\n-
\n-
262 template<
class NodeStorage>
\n-
263 static auto node_storage_provider(
const std::size_t& degree)
\n-
\n-
265 return std::vector<NodeStorage>(degree);
\n-
\n+
\n+
250 template<
typename Node, std::
size_t n>
\n+
251 struct generic_compositenode_children_info<Node,n,n>
\n+
\n+
253 static const std::size_t maxDepth = 0;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
264 template<
typename Node>
\n+
265 struct GenericCompositeNodeInfo
\n+
\n
\n-
\n-
269 template<
class NodeStorage,
class StaticIndex>
\n-
270 static auto node_storage_provider(StaticIndex)
\n-
\n-
272 return std::array<NodeStorage,std::size_t(StaticIndex{})>();
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
283 using NodeTransformation =
typename LookupNodeTransformation<Source,Transformation,ImplementationTag<Source>>::type;
\n-
284 using ChildNodeTransformation =
typename LookupNodeTransformation<ChildType,Transformation,ImplementationTag<ChildType>>::type;
\n+
268 typedef generic_compositenode_children_info<Node,0,StaticDegree<Node>::value> Children;
\n+
\n+
270 static const std::size_t
depth = 1 + Children::maxDepth;
\n+
\n+
272 static const std::size_t
nodeCount = 1 + Children::nodeCount;
\n+
\n+
274 static const std::size_t
leafCount = Children::leafCount;
\n+
\n+
\n+
\n+
\n+
\n+
280 template<
typename Node>
\n+
281 struct TreeInfo<Node,CompositeNodeTag>
\n+
282 :
public GenericCompositeNodeInfo<Node>
\n+
\n+
\n
\n-
\n-
\n-
288 using ChildTreeTransformation = TransformTree<ChildType,
\n-
\n-
\n-
291 ChildNodeTransformation::recursive>;
\n-
\n-
\n-
294 using transformed_child_type =
typename ChildTreeTransformation::transformed_type;
\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-
302 static transformed_type transform(
const Source& source, Transformation& transformation)
\n-
\n-
304 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n-
305 for (std::size_t k = 0; k < source.degree(); ++k) {
\n-
306 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n-
\n-
308 return NodeTransformation::transform(source,transformation,children_storage);
\n-
\n-
\n-
\n-
312 static transformed_type transform(
const Source& source,
const Transformation& transformation)
\n-
\n-
314 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n-
315 for (std::size_t k = 0; k < source.degree(); ++k) {
\n-
316 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n-
\n-
318 return NodeTransformation::transform(source,transformation,children_storage);
\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-
325 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
326 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
328 return NodeTransformation::transform(source_ptr,transformation,children_storage);
\n-
\n-
\n-
\n-
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-
335 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
336 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
338 return NodeTransformation::transform(source_ptr,transformation,children_storage);
\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-
345 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
346 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
348 return NodeTransformation::transform_storage(source_ptr,transformation,children_storage);
\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-
355 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
356 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
358 return NodeTransformation::transform_storage(source_ptr,transformation,children_storage);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
365 template<
typename Source,
typename Transformation>
\n-
366 struct TransformTree<Source,Transformation,PowerNodeTag,true>
\n-
367 :
public Impl::RecursivePowerTransformTree<Source,Transformation,PowerNodeTag>
\n-
\n-
\n-
\n-
371 template<
typename Source,
typename Transformation>
\n-
372 struct TransformTree<Source,Transformation,DynamicPowerNodeTag,true>
\n-
373 :
public Impl::RecursivePowerTransformTree<Source,Transformation,DynamicPowerNodeTag>
\n-
\n-
\n-
\n-
377 template<
typename S,
typename T>
\n-
378 struct TransformTree<S,T,PowerNodeTag,false>
\n-
379 :
public TransformTreeNonRecursive<S,T>
\n-
\n-
\n-
\n-
383 template<
typename S,
typename T>
\n-
384 struct TransformTree<S,T,DynamicPowerNodeTag,false>
\n-
385 :
public TransformTreeNonRecursive<S,T>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
393 template<
typename S,
typename Children,
typename T>
\n-
394 struct transform_composite_node;
\n-
\n-
\n-
\n-
\n-
399 template<
typename S,
typename T,
typename... C>
\n-
400 struct transform_composite_node<S,std::tuple<C...>,T>
\n-
\n-
\n-
\n-
404 typedef ImplementationTag<S> Tag;
\n-
405 typedef typename LookupNodeTransformation<S,T,Tag>::type NodeTransformation;
\n-
406 typedef typename NodeTransformation::template
result<
typename TransformTree<C,
\n-
\n-
\n-
409 LookupNodeTransformation<C,T,ImplementationTag<C>>::type::recursive
\n-
410 >::transformed_type...
\n-
411 >::type transformed_type;
\n-
\n-
413 typedef typename NodeTransformation::template
result<
typename TransformTree<C,
\n-
\n-
\n-
416 LookupNodeTransformation<C,T,ImplementationTag<C>>::type::recursive
\n-
417 >::transformed_type...
\n-
418 >::storage_type transformed_storage_type;
\n-
\n-
\n-
\n-
\n-
423 template<std::
size_t i>
\n-
424 struct ChildTransformation
\n-
425 :
public TransformTree<typename S::template Child<i>::Type,
\n-
\n-
427 NodeTag<typename S::template Child<i>::Type>,
\n-
428 LookupNodeTransformation<
\n-
429 typename S::template Child<i>::Type,
\n-
\n-
431 ImplementationTag<typename S::template Child<i>::Type>
\n-
\n-
\n-
\n-
\n-
436 template<std::
size_t i,
typename Tuple,
typename Value>
\n-
437 static void setElement(Tuple& tuple, Value&& value)
\n-
\n-
439 std::get<i>(tuple) = std::forward<Value>(value);
\n-
\n-
\n-
442 template<
typename Trafo, std::size_t... i>
\n-
443 static transformed_type transform(
const S& s, Trafo&& t, std::index_sequence<i...> indices)
\n-
\n-
445 std::tuple<typename ChildTransformation<i>::transformed_storage_type...> storage;
\n-
446 Dune::Hybrid::Impl::evaluateFoldExpression<int>({(setElement<i>(storage, ChildTransformation<i>::transform_storage(s.template childStorage<i>(), std::forward<Trafo>(t))),0)...});
\n-
447 return NodeTransformation::transform(s, std::forward<Trafo>(t), std::get<i>(storage)...);
\n-
\n-
\n-
450 template<
typename Trafo, std::size_t... i>
\n-
451 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp, Trafo&& t, std::index_sequence<i...> indices)
\n-
\n-
453 std::tuple<typename ChildTransformation<i>::transformed_storage_type...> storage;
\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-
462 template<
typename S,
typename T>
\n-
463 struct TransformTree<S,T,CompositeNodeTag,true>
\n-
\n-
\n-
\n-
\n-
468 typedef typename S::ChildTypes ChildTypes;
\n-
\n-
470 static auto child_indices()
\n-
\n-
472 return std::make_index_sequence<S::degree()>();
\n-
\n-
\n-
\n-
\n-
477 typedef typename transform_composite_node<S,ChildTypes,T>::transformed_type transformed_type;
\n-
478 typedef typename transform_composite_node<S,ChildTypes,T>::transformed_storage_type transformed_storage_type;
\n-
\n-
480 static transformed_type
transform(
const S& s, T& t)
\n-
\n-
482 return transform_composite_node<S,ChildTypes,T>::transform(s,t,child_indices());
\n-
\n-
\n-
485 static transformed_type
transform(
const S& s,
const T& t)
\n-
\n-
487 return transform_composite_node<S,ChildTypes,T>::transform(s,t,child_indices());
\n-
\n-
\n-
490 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp, T& t)
\n-
\n-
492 return transform_composite_node<S,ChildTypes,T>::transform_storage(sp,t,child_indices());
\n-
\n-
\n-
495 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
497 return transform_composite_node<S,ChildTypes,T>::transform_storage(sp,t,child_indices());
\n-
\n-
\n-
\n-
\n-
\n-
503 template<
typename S,
typename T>
\n-
504 struct TransformTree<S,T,CompositeNodeTag,false>
\n-
505 :
public TransformTreeNonRecursive<S,T>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
static const result_type result
Definition accumulate_static.hh:110
\n-
\n-
\n-
\n-
void registerNodeTransformation(SourceNode *, Transformation *, Tag *)
Register transformation descriptor to transform SourceNode with Transformation.
\n+
\n+
\n+
\n+
289 using Dune::index_constant;
\n+
290 namespace Indices = Dune::Indices;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
static const result_type result
Definition accumulate_static.hh:110
\n
Definition accumulate_static.hh:13
\n-
Transform a TypeTree.
Definition transformation.hh:94
\n-
type Type
Definition transformation.hh:111
\n-
static transformed_type transform(std::shared_ptr< const SourceTree > sp, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:132
\n-
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
\n-
static transformed_type transform(const SourceTree &s, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:120
\n-
transformed_type type
The type of the transformed tree.
Definition transformation.hh:109
\n-
static transformed_type transform(const SourceTree &s, const Transformation &t=Transformation())
Apply transformation to an existing tree s.
Definition transformation.hh:114
\n-
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, const Transformation &t=Transformation())
Definition transformation.hh:139
\n-
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, Transformation &t)
Definition transformation.hh:146
\n-
Meta function that evaluates its argument iff it inherits from meta_function.
Definition typetraits.hh:140
\n+
auto leafCount(const Tree &tree)
The number of leaf nodes in the Tree.
Definition visitor.hh:530
\n+
auto nodeCount(const Tree &tree)
The total number of nodes in the Tree.
Definition visitor.hh:522
\n+
auto depth(const Tree &tree)
The depth of the TypeTree.
Definition visitor.hh:506
\n+
Tag designating a leaf node.
Definition nodetags.hh:16
\n+
Struct for obtaining some basic structural information about a TypeTree.
Definition utility.hh:168
\n+
static const std::size_t leafCount
The number of leaf nodes in the TypeTree.
Definition utility.hh:183
\n+
static const std::size_t depth
The depth of the TypeTree.
Definition utility.hh:177
\n+
static const std::size_t nodeCount
The total number of nodes in the TypeTree.
Definition utility.hh:180
\n
![\"doxygen\"/](\"doxygen.svg\")