dune-typetree  2.7.1
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123]
 CDune::TypeTree::AccumulateType< Tree, Policy >Statically accumulate a type over the nodes of a TypeTree
 CDune::TypeTree::AccumulateValue< Tree, Functor, Reduction, startValue, ParentChildReduction >Statically accumulate a value over the nodes of a TypeTree
 CDune::TypeTree::AdvancedFilterBase class for advanced filters
 CDune::TypeTree::AdvancedFilterTagTag describing an advanced filter that has full control over the construction of the list of FilterEntries
 CDune::TypeTree::AlwaysVoid< typename >
 CDune::TypeTree::and_< result_type >Statically combine two values of type result_type using &&
 CDune::TypeTree::AdvancedFilter::apply< Node, Children >Apply this filter to the given node and children
 CDune::TypeTree::filter< Filter >::apply< Node, Children >Apply the filter
 CDune::TypeTree::FilterResult< FilterEntries >::apply< Node >
 CDune::TypeTree::SimpleFilter::apply< Child, new_index, old_index >Applies the filter to the given child node
 Cstd::array< T >STL class
 CDune::TypeTree::CompositeNode< Children >::Child< k >Access to the type and storage type of the i-th child
 CDune::TypeTree::FilteredCompositeNode< Node, Filter >::Child< k >Access to the type and storage type of the i-th child
 CDune::TypeTree::PowerNode< T, k >::Child< i >Access to the type and storage type of the i-th child
 CDune::TypeTree::StaticChildAccessors< Node >::Child
 CDune::TypeTree::CompositeNode< Children >Base class for composite nodes based on variadic templates
 CDune::TypeTree::CompositeNodeTagTag designating a composite node
 Cstd::array< ChildStorageType, k >::const_iterator
 Cstd::array< T, capacity >::const_iterator
 Cstd::basic_string< char >::const_iterator
 Cstd::basic_string< char16_t >::const_iterator
 Cstd::basic_string< char32_t >::const_iterator
 Cstd::basic_string< char8_t >::const_iterator
 Cstd::basic_string< wchar_t >::const_iterator
 Cstd::basic_string_view< char >::const_iterator
 Cstd::basic_string_view< char16_t >::const_iterator
 Cstd::basic_string_view< char32_t >::const_iterator
 Cstd::basic_string_view< char8_t >::const_iterator
 Cstd::basic_string_view< wchar_t >::const_iterator
 Cstd::array< ChildStorageType, k >::const_reverse_iterator
 Cstd::array< T, capacity >::const_reverse_iterator
 Cstd::basic_string< char >::const_reverse_iterator
 Cstd::basic_string< char16_t >::const_reverse_iterator
 Cstd::basic_string< char32_t >::const_reverse_iterator
 Cstd::basic_string< char8_t >::const_reverse_iterator
 Cstd::basic_string< wchar_t >::const_reverse_iterator
 Cstd::basic_string_view< char >::const_reverse_iterator
 Cstd::basic_string_view< char16_t >::const_reverse_iterator
 Cstd::basic_string_view< char32_t >::const_reverse_iterator
 Cstd::basic_string_view< char8_t >::const_reverse_iterator
 Cstd::basic_string_view< wchar_t >::const_reverse_iterator
 CDune::TypeTree::Detail::ContainerFactory< LeafToValue >
 CDune::TypeTree::DefaultPairVisitorVisitor interface and base class for visitors of pairs of TypeTrees
 CDune::TypeTree::DefaultVisitorVisitor interface and base class for TypeTree visitors
 CDune::TypeTree::DynamicTraversalMixin base class for visitors that only need a dynamic TreePath during traversal
 CDune::TypeTree::evaluate_if_meta_function< F >Meta function that evaluates its argument iff it inherits from meta_function
 CDune::Exception
 CDune::TypeTree::filter< Filter >Adapter class that takes a SimpleFilter, validated it and turns it into an AdvancedFilter
 CDune::TypeTree::FilteredCompositeNode< Node, Filter >Base class for composite nodes representing a filtered view on an underlying composite node
 CDune::TypeTree::FilterEntry< new_k, old_k >A filter entry describing the mapping of one child in the filtered node
 CDune::TypeTree::FilterResult< FilterEntries >The result of a filter
 CDune::first_type< T >
 CDune::first_type< T0, T... >
 CDune::TypeTree::FixedCapacityStackView< T >
 CDune::TypeTree::GenericCompositeNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >
 CDune::TypeTree::GenericLeafNodeTransformation< SourceNode, Transformation, TransformedNode >
 CDune::TypeTree::GenericPowerNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >
 CDune::TypeTree::has_implementation_tag< T >
 CDune::TypeTree::has_implementation_tag_value< T, V >
 CDune::TypeTree::has_node_tag< T >
 CDune::TypeTree::has_node_tag_value< T, V >
 CDune::TypeTree::HybridTreePath< T >A hybrid version of TreePath that supports both compile time and run time indices
 CDune::TypeTree::FixedCapacityStackView< T >::Impl
 Cstd::array< ChildStorageType, k >::iterator
 Cstd::array< T, capacity >::iterator
 Cstd::basic_string< char >::iterator
 Cstd::basic_string< char16_t >::iterator
 Cstd::basic_string< char32_t >::iterator
 Cstd::basic_string< char8_t >::iterator
 Cstd::basic_string< wchar_t >::iterator
 Cstd::basic_string_view< char >::iterator
 Cstd::basic_string_view< char16_t >::iterator
 Cstd::basic_string_view< char32_t >::iterator
 Cstd::basic_string_view< char8_t >::iterator
 Cstd::basic_string_view< wchar_t >::iterator
 CDune::TypeTree::StaticChildAccessors< Node >::lazy_enabled
 CDune::TypeTree::lazy_evaluate< F >Helper meta function to delay evaluation of F
 CDune::TypeTree::lazy_identity< F >Identity function
 CDune::TypeTree::LeafNodeBase class for leaf nodes in a dune-typetree
 CDune::TypeTree::LeafNodeTagTag designating a leaf node
 CDune::TypeTree::Detail::LeafToDefaultConstructibleValue< LeafToValue >
 CDune::TypeTree::max< result_type >Statically combine two values of type result_type by returning their maximum
 CDune::TypeTree::has_implementation_tag_value< T, V >::maybe< N >
 CDune::TypeTree::has_node_tag_value< T, V >::maybe< N >
 CDune::TypeTree::meta_functionMarker tag declaring a meta function
 CDune::TypeTree::min< result_type >Statically combine two values of type result_type by returning their minimum
 CDune::TypeTree::minus< result_type >Statically combine two values of type result_type using -
 CDune::TypeTree::multiply< result_type >Statically combine two values of type result_type using *
 CDune::TypeTree::has_implementation_tag< T >::no
 CDune::TypeTree::has_implementation_tag_value< T, V >::no
 CDune::TypeTree::has_node_tag< T >::no
 CDune::TypeTree::has_node_tag_value< T, V >::no
 CDune::TypeTree::apply_to_tuple_policy::no_pass_indexDo not pass the index of the current tuple to the functor
 CDune::TypeTree::NodeInterfaceInterface for nodes in a dune-typetree
 CDune::TypeTree::or_< result_type >Statically combine two values of type result_type using ||
 CDune::TypeTree::apply_to_tuple_policy::pass_indexPass the index of the current tuple to the functor as its first argument in a std::integral_constant
 CDune::TypeTree::plus< result_type >Statically combine two values of type result_type using +
 CDune::TypeTree::PowerNode< T, k >Collect k instances of type T within a dune-typetree
 CDune::TypeTree::PowerNodeTagTag designating a power node
 CDune::TypeTree::ProxyNodeBase< Node, NodeTag >Tag-based dispatch to appropriate base class that provides necessary functionality
 CDune::TypeTree::ProxyNodeBase< Node, LeafNodeTag >ProxyNode base class for LeafNode
 CDune::TypeTree::ProxyNodeBase< Node, NodeTag< Node > >
 CDune::TypeTree::and_< result_type >::reduce< r1, r2 >
 CDune::TypeTree::max< result_type >::reduce< r1, r2 >
 CDune::TypeTree::min< result_type >::reduce< r1, r2 >
 CDune::TypeTree::minus< result_type >::reduce< r1, r2 >
 CDune::TypeTree::multiply< result_type >::reduce< r1, r2 >
 CDune::TypeTree::or_< result_type >::reduce< r1, r2 >
 CDune::TypeTree::plus< result_type >::reduce< r1, r2 >
 CDune::TypeTree::GenericCompositeNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >::result< TC >
 CDune::TypeTree::GenericPowerNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >::result< TC >
 CDune::TypeTree::SimpleCompositeNodeTransformation< SourceNode, Transformation, TransformedNode >::result< TC >
 CDune::TypeTree::SimplePowerNodeTransformation< SourceNode, Transformation, TransformedNode >::result< TC >
 CDune::TypeTree::TemplatizedGenericCompositeNodeTransformation< SourceNode, Transformation, TransformedNodeTemplate >::result< TC >
 CDune::TypeTree::TemplatizedGenericPowerNodeTransformation< SourceNode, Transformation, TransformedNodeTemplate >::result< TC >
 CDune::TypeTree::TemplatizedGenericCompositeNodeTransformation< SourceNode, Transformation, GenericCompositeNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >::template result >::result
 CDune::TypeTree::TemplatizedGenericPowerNodeTransformation< SourceNode, Transformation, GenericPowerNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >::template result >::result
 Cstd::array< ChildStorageType, k >::reverse_iterator
 Cstd::array< T, capacity >::reverse_iterator
 Cstd::basic_string< char >::reverse_iterator
 Cstd::basic_string< char16_t >::reverse_iterator
 Cstd::basic_string< char32_t >::reverse_iterator
 Cstd::basic_string< char8_t >::reverse_iterator
 Cstd::basic_string< wchar_t >::reverse_iterator
 Cstd::basic_string_view< char >::reverse_iterator
 Cstd::basic_string_view< char16_t >::reverse_iterator
 Cstd::basic_string_view< char32_t >::reverse_iterator
 Cstd::basic_string_view< char8_t >::reverse_iterator
 Cstd::basic_string_view< wchar_t >::reverse_iterator
 CDune::TypeTree::SimpleCompositeNodeTransformation< SourceNode, Transformation, TransformedNode >
 CDune::TypeTree::SimpleFilterDefault simple filter that accepts any node and leaves its child structure unchanged
 CDune::TypeTree::SimpleFilterTagTag describing a simple filter that can only decide whether or not to include a single given child
 CDune::TypeTree::SimpleLeafNodeTransformation< SourceNode, Transformation, TransformedNode >
 CDune::TypeTree::SimplePowerNodeTransformation< SourceNode, Transformation, TransformedNode >
 CDune::TypeTree::StaticChildAccessors< ProxiedNode >Mixin class providing methods for child access with compile-time parameter
 CDune::TypeTree::StaticChildAccessors< Node >
 CDune::TypeTree::StaticTraversalMixin base class for visitors that require a static TreePath during traversal
 CProxiedNode::template Child
 CDune::TypeTree::TemplatizedGenericCompositeNodeTransformation< SourceNode, Transformation, TransformedNodeTemplate >
 CDune::TypeTree::TemplatizedGenericCompositeNodeTransformation< SourceNode, Transformation, GenericCompositeNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >::template result >
 CDune::TypeTree::TemplatizedGenericPowerNodeTransformation< SourceNode, Transformation, TransformedNodeTemplate >
 CDune::TypeTree::TemplatizedGenericPowerNodeTransformation< SourceNode, Transformation, GenericPowerNodeTransformationTemplate< SourceNode, Transformation, TransformedNode >::template result >
 CDune::TypeTree::TransformTree< SourceTree, Transformation, Tag, recursive >Transform a TypeTree
 CDune::TypeTree::Detail::TreeContainerVectorBackend< Container >
 CDune::TypeTree::TreeInfo< Tree, Tag >Struct for obtaining some basic structural information about a TypeTree
 CDune::TypeTree::TreePathBack< typename >
 CDune::TypeTree::TreePathBack< HybridTreePath< index_constant< k >, index_constant< l >... > >
 CDune::TypeTree::TreePathConcat< typename, typename >
 CDune::TypeTree::TreePathConcat< HybridTreePath< index_constant< i >... >, HybridTreePath< index_constant< k >... > >
 CDune::TypeTree::TreePathFront< typename >
 CDune::TypeTree::TreePathPopBack< typename,... >
 CDune::TypeTree::TreePathPopBack< HybridTreePath< index_constant< k > >, i... >
 CDune::TypeTree::TreePathPopBack< HybridTreePath< index_constant< k >, index_constant< l >... >, i..., j >
 CDune::TypeTree::TreePathPopFront< typename >
 CDune::TypeTree::TreePathPopFront< HybridTreePath< index_constant< k >, index_constant< i >... > >
 CDune::TypeTree::TreePathPushBack< typename, size_t >
 CDune::TypeTree::TreePathPushBack< HybridTreePath< index_constant< i >... >, k >
 CDune::TypeTree::TreePathPushFront< typename, size_t >
 CDune::TypeTree::TreePathPushFront< HybridTreePath< index_constant< i >... >, k >
 CDune::TypeTree::TreePathSize< typename >
 CDune::TypeTree::TypeAccumulationPolicy< Functor, Reduction, StartType, ParentChildReduction, ReductionAlgorithm >
 Cdecltypeimpl::isTreePathtypename std::decay::typenullptr
 CDune::TypeTree::SimpleFilter::validate< Node >Validates the combination of filter and node
 CDune::TypeTree::VisitDirectChildren::VisitChild< Node1, Child1, Node2, Child2, TreePath >Template struct for determining whether or not to visit a given child
 CDune::TypeTree::VisitTree::VisitChild< Node1, Child1, Node2, Child2, TreePath >Template struct for determining whether or not to visit a given child
 CDune::TypeTree::VisitDirectChildrenMixin base class for visitors that only want to visit the direct children of a node
 CDune::TypeTree::VisitTreeMixin base class for visitors that want to visit the complete tree
 CDune::TypeTree::has_implementation_tag< T >::yes
 CDune::TypeTree::has_implementation_tag_value< T, V >::yes
 CDune::TypeTree::has_node_tag< T >::yes
 CDune::TypeTree::has_node_tag_value< T, V >::yes
 Cindex_constant