#include <hierarchy.hh>
Because sometimes a redistribution of the parallel data might be advisable one can add redistributed version of the container at each level.
Public Types | |
typedef T | MemberType |
The type of the container we store. | |
typedef A::template rebind < Element >::other | Allocator |
If true only the method addCoarser will be usable otherwise only the method addFiner will be usable. | |
typedef LevelIterator < Hierarchy< T, A >, T > | Iterator |
Type of the mutable iterator. | |
typedef LevelIterator< const Hierarchy< T, A >, const T > | ConstIterator |
Type of the const iterator. | |
Public Member Functions | |
Hierarchy (MemberType &first) | |
Construct a new hierarchy. | |
Hierarchy () | |
Construct a new empty hierarchy. | |
void | addCoarser (Arguments &args) |
Add an element on a coarser level. | |
void | addFiner (Arguments &args) |
Add an element on a finer level. | |
Iterator | finest () |
Get an iterator positioned at the finest level. | |
Iterator | coarsest () |
Get an iterator positioned at the coarsest level. | |
ConstIterator | finest () const |
Get an iterator positioned at the finest level. | |
ConstIterator | coarsest () const |
Get an iterator positioned at the coarsest level. | |
int | levels () const |
Get the number of levels in the hierarchy. | |
~Hierarchy () | |
Destructor. | |
Classes | |
class | LevelIterator |
Iterator over the levels in the hierarchy. More... |
typedef A::template rebind<Element>::other Dune::Amg::Hierarchy< T, A >::Allocator |
If true only the method addCoarser will be usable otherwise only the method addFiner will be usable.
The allocator to use for the list elements.