\n-
\n-
\n-
\n-
\n+
\n+
53 template<
typename SourceNode,
typename Transformation,
typename Tag>
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
67 return std::integral_constant<std::size_t,k>{};
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
81 template<std::
size_t i>
\n-
\n-
\n-
\n-
\n-
85 static_assert((i <
degree()),
"child index out of range");
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
101 template<std::
size_t i>
\n-
\n-
\n-
\n-
104 static_assert((i <
degree()),
"child index out of range");
\n-
105 return *_children[i];
\n-
\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
\n+
\n
\n-
112 template<std::
size_t i>
\n-
\n-
113 const T&
child (index_constant<i> = {})
const \n-
\n-
115 static_assert((i <
degree()),
"child index out of range");
\n-
116 return *_children[i];
\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-
123 template<std::
size_t i>
\n-
\n-
\n-
\n-
126 static_assert((i <
degree()),
"child index out of range");
\n-
\n-
\n-
\n-
\n-
\n-
134 template<std::
size_t i>
\n-
\n-
\n-
\n-
137 static_assert((i <
degree()),
"child index out of range");
\n-
\n-
\n-
\n-
\n-
142 template<std::
size_t i>
\n-
\n-
\n-
\n-
145 static_assert((i <
degree()),
"child index out of range");
\n-
146 _children[i] = stackobject_to_shared_ptr(t);
\n-
\n-
\n-
\n-
150 template<std::
size_t i>
\n-
\n-
\n-
\n-
153 static_assert((i <
degree()),
"child index out of range");
\n-
154 _children[i] = convert_arg(std::move(t));
\n-
\n-
\n-
\n-
158 template<std::
size_t i>
\n-
\n-
159 void setChild (std::shared_ptr<T> st, index_constant<i> = {})
\n-
\n-
161 static_assert((i <
degree()),
"child index out of range");
\n-
162 _children[i] = std::move(st);
\n-
\n-
\n+
\n+
122 static transformed_type
transform(
const SourceTree& s, Transformation& t)
\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+
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-
\n+
165 typedef typename NodeTransformation::transformed_type transformed_type;
\n+
166 typedef typename NodeTransformation::transformed_storage_type transformed_storage_type;
\n
\n-
\n-
\n-
\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 assert(i <
degree() &&
"child index out of range");
\n-
178 return *_children[i];
\n-
\n-
\n-
\n-
\n-
\n-
185 const T&
child (std::size_t i)
const \n-
\n-
187 assert(i <
degree() &&
"child index out of range");
\n-
188 return *_children[i];
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
197 assert(i <
degree() &&
"child index out of range");
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
207 assert(i <
degree() &&
"child index out of range");
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
214 assert(i <
degree() &&
"child index out of range");
\n-
215 _children[i] = stackobject_to_shared_ptr(t);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
221 assert(i <
degree() &&
"child index out of range");
\n-
222 _children[i] = convert_arg(std::move(t));
\n-
\n-
\n-
\n-
\n-
226 void setChild (std::size_t i, std::shared_ptr<T> st)
\n-
\n-
228 assert(i <
degree() &&
"child index out of range");
\n-
229 _children[i] = std::move(st);
\n-
\n-
\n-
\n-
\n-
\n+
177 return NodeTransformation::transform(s,t);
\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+
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+
\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+
\n+
216 static transformed_type transform(
const S& s, T& t)
\n+
\n+
218 return NodeTransformation::transform(s,t);
\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+
\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
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\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-
\n-
265 template<
typename... Indices>
\n-
\n-
266 ImplementationDefined&
child (Indices... indices)
\n-
\n-
268 template<
typename I0,
typename... I,
\n-
\n-
270 decltype(
auto)
child (I0 i0, I... i)
\n-
\n-
\n-
273 static_assert(
sizeof...(I) > 0 || impl::_non_empty_tree_path(I0{}),
\n-
274 "You cannot use the member function child() with an empty TreePath, use the freestanding version child(node,treePath) instead." \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
285 template<
typename... Indices>
\n-
\n-
286 const ImplementationDefined&
child (Indices... indices)
\n-
\n-
288 template<
typename I0,
typename... I,
\n-
\n-
290 decltype(
auto)
child (I0 i0, I... i)
const \n-
\n-
\n-
293 static_assert(
sizeof...(I) > 0 || impl::_non_empty_tree_path(I0{}),
\n-
294 "You cannot use the member function child() with an empty TreePath, use the freestanding version child(node,treePath) instead." \n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
320 : _children(children)
\n-
\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-
\n-
\n-
326 if (distinct_objects)
\n-
\n-
328 for (
typename NodeStorage::iterator it = _children.begin(); it != _children.end(); ++it)
\n-
329 *it = std::make_shared<T>(t);
\n-
\n-
\n-
\n-
333 std::shared_ptr<T> sp = stackobject_to_shared_ptr(t);
\n-
334 std::fill(_children.begin(),_children.end(),sp);
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
346 template<
typename... Children,
\n-
\n-
348 std::conjunction<std::is_same<ChildType, std::decay_t<Children>>...>::value
\n-
\n-
\n-
\n-
352 static_assert(
degree() ==
sizeof...(Children),
"PowerNode constructor is called with incorrect number of children");
\n-
353 _children =
NodeStorage{convert_arg(std::forward<Children>(children))...};
\n-
\n-
\n-
356 template<
typename... Children,
\n-
\n-
358 std::conjunction<std::is_same<ChildType, Children>...>::value
\n-
\n-
360 PowerNode (std::shared_ptr<Children>... children)
\n-
\n-
362 static_assert(
degree() ==
sizeof...(Children),
"PowerNode constructor is called with incorrect number of children");
\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-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
ImplementationDefined child(Node &&node, Indices... indices)
Extracts the child of a node given by a sequence of compile-time and run-time indices.
Definition childextraction.hh:128
\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+
\n+
\n+
static const result_type result
Definition accumulate_static.hh:113
\n+
\n+
void registerNodeTransformation(SourceNode *, Transformation *, Tag *)
Register transformation descriptor to transform SourceNode with Transformation.
\n
Definition accumulate_static.hh:16
\n-
Tag designating a power node.
Definition nodetags.hh:21
\n-
Collect k instances of type T within a dune-typetree.
Definition powernode.hh:52
\n-
void setChild(T &t, index_constant< i >={})
Sets the i-th child to the passed-in value.
Definition powernode.hh:143
\n-
T & child(std::size_t i)
Returns the i-th child.
Definition powernode.hh:175
\n-
const T & child(index_constant< i >={}) const
Returns the i-th child (const version).
Definition powernode.hh:113
\n-
void setChild(std::shared_ptr< T > st, index_constant< i >={})
Sets the stored value representing the i-th child to the passed-in value.
Definition powernode.hh:159
\n-
std::shared_ptr< T > childStorage(index_constant< i >={})
Returns the storage of the i-th child.
Definition powernode.hh:124
\n-
PowerNode(T &t1, T &t2,...)
Initialize all children with the passed-in objects.
Definition powernode.hh:341
\n-
const NodeStorage & nodeStorage() const
Definition powernode.hh:232
\n-
std::array< std::shared_ptr< T >, k > NodeStorage
The type used for storing the children.
Definition powernode.hh:77
\n-
std::shared_ptr< const T > childStorage(index_constant< i >={}) const
Returns the storage of the i-th child (const version).
Definition powernode.hh:135
\n-
PowerNode(T &t, bool distinct_objects=true)
Initialize all children with copies of a storage object constructed from the parameter t.
Definition powernode.hh:324
\n-
PowerNodeTag NodeTag
The type tag that describes a PowerNode.
Definition powernode.hh:71
\n-
const T & child(std::size_t i) const
Returns the i-th child (const version).
Definition powernode.hh:185
\n-
static constexpr auto degree()
Definition powernode.hh:65
\n-
std::shared_ptr< const T > childStorage(std::size_t i) const
Returns the storage of the i-th child (const version).
Definition powernode.hh:205
\n-
void setChild(std::size_t i, std::shared_ptr< T > st)
Sets the stored value representing the i-th child to the passed-in value.
Definition powernode.hh:226
\n-
static const bool isComposite
Mark this class as a non composite in the dune-typetree.
Definition powernode.hh:63
\n-
static const bool isLeaf
Mark this class as non leaf in the dune-typetree.
Definition powernode.hh:57
\n-
static const bool isPower
Mark this class as a power in the dune-typetree.
Definition powernode.hh:60
\n-
PowerNode(const NodeStorage &children)
Initialize the PowerNode with a copy of the passed-in storage type.
Definition powernode.hh:319
\n-
T ChildType
The type of each child.
Definition powernode.hh:74
\n-
T & child(index_constant< i >={})
Returns the i-th child.
Definition powernode.hh:102
\n-
ImplementationDefined & child(Indices... indices)
Returns the child given by the list of indices.
Definition powernode.hh:266
\n-
void setChild(std::size_t i, T &&t)
Store the passed value in i-th child.
Definition powernode.hh:219
\n-
void setChild(T &&t, index_constant< i >={})
Store the passed value in i-th child.
Definition powernode.hh:151
\n-
PowerNode()
Default constructor.
Definition powernode.hh:315
\n-
const ImplementationDefined & child(Indices... indices)
Returns the child given by the list of indices.
Definition powernode.hh:286
\n-
void setChild(std::size_t i, T &t)
Sets the i-th child to the passed-in value.
Definition powernode.hh:212
\n-
std::shared_ptr< T > childStorage(std::size_t i)
Returns the storage of the i-th child.
Definition powernode.hh:195
\n-
Access to the type and storage type of the i-th child.
Definition powernode.hh:83
\n-
T type
The type of the child.
Definition powernode.hh:91
\n-
T Type
The type of the child.
Definition powernode.hh:88
\n-
Check if type represents a tree path.
Definition typetraits.hh:184
\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
![\"doxygen\"/](\"doxygen.svg\")
1.9.8\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,58 +1,73 @@\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 | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs | _\bF_\bu_\bn_\bc_\bt_\bi_\bo_\bn_\bs\n-childextraction.hh File Reference\n-#include