Dune::PDELab::Experimental::GridFunctionSpace< DFBasis, VBE, CE >::Ordering Struct Reference

Root of the ordering tree. More...

#include <dune/pdelab/gridfunctionspace/dunefunctionsgridfunctionspace.hh>

Inheritance diagram for Dune::PDELab::Experimental::GridFunctionSpace< DFBasis, VBE, CE >::Ordering:

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
typedef CompositeNodeTag	NodeTag
typedef std::tuple< std::shared_ptr< Children >... >	NodeStorage
typedef std::tuple< Children... >	ChildTypes

Public Member Functions
	Ordering (const GridFunctionSpace &gfs)
size_type	size (ContainerIndex suffix) const
size_type	size () const
size_type	blockCount () const
	Same as size(), because block size is always 1.
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.
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.
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 ()
Child< k >::Type &	child (index_constant< k >={})
const Child< k >::Type &	child (index_constant< k >={}) const
ImplementationDefined &	child (Indices... indices)
const ImplementationDefined &	child (Indices... indices)
Child< k >::Type &	child (index_constant< k >={})
const Child< k >::Type &	child (index_constant< k >={}) const
ImplementationDefined &	child (Indices... indices)
const ImplementationDefined &	child (Indices... indices)
std::shared_ptr< typename Child< k >::Type >	childStorage (index_constant< k >={})
std::shared_ptr< const typename Child< k >::Type >	childStorage (index_constant< k >={}) const
std::shared_ptr< typename Child< k >::Type >	childStorage (index_constant< k >={})
std::shared_ptr< const typename Child< k >::Type >	childStorage (index_constant< k >={}) const
void	setChild (typename Child< k >::Type &child, index_constant< k >={})
void	setChild (typename Child< k >::Type &&child, index_constant< k >={})
void	setChild (std::shared_ptr< typename Child< k >::Type > child, index_constant< k >={})
void	setChild (typename Child< k >::Type &child, index_constant< k >={})
void	setChild (typename Child< k >::Type &&child, index_constant< k >={})
void	setChild (std::shared_ptr< typename Child< k >::Type > child, index_constant< k >={})
const NodeStorage &	nodeStorage () const
const NodeStorage &	nodeStorage () const

Static Public Member Functions
static constexpr auto	degree ()

Static Public Attributes
static const bool	consume_tree_index = false
static const bool	isLeaf
static const bool	isPower
static const bool	isComposite

Friends
class	LocalFunctionSpace< GridFunctionSpace >

Detailed Description

template<typename DFBasis, typename VBE, typename CE>
struct Dune::PDELab::Experimental::GridFunctionSpace< DFBasis, VBE, CE >::Ordering

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.

---

The documentation for this struct was generated from the following file:

• dunefunctionsgridfunctionspace.hh