dune-pdelab
2.7-git
|
Root of the ordering tree. More...
#include <dune/pdelab/gridfunctionspace/dunefunctionsgridfunctionspace.hh>
Public Types | |
using | Traits = typename LeafOrdering::Traits |
using | DOFIndex = typename Traits::DOFIndex |
using | ContainerIndex = typename Traits::ContainerIndex |
using | size_type = std::size_t |
using | CacheTag = DuneFunctionsCacheTag |
using | ContainerAllocationTag = FlatContainerAllocationTag |
Public Member Functions | |
Ordering (const GridFunctionSpace &gfs) | |
size_type | size () const |
size_type | blockCount () const |
Same as size(), because block size is always 1. More... | |
size_type | maxLocalSize () const |
bool | contains (typename Traits::SizeType codim) const |
Returns true if there is at least one entity of the given codim for which data needs to be communicated. More... | |
bool | fixedSize (typename Traits::SizeType codim) const |
True if for all entities of the given codim the same number of data items has to be communicated. More... | |
template<typename CIOutIterator , typename DIOutIterator = DummyDOFIndexIterator> | |
Traits::SizeType | extract_entity_indices (const typename Traits::DOFIndex::EntityIndex &ei, typename Traits::SizeType child_index, CIOutIterator ci_out, const CIOutIterator ci_end) const |
void | update () |
Static Public Attributes | |
static const bool | consume_tree_index = false |
Root of the ordering tree.
PDELab requires ordering trees to have at least two nodes even if the corresponding basis tree consists of a single node only. So here is an artificial root node to please PDELab. All it does is forward all method calls to its single child.