Specialization for codim-0-entities. More...

#include <dune/grid/identitygrid/identitygridentity.hh>

Public Types
typedef IdentityGridLevelIntersectionIterator< GridImp >	LevelIntersectionIterator
	The Iterator over intersections on this level.

typedef IdentityGridLeafIntersectionIterator< GridImp >	LeafIntersectionIterator
	The Iterator over intersections on the leaf level.

typedef IdentityGridHierarchicIterator< GridImp >	HierarchicIterator
	Iterator over descendants of the entity.

typedef GridImp::template Codim< 0 >::EntitySeed	EntitySeed
	The type of the EntitySeed interface class.

Public Member Functions
	IdentityGridEntity (const IdentityGridEntity &original)

IdentityGridEntity &	operator= (const IdentityGridEntity &original)

IdentityGridEntity &	operator= (IdentityGridEntity &&original)

bool	hasFather () const
	returns true if father entity exists

EntitySeed	seed () const
	Create EntitySeed.

int	level () const
	Level of this element.

PartitionType	partitionType () const
	The partition type for parallel computing.

Geometry	geometry () const
	Geometry of this entity.

unsigned int	subEntities (unsigned int codim) const
	Return the number of subEntities of codimension codim.

template<int cc>
GridImp::template Codim< cc >::Entity	subEntity (int i) const
	Provide access to sub entity i of given codimension. Entities are numbered 0 ... subEntities(cc)-1.

IdentityGridLevelIntersectionIterator< GridImp >	ilevelbegin () const
	First level intersection.

IdentityGridLevelIntersectionIterator< GridImp >	ilevelend () const
	Reference to one past the last neighbor.

IdentityGridLeafIntersectionIterator< GridImp >	ileafbegin () const
	First leaf intersection.

IdentityGridLeafIntersectionIterator< GridImp >	ileafend () const
	Reference to one past the last leaf intersection.

bool	isLeaf () const
	returns true if Entity has NO children

GridImp::template Codim< 0 >::Entity	father () const

LocalGeometry	geometryInFather () const
	Location of this element relative to the reference element element of the father. This is sufficient to interpolate all dofs in conforming case. Nonconforming may require access to neighbors of father and computations with local coordinates. On the fly case is somewhat inefficient since dofs are visited several times. If we store interpolation matrices, this is tolerable. We assume that on-the-fly implementation of numerical algorithms is only done for simple discretizations. Assumes that meshes are nested.

IdentityGridHierarchicIterator< GridImp >	hbegin (int maxLevel) const
	Inter-level access to son elements on higher levels<=maxlevel. This is provided for sparsely stored nested unstructured meshes. Returns iterator to first son.

IdentityGridHierarchicIterator< GridImp >	hend (int maxLevel) const
	Returns iterator to one past the last son.

bool	wasRefined () const

bool	mightBeCoarsened () const

GeometryType	type () const
	Return the name of the reference element. The type can be used to access the Dune::ReferenceElement.

Static Public Attributes
static constexpr int	codimension
	know your own codimension

static constexpr int	dimension
	Dimension of the grid.

static constexpr int	mydimension
	Know dimension of the entity.

Detailed Description

template<int dim, class GridImp>
class Dune::IdentityGridEntity< 0, dim, GridImp >

Specialization for codim-0-entities.

This class embodies the topological parts of elements of the grid. It has an extended interface compared to the general entity class. For example, Entities of codimension 0 allow to visit all neighbors.