\n
\n
\n
\n
\n-
6#ifndef DUNE_TYPETREE_TRANSFORMATION_HH \n-
7#define DUNE_TYPETREE_TRANSFORMATION_HH \n+
6#ifndef DUNE_TYPETREE_UTILITY_HH \n+
7#define DUNE_TYPETREE_UTILITY_HH \n
\n-
\n+
\n
\n-
\n+
\n
\n-
\n-
14#include <dune/common/hybridutilities.hh> \n-
15#include <dune/common/exceptions.hh> \n-
16#include <dune/common/typetraits.hh> \n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
15#include <dune/common/shared_ptr.hh> \n+
16#include <dune/common/indices.hh> \n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
30 std::shared_ptr<T> convert_arg(
const T& t)
\n+
\n+
32 return std::make_shared<T>(t);
\n+
\n
\n-
53 template<
typename SourceNode,
typename Transformation,
typename Tag>
\n-
\n-
\n-
\n+
\n+
36 std::shared_ptr<T> convert_arg(T& t)
\n+
\n+
38 return stackobject_to_shared_ptr(t);
\n+
\n+
\n+
41 template<
typename BaseType,
typename T>
\n+
42 T& assertGridViewType(T& t)
\n+
\n+
44 static_assert((std::is_same<
typename BaseType::Traits::GridViewType,
\n+
45 typename T::Traits::GridViewType>::value),
\n+
46 "GridViewType must be equal in all components of composite type");
\n+
\n+
\n+
\n+
\n+
\n+
52 typename std::enable_if<!std::is_lvalue_reference<T>::value,std::shared_ptr<T> >::type convert_arg(T&& t)
\n+
\n+
54 return std::make_shared<T>(std::forward<T>(t));
\n+
\n+
\n
\n-
68 template<
typename S,
typename T,
typename Tag>
\n-
69 struct LookupNodeTransformation
\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-
94 template<
typename SourceTree,
typename Transformation,
typename Tag = StartTag,
bool recursive = true>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
100 typedef typename LookupNodeTransformation<SourceTree,Transformation,typename SourceTree::ImplementationTag>::type NodeTransformation;
\n-
\n-
\n-
\n-
\n-
\n-
\n+
58 namespace Experimental {
\n+
\n+
68 template<
class BinaryOp,
class Arg>
\n+
69 constexpr decltype(
auto)
\n+
70 left_fold(
const BinaryOp& binary_op, Arg&& arg)
\n+
\n+
72 return std::forward<Arg>(arg);
\n+
\n+
\n+
96 template<
class BinaryOp,
class Init,
class Arg0,
class... Args>
\n+
97 constexpr decltype(
auto)
\n+
98 left_fold(
const BinaryOp& binary_op, Init&& init, Arg0&& arg_0, Args&&... args)
\n+
\n+
\n+
\n+
102 binary_op(std::forward<Init>(init), std::forward<Arg0>(arg_0)),
\n+
103 std::forward<Args>(args)...);
\n+
\n+
\n+
\n
\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-
\n-
\n-
\n-
\n-
\n-
122 static transformed_type
transform(
const SourceTree& s, Transformation& t)
\n-
\n-
\n-
\n-
\n+
119 template<
typename Tree,
typename Tag = StartTag>
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
128 static transformed_type
transform(std::shared_ptr<const SourceTree> sp,
const Transformation& t = Transformation())
\n-
\n-
\n-
\n-
\n-
\n-
\n-
134 static transformed_type
transform(std::shared_ptr<const SourceTree> sp, Transformation& t)
\n-
\n-
\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-
\n-
\n-
148 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+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
149 template<
typename Node>
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
159 template<
typename S,
typename T,
bool recursive>
\n-
160 struct TransformTree<S,T,LeafNodeTag,recursive>
\n-
\n-
\n-
163 typedef typename LookupNodeTransformation<S,T,ImplementationTag<S>>
::type NodeTransformation;
\n-
\n-
165 typedef typename NodeTransformation::transformed_type transformed_type;
\n-
166 typedef typename NodeTransformation::transformed_storage_type transformed_storage_type;
\n-
\n-
\n-
169 static transformed_type
transform(
const S& s, T& t)
\n-
\n-
171 return NodeTransformation::transform(s,t);
\n-
\n-
\n-
\n-
175 static transformed_type
transform(
const S& s,
const T& t)
\n-
\n-
177 return NodeTransformation::transform(s,t);
\n-
\n+
153 static const std::size_t
depth = 1;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
163 template<
typename Node>
\n+
164 struct TreeInfo<Node,PowerNodeTag>
\n+
\n+
\n+
167 typedef TreeInfo<typename Node::ChildType,NodeTag<typename Node::ChildType>> ChildInfo;
\n+
\n+
169 static const std::size_t
depth = 1 + ChildInfo::depth;
\n+
\n+
171 static const std::size_t
nodeCount = 1 + StaticDegree<Node>::value * ChildInfo::nodeCount;
\n+
\n+
173 static const std::size_t
leafCount = StaticDegree<Node>::value * ChildInfo::leafCount;
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
181 static transformed_type
transform(std::shared_ptr<const S> sp, T& t)
\n-
\n-
183 return NodeTransformation::transform(sp,t);
\n-
\n+
\n+
\n+
182 template<
typename Node, std::
size_t k, std::
size_t n>
\n+
183 struct generic_compositenode_children_info
\n+
\n
\n-
\n-
187 static transformed_type
transform(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
189 return NodeTransformation::transform(sp,t);
\n-
\n-
\n-
192 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp, T& t)
\n-
\n-
194 return NodeTransformation::transform_storage(sp,t);
\n-
\n-
\n-
197 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
199 return NodeTransformation::transform_storage(sp,t);
\n-
\n+
186 typedef generic_compositenode_children_info<Node,k+1,n> NextChild;
\n+
\n+
\n+
189 typedef typename Node::template Child<k>::Type Child;
\n+
190 typedef NodeTag<Child> ChildTag;
\n+
191 typedef TreeInfo<Child,ChildTag> ChildInfo;
\n+
\n+
\n+
194 static const std::size_t maxDepth = ChildInfo::depth > NextChild::maxDepth ? ChildInfo::depth : NextChild::maxDepth;
\n+
\n+
196 static const std::size_t nodeCount = ChildInfo::nodeCount + NextChild::nodeCount;
\n+
\n+
198 static const std::size_t leafCount = ChildInfo::leafCount + NextChild::leafCount;
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
206 template<
typename S,
typename T>
\n-
207 struct TransformTreeNonRecursive
\n-
\n-
\n-
210 typedef typename LookupNodeTransformation<S,T,ImplementationTag<S>>::type NodeTransformation;
\n-
\n-
212 typedef typename NodeTransformation::transformed_type transformed_type;
\n-
213 typedef typename NodeTransformation::transformed_storage_type transformed_storage_type;
\n+
\n+
203 template<
typename Node, std::
size_t n>
\n+
204 struct generic_compositenode_children_info<Node,n,n>
\n+
\n+
206 static const std::size_t maxDepth = 0;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
216 static transformed_type transform(
const S& s, T& t)
\n-
\n-
218 return NodeTransformation::transform(s,t);
\n-
\n+
\n+
\n+
217 template<
typename Node>
\n+
218 struct GenericCompositeNodeInfo
\n+
\n
\n-
\n-
222 static transformed_type transform(
const S& s,
const T& t)
\n-
\n-
224 return NodeTransformation::transform(s,t);
\n-
\n+
221 typedef generic_compositenode_children_info<Node,0,StaticDegree<Node>::value> Children;
\n+
\n+
223 static const std::size_t
depth = 1 + Children::maxDepth;
\n+
\n+
225 static const std::size_t
nodeCount = 1 + Children::nodeCount;
\n
\n-
\n-
228 static transformed_type transform(std::shared_ptr<const S> sp, T& t)
\n-
\n-
230 return NodeTransformation::transform(sp,t);
\n-
\n-
\n-
\n-
234 static transformed_type transform(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
236 return NodeTransformation::transform(sp,t);
\n-
\n+
227 static const std::size_t
leafCount = Children::leafCount;
\n+
\n+
\n+
\n+
\n+
\n+
233 template<
typename Node>
\n+
234 struct TreeInfo<Node,CompositeNodeTag>
\n+
235 :
public GenericCompositeNodeInfo<Node>
\n+
\n+
\n
\n-
239 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp, T& t)
\n-
\n-
241 return NodeTransformation::transform_storage(sp,t);
\n-
\n-
\n-
244 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
246 return NodeTransformation::transform_storage(sp,t);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
255 template<
class Source,
class Transformation,
class Tag>
\n-
256 class RecursivePowerTransformTree
\n-
\n-
\n-
259 static_assert(std::is_same_v<Tag,PowerNodeTag> or std::is_same_v<Tag,DynamicPowerNodeTag>);
\n-
\n-
261 using ChildType =
typename Source::ChildType;
\n-
\n-
\n-
264 template<
class NodeStorage>
\n-
265 static auto node_storage_provider(
const std::size_t& degree)
\n-
\n-
267 return std::vector<NodeStorage>(degree);
\n-
\n-
\n-
\n-
271 template<
class NodeStorage,
class StaticIndex>
\n-
272 static auto node_storage_provider(StaticIndex)
\n-
\n-
274 return std::array<NodeStorage,std::size_t(StaticIndex{})>();
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\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-
290 using ChildTreeTransformation = TransformTree<ChildType,
\n-
\n-
\n-
293 ChildNodeTransformation::recursive>;
\n-
\n-
\n-
296 using transformed_child_type =
typename ChildTreeTransformation::transformed_type;
\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-
304 static transformed_type transform(
const Source& source, Transformation& transformation)
\n-
\n-
306 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n-
307 for (std::size_t k = 0; k < source.degree(); ++k) {
\n-
308 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n-
\n-
310 return NodeTransformation::transform(source,transformation,children_storage);
\n-
\n-
\n-
\n-
314 static transformed_type transform(
const Source& source,
const Transformation& transformation)
\n-
\n-
316 auto children_storage = node_storage_provider<std::shared_ptr<transformed_child_type>>(source.degree());
\n-
317 for (std::size_t k = 0; k < source.degree(); ++k) {
\n-
318 children_storage[k] = ChildTreeTransformation::transform_storage(source.childStorage(k),transformation);
\n-
\n-
320 return NodeTransformation::transform(source,transformation,children_storage);
\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-
327 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
328 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
330 return NodeTransformation::transform(source_ptr,transformation,children_storage);
\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-
337 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
338 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
340 return NodeTransformation::transform(source_ptr,transformation,children_storage);
\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-
347 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
348 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
350 return NodeTransformation::transform_storage(source_ptr,transformation,children_storage);
\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-
357 for (std::size_t k = 0; k < source_ptr->degree(); ++k) {
\n-
358 children_storage[k] = ChildTreeTransformation::transform_storage(source_ptr->childStorage(k),transformation);
\n-
\n-
360 return NodeTransformation::transform_storage(source_ptr,transformation,children_storage);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
367 template<
typename Source,
typename Transformation>
\n-
368 struct TransformTree<Source,Transformation,PowerNodeTag,true>
\n-
369 :
public Impl::RecursivePowerTransformTree<Source,Transformation,PowerNodeTag>
\n-
\n-
\n-
\n-
373 template<
typename Source,
typename Transformation>
\n-
374 struct TransformTree<Source,Transformation,DynamicPowerNodeTag,true>
\n-
375 :
public Impl::RecursivePowerTransformTree<Source,Transformation,DynamicPowerNodeTag>
\n-
\n-
\n-
\n-
379 template<
typename S,
typename T>
\n-
380 struct TransformTree<S,T,PowerNodeTag,false>
\n-
381 :
public TransformTreeNonRecursive<S,T>
\n-
\n-
\n-
\n-
385 template<
typename S,
typename T>
\n-
386 struct TransformTree<S,T,DynamicPowerNodeTag,false>
\n-
387 :
public TransformTreeNonRecursive<S,T>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
395 template<
typename S,
typename Children,
typename T>
\n-
396 struct transform_composite_node;
\n-
\n-
\n-
\n-
\n-
401 template<
typename S,
typename T,
typename... C>
\n-
402 struct transform_composite_node<S,std::tuple<C...>,T>
\n-
\n-
\n-
\n-
406 typedef ImplementationTag<S> Tag;
\n-
407 typedef typename LookupNodeTransformation<S,T,Tag>::type NodeTransformation;
\n-
408 typedef typename NodeTransformation::template
result<
typename TransformTree<C,
\n-
\n-
\n-
411 LookupNodeTransformation<C,T,ImplementationTag<C>>::type::recursive
\n-
412 >::transformed_type...
\n-
413 >::type transformed_type;
\n-
\n-
415 typedef typename NodeTransformation::template
result<
typename TransformTree<C,
\n-
\n-
\n-
418 LookupNodeTransformation<C,T,ImplementationTag<C>>::type::recursive
\n-
419 >::transformed_type...
\n-
420 >::storage_type transformed_storage_type;
\n-
\n-
\n-
\n-
\n-
425 template<std::
size_t i>
\n-
426 struct ChildTransformation
\n-
427 :
public TransformTree<typename S::template Child<i>::Type,
\n-
\n-
429 NodeTag<typename S::template Child<i>::Type>,
\n-
430 LookupNodeTransformation<
\n-
431 typename S::template Child<i>::Type,
\n-
\n-
433 ImplementationTag<typename S::template Child<i>::Type>
\n-
\n-
\n-
\n-
\n-
438 template<std::
size_t i,
typename Tuple,
typename Value>
\n-
439 static void setElement(Tuple& tuple, Value&& value)
\n-
\n-
441 std::get<i>(tuple) = std::forward<Value>(value);
\n-
\n-
\n-
444 template<
typename Trafo, std::size_t... i>
\n-
445 static transformed_type transform(
const S& s, Trafo&& t, std::index_sequence<i...> indices)
\n-
\n-
447 std::tuple<typename ChildTransformation<i>::transformed_storage_type...> storage;
\n-
448 Dune::Hybrid::Impl::evaluateFoldExpression<int>({(setElement<i>(storage, ChildTransformation<i>::transform_storage(s.template childStorage<i>(), std::forward<Trafo>(t))),0)...});
\n-
449 return NodeTransformation::transform(s, std::forward<Trafo>(t), std::get<i>(storage)...);
\n-
\n-
\n-
452 template<
typename Trafo, std::size_t... i>
\n-
453 static transformed_storage_type transform_storage(std::shared_ptr<const S> sp, Trafo&& t, std::index_sequence<i...> indices)
\n-
\n-
455 std::tuple<typename ChildTransformation<i>::transformed_storage_type...> storage;
\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-
464 template<
typename S,
typename T>
\n-
465 struct TransformTree<S,T,CompositeNodeTag,true>
\n-
\n-
\n-
\n-
\n-
470 typedef typename S::ChildTypes ChildTypes;
\n-
\n-
472 static auto child_indices()
\n-
\n-
474 return std::make_index_sequence<S::degree()>();
\n-
\n-
\n-
\n-
\n-
479 typedef typename transform_composite_node<S,ChildTypes,T>::transformed_type transformed_type;
\n-
480 typedef typename transform_composite_node<S,ChildTypes,T>::transformed_storage_type transformed_storage_type;
\n-
\n-
482 static transformed_type
transform(
const S& s, T& t)
\n-
\n-
484 return transform_composite_node<S,ChildTypes,T>::transform(s,t,child_indices());
\n-
\n-
\n-
487 static transformed_type
transform(
const S& s,
const T& t)
\n-
\n-
489 return transform_composite_node<S,ChildTypes,T>::transform(s,t,child_indices());
\n-
\n-
\n-
492 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp, T& t)
\n-
\n-
494 return transform_composite_node<S,ChildTypes,T>::transform_storage(sp,t,child_indices());
\n-
\n-
\n-
497 static transformed_storage_type
transform_storage(std::shared_ptr<const S> sp,
const T& t)
\n-
\n-
499 return transform_composite_node<S,ChildTypes,T>::transform_storage(sp,t,child_indices());
\n-
\n-
\n-
\n-
\n-
\n-
505 template<
typename S,
typename T>
\n-
506 struct TransformTree<S,T,CompositeNodeTag,false>
\n-
507 :
public TransformTreeNonRecursive<S,T>
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
static const result_type result
Definition accumulate_static.hh:113
\n-
\n-
\n-
\n-
void registerNodeTransformation(SourceNode *, Transformation *, Tag *)
Register transformation descriptor to transform SourceNode with Transformation.
\n+
\n+
\n+
\n+
242 using Dune::index_constant;
\n+
243 namespace Indices = Dune::Indices;
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
Definition accumulate_static.hh:16
\n-
Transform a TypeTree.
Definition transformation.hh:96
\n-
type Type
Definition transformation.hh:113
\n-
static transformed_type transform(std::shared_ptr< const SourceTree > sp, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:134
\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:128
\n-
static transformed_type transform(const SourceTree &s, Transformation &t)
Apply transformation to an existing tree s.
Definition transformation.hh:122
\n-
transformed_type type
The type of the transformed tree.
Definition transformation.hh:111
\n-
static transformed_type transform(const SourceTree &s, const Transformation &t=Transformation())
Apply transformation to an existing tree s.
Definition transformation.hh:116
\n-
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, const Transformation &t=Transformation())
Definition transformation.hh:141
\n-
static transformed_storage_type transform_storage(std::shared_ptr< const SourceTree > sp, Transformation &t)
Definition transformation.hh:148
\n-
Meta function that evaluates its argument iff it inherits from meta_function.
Definition typetraits.hh:142
\n+
auto leafCount(const Tree &tree)
The number of leaf nodes in the Tree.
Definition visitor.hh:532
\n+
auto nodeCount(const Tree &tree)
The total number of nodes in the Tree.
Definition visitor.hh:524
\n+
auto depth(const Tree &tree)
The depth of the TypeTree.
Definition visitor.hh:508
\n+
Tag designating a leaf node.
Definition nodetags.hh:18
\n+
Struct for obtaining some basic structural information about a TypeTree.
Definition utility.hh:121
\n+
static const std::size_t leafCount
The number of leaf nodes in the TypeTree.
Definition utility.hh:136
\n+
static const std::size_t depth
The depth of the TypeTree.
Definition utility.hh:130
\n+
static const std::size_t nodeCount
The total number of nodes in the TypeTree.
Definition utility.hh:133
\n
![\"doxygen\"/](\"doxygen.svg\")