Dune::ALU2dGridEntity< 0, dim, GridImp > Class Template Reference

#include <dune/grid/alugrid/2d/entity.hh>

Public Types
typedef GridImp::template Codim< 0 >::Geometry	Geometry
	type of our Geometry interface
typedef GridImp::template Codim< 0 >::LocalGeometry	LocalGeometry
	type of corresponding interface local geometry
typedef GridImp::template Codim< 0 >::EntitySeed	EntitySeed
	typedef of my type
typedef LeafIntersectionIteratorWrapper< GridImp >	ALU2dGridLeafIntersectionIteratorType
	tpye of intersection iterator
typedef GridImp::template Codim< 0 >::Entity	Entity
	type of entity interface
typedef ALU2dGridEntityPointer< 0, GridImp >	EntityPointer
	tpye of entitypointer interface
enum
	know your own codimension
enum
	Dimension of the grid.
enum
	Know dimension of the entity.
typedef GridImp::ctype ctype	DUNE_DEPRECATED_MSG("Use Geometry::ctype instead!")
	define type used for coordinates in grid module

Public Member Functions
	ALU2dGridEntity (const FactoryType &factory, int level)
	Constructor creating empty Entity.
	ALU2dGridEntity (const ALU2dGridEntity &org)
	Constructor creating empty Entity.
int	level () const
	level of this element
Geometry	geometry () const
	geometry of this entity
GeometryType	type () const
	return type of geometry
template<int cc>
int	count () const
int	boundaryId () const
	Id of the boundary which is associated with the entity, returns 0 for inner entities, arbitrary int otherwise.
ALU2dGridIntersectionIteratorType	ibegin () const
ALU2dGridIntersectionIteratorType	iend () const
bool	isLeaf () const
	returns true if Entity is leaf (i.e. has no children)
EntityPointer	father () const
bool	hasFather () const
	returns true if father entity exists
ALU2dGridHierarchicIterator< GridImp >	hbegin (int maxLevel) const
ALU2dGridHierarchicIterator< GridImp >	hend (int maxLevel) const
	Returns iterator to one past the last son.
template<int cc>
Codim< cc >::EntityPointer	entity (int i) const
template<int codim>
Codim< codim >::EntityPointer	subEntity (int i) const
PartitionType	partitionType () const
	return partition type of this entity ( see grid.hh )
template<int cc>
int	subBoundaryId (int i) const
	The boundaryId of the i-th subentity of codimension cc More...
LocalGeometry	geometryInFather () const
bool	mightVanish () const
	The former state() method has been replaced by:
bool	mark (int refCount) const
int	getMark () const
	return current adaptation mark of element
void	setElement (const HElementType &element, int face=-1, int level=-1) const
void	reset (int l)
	set actual walk level
void	removeElement ()
	set item pointer to NULL
bool	equals (const ALU2dGridEntity< 0, dim, GridImp > &org) const
	compare 2 entities, which means compare the item pointers
EntitySeed	seed () const
	return seed of entity
const GridImp &	grid () const
	return reference to grid
const FactoryType &	factory () const
	return reference to factory
int	getIndex () const
	index is unique within the grid hierachie and per codim

Static Public Member Functions
static const int	DUNE_DEPRECATED_MSG ("Use Geometry::coorddimension instead!") dimensionworld
	know your own dimension of world

Detailed Description

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

A Grid is a container of grid entities. An entity is parametrized by the codimension. An entity of codimension c in dimension d is a d-c dimensional object.

Entities of codimension 0 ("elements") are defined through template specialization. Note that this specialization has an extended interface compared to the general case

Entities of codimension 0 allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 with the These neighbors are accessed via an iterator. This allows the implementation of non-matching meshes. The number of neigbors may be different from the number of faces/edges of an element!

Member Function Documentation

count()

template<int dim, class GridImp >

template<int cc>

int Dune::ALU2dGridEntity< 0, dim, GridImp >::count ( ) const

inline

Intra-element access to entities of codimension cc > codim. Return number of entities with codimension cc.

entity()

template<int dim, class GridImp >

template<int cc>

Codim< cc >::EntityPointer Dune::ALU2dGridEntity< 0, dim, GridImp >::entity

(

int

i

)

const

Provide access to mesh entity i of given codimension. Entities are numbered 0 ... count<cc>()-1

father()

template<int dim, class GridImp >

EntityPointer Dune::ALU2dGridEntity< 0, dim, GridImp >::father

(

)

const

Inter-level access to father element on coarser grid. Assumes that meshes are nested.

geometryInFather()

template<int dim, class GridImp >

LocalGeometry Dune::ALU2dGridEntity< 0, dim, GridImp >::geometryInFather

(

)

const

Location of this element relative to the reference 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.

hbegin()

template<int dim, class GridImp >

ALU2dGridHierarchicIterator< GridImp > Dune::ALU2dGridEntity< 0, dim, GridImp >::hbegin ( int  maxLevel ) const

inline

Inter-level access to son elements on higher levels<=maxlevel. This is provided for sparsely stored nested unstructured meshes. Returns iterator to first son.

References Dune::ALU2dGridEntity< cd, dim, GridImp >::factory().

ibegin()

template<int dim, class GridImp >

ALU2dGridIntersectionIteratorType Dune::ALU2dGridEntity< 0, dim, GridImp >::ibegin ( ) const

inline

Intra-level access to intersection with neighboring elements. A neighbor is an entity of codimension 0 which has an entity of codimension 1 in commen with this entity. Access to neighbors is provided using iterators. This allows meshes to be nonmatching. Returns iterator referencing the first neighbor.

Deprecated:

Use ileafbegin() instead. This method will be removed after Dune 2.3

iend()

template<int dim, class GridImp >

ALU2dGridIntersectionIteratorType Dune::ALU2dGridEntity< 0, dim, GridImp >::iend ( ) const

inline

Reference to one past the last intersection with neighbor

Deprecated:

Use ileafend() instead. This method will be removed after Dune 2.3

mark()

template<int dim, class GridImp >

bool Dune::ALU2dGridEntity< 0, dim, GridImp >::mark

(

int

refCount

)

const

marks an element for refCount refines. if refCount is negative the element is coarsend -refCount times mark returns true if element was marked, otherwise false

setElement()

template<int dim, class GridImp >

void Dune::ALU2dGridEntity< 0, dim, GridImp >::setElement	(	const HElementType &	element,
		int	face = -1,
		int	level = -1
	)		const

private methods, but public because of datahandle and template arguments of these methods

subBoundaryId()

template<int dim, class GridImp >

template<int cc>

int Dune::ALU2dGridEntity< 0, dim, GridImp >::subBoundaryId

(

int

i

)

const

The boundaryId of the i-th subentity of codimension cc

This does the same as entity<cc>(i).boundaryId(), but it is usually a lot faster.

subEntity()

template<int dim, class GridImp >

template<int codim>

Codim< codim >::EntityPointer Dune::ALU2dGridEntity< 0, dim, GridImp >::subEntity ( int  i ) const

inline

Provide access to mesh entity i of given codimension. Entities are numbered 0 ... count<cc>()-1

---

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

• dune/grid/alugrid/2d/entity.hh