A simple node to range map using the nested tree indices.
More...
#include <HierarchicNodeToRangeMap.hpp>
|
template<class Node , class TreePath , class Range , REQUIRES(Concepts::HasIndexAccess< Range, Dune::index_constant< 0 >>) > |
decltype(auto) | operator() (const Node &node, const TreePath &treePath, Range &&y) const |
|
template<class Node , class TreePath , class Range , REQUIRES(not Concepts::HasIndexAccess< Range, Dune::index_constant< 0 >>) > |
decltype(auto) | operator() (const Node &node, const TreePath &treePath, Range &&y) const |
|
A simple node to range map using the nested tree indices.
This map directly uses the tree path entries of the given node to access the nested container.
If the container does not provide any operator[] access, it is simply forwarded for all nodes.
The documentation for this struct was generated from the following file: