Vector data-structure with tree-path index access and hierarchic structure given by the Container
template type.
More...
#include <TreeContainer.hpp>
Public Member Functions | |
TreeContainerStorage () | |
Default-construct the tree-container. | |
TreeContainerStorage (Container const &container) | |
Construct the tree-container from a given container storage. | |
TreeContainerStorage (Container &&container) | |
Construct the tree-container from a given container storage. | |
template<class... T> | |
decltype(auto) | operator[] (Dune::TypeTree::HybridTreePath< T... > const &path) const |
Access a (const) element of the container by treepath. | |
template<class... T> | |
decltype(auto) | operator[] (Dune::TypeTree::HybridTreePath< T... > const &path) |
Access a (mutable) element of the container by treepath. | |
Container const & | data () const |
Obtain the container (const) | |
Container & | data () |
Obtain the container (mutable) | |
bool | operator== (TreeContainerStorage const &other) const |
Compare two containers for equality. | |
bool | operator!= (TreeContainerStorage const &other) const |
Compare two containers for inequality. | |
Vector data-structure with tree-path index access and hierarchic structure given by the Container
template type.
This Vector container is parametrized with the actual container type that is stored internally. Access to the elements of the container is possible by using a tree-path index.
The internal container is constructed by the ContainerFactory, storing for each tree node a corresponding array or tuple plus a value. The data-structure to hold both, the value and the container is defined in InnerNodeStorage.