DUNE PDELab (git)
hierarchy.hh
Go to the documentation of this file.
1// SPDX-FileCopyrightText: Copyright © DUNE Project contributors, see file LICENSE.md in module root
Portable very large unsigned integers.
Iterator over the levels in the hierarchy.
Definition: hierarchy.hh:120
T1 & dereference() const
Dereference the iterator.
Definition: hierarchy.hh:170
bool equals(const LevelIterator< typename std::remove_const< C >::type, typename std::remove_const< T1 >::type > &other) const
Equality check.
Definition: hierarchy.hh:154
bool isRedistributed() const
Check whether there was a redistribution at the current level.
Definition: hierarchy.hh:191
bool equals(const LevelIterator< const typename std::remove_const< C >::type, const typename std::remove_const< T1 >::type > &other) const
Equality check.
Definition: hierarchy.hh:163
void increment()
Move to the next coarser level.
Definition: hierarchy.hh:176
void decrement()
Move to the next fine level.
Definition: hierarchy.hh:182
LevelIterator(const LevelIterator< C_, T1_ > &other)
Copy constructor.
Definition: hierarchy.hh:138
T1 & getRedistributed() const
Get the redistributed container.
Definition: hierarchy.hh:200
T MemberType
The type of the container we store.
Definition: hierarchy.hh:45
LevelIterator< Hierarchy< T, A >, T > Iterator
Type of the mutable iterator.
Definition: hierarchy.hh:220
LevelIterator< const Hierarchy< T, A >, const T > ConstIterator
Type of the const iterator.
Definition: hierarchy.hh:223
typename std::allocator_traits< A >::template rebind_alloc< Element > Allocator
The allocator to use for the list elements.
Definition: hierarchy.hh:76
Facade class for stl conformant bidirectional iterators.
Definition: iteratorfacades.hh:275
Helper classes for the construction of classes without empty constructor.
Hierarchy(const Hierarchy &other)
Copy constructor (deep copy!).
Definition: hierarchy.hh:286
std::size_t levels() const
Get the number of levels in the hierarchy.
Definition: hierarchy.hh:326
ConstIterator coarsest() const
Get an iterator positioned at the coarsest level.
Definition: hierarchy.hh:399
void addCoarser(Arguments &args)
Add an element on a coarser level.
Definition: hierarchy.hh:338
void addFiner(Arguments &args)
Add an element on a finer level.
Definition: hierarchy.hh:360
Hierarchy(const std::shared_ptr< MemberType > &first)
Construct a new hierarchy.
Definition: hierarchy.hh:274
const void * Arguments
A type holding all the arguments needed to call the constructor.
Definition: construction.hh:44
static std::shared_ptr< T > construct(Arguments &args)
Construct an object with the specified arguments.
Definition: construction.hh:52
Iterator coarsest()
Get an iterator positioned at the coarsest level.
Definition: hierarchy.hh:387
ConstIterator finest() const
Get an iterator positioned at the finest level.
Definition: hierarchy.hh:393
Iterator finest()
Get an iterator positioned at the finest level.
Definition: hierarchy.hh:381
STL namespace.
Standard Dune debug streams.
A simple timing class.
|
Legal Statements / Impressum |
Hosted by TU Dresden |
generated with Hugo v0.111.3
(Nov 12, 23:30, 2024)