Loading [MathJax]/extensions/tex2jax.js

Dune TypeTree (unstable)

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::IndexFilter< indices >Filter class for FilteredCompositeNode that selects the children with the given indices
 CDune::TypeTree::AdvancedFilterTagTag describing an advanced filter that has full control over the construction of the list of FilterEntries
 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::SimpleFilter::apply< Child, new_index, old_index >Applies the filter to the given child node
 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< ProxiedNode >::Child< k >Access to the type and storage type of the i-th child
 CDune::TypeTree::CompositeNode< Children >Base class for composite nodes based on variadic templates
 CDune::TypeTree::CompositeNodeTagTag designating a composite node
 CDune::TypeTree::Experimental::DefaultHybridVisitorHybrid visitor interface and base class for TypeTree hybrid visitors
 CDune::TypeTree::DefaultPairVisitorVisitor interface and base class for visitors of pairs of TypeTrees
 CDune::TypeTree::DirectChildrenPairVisitorConvenience base class for visiting the direct children of a node pair
 CDune::TypeTree::TreePairVisitorConvenience base class for visiting an entire tree pair
 CDune::TypeTree::DefaultVisitorVisitor interface and base class for TypeTree visitors
 CDune::TypeTree::DirectChildrenVisitorConvenience base class for visiting the direct children of a node
 CDune::TypeTree::TreeVisitorConvenience base class for visiting the entire tree
 CDune::TypeTree::DynamicPowerNode< T >Collect multiple instances of type T within a dune-typetree
 CDune::TypeTree::DynamicPowerNodeTagTag designating a power node with runtime degree
 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::TypeTree::ExceptionBase class for all TypeTree exceptions
 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::TypeTree::HybridTreePath< T >A hybrid version of TreePath that supports both compile time and run time indices
 CDune::TypeTree::IsTreePath< T >Check if type represents a tree path
 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::max< result_type >Statically combine two values of type result_type by returning their maximum
 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::NodeInterfaceInterface for nodes in a dune-typetree
 CDune::TypeTree::or_< result_type >Statically combine two values of type result_type using ||
 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::ProxyNode< Node >Base class for nodes acting as a proxy for an existing node
 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::StaticChildAccessors< ProxiedNode >Mixin class providing methods for child access with compile-time parameter
 CDune::TypeTree::DynamicChildAccessors< ProxiedNode >Mixin class providing methods for child access with run-time parameter
 CDune::TypeTree::StaticChildAccessors< Node >
 CDune::TypeTree::DynamicChildAccessors< Node >
 CDune::TypeTree::ProxyNodeBase< Node, DynamicPowerNodeTag >ProxyNode base class for DynamicPowerNode
 CDune::TypeTree::ProxyNodeBase< Node, PowerNodeTag >ProxyNode base class for PowerNode
 CDune::TypeTree::ProxyNodeBase< Node, CompositeNodeTag >ProxyNode base class for CompositeNode
 CDune::TypeTree::StaticTraversalMixin base class for visitors that require a static TreePath during traversal
 CDune::TypeTree::TransformTree< SourceTree, Transformation, Tag, recursive >Transform a TypeTree
 CDune::TypeTree::TreeInfo< Tree, Tag >Struct for obtaining some basic structural information about a TypeTree
 CDune::TypeTree::TypeAccumulationPolicy< Functor, Reduction, StartType, ParentChildReduction, ReductionAlgorithm >
 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::DirectChildrenPairVisitorConvenience base class for visiting the direct children of a node pair
 CDune::TypeTree::DirectChildrenVisitorConvenience base class for visiting the direct children of a node
 CDune::TypeTree::VisitTreeMixin base class for visitors that want to visit the complete tree
 CDune::TypeTree::TreePairVisitorConvenience base class for visiting an entire tree pair
 CDune::TypeTree::TreeVisitorConvenience base class for visiting the entire tree
Creative Commons License   |  Legal Statements / Impressum  |  Hosted by TU Dresden & Uni Heidelberg  |  generated with Hugo v0.111.3 (Mar 31, 22:53, 2025)