#include <dune/grid/albertagrid/agrid.hh>

Inheritance diagram for Dune::AlbertaGrid< dim, dimworld >:

Public Types
typedef AlbertaGridFamily< dim, dimworld >	GridFamily
	the grid family of AlbertaGrid

typedef GridFamily::ctype	ctype

typedef AlbertaGridFamily< dim, dimworld >::Traits	Traits

typedef Traits::LeafIndexSet	LeafIndexSet
	type of leaf index set

typedef Traits::LevelIndexSet	LevelIndexSet
	type of level index sets

typedef Traits::HierarchicIndexSet	HierarchicIndexSet
	type of hierarchic index set

typedef Traits::GlobalIdSet	GlobalIdSet
	type of global id set

typedef Traits::LocalIdSet	LocalIdSet
	type of local id set

typedef Traits::Communication	Communication
	type of communication

Exported types
typedef GridFamily::Traits::LeafGridView	LeafGridView
	type of view for leaf grid

typedef GridFamily::Traits::LevelGridView	LevelGridView
	type of view for level grid

typedef GridFamily::Traits::LeafIntersection	LeafIntersection
	A type that is a model of Dune::Intersection, an intersections of two codimension 1 of two codimension 0 entities in the leaf view.

typedef GridFamily::Traits::LevelIntersection	LevelIntersection
	A type that is a model of Dune::Intersection, an intersections of two codimension 1 of two codimension 0 entities in a level view.

typedef GridFamily::Traits::LeafIntersectionIterator	LeafIntersectionIterator
	A type that is a model of Dune::IntersectionIterator which is an iterator that allows to examine, but not to modify, the intersections of codimension 1 of an leaf element (entity of codimension 0) with other leaf elements.

typedef GridFamily::Traits::LevelIntersectionIterator	LevelIntersectionIterator
	A type that is a model of Dune::IntersectionIterator which is an iterator that allows to examine, but not to modify, the intersections of codimension 1 of an element (entity of codimension 0) with other elements on the same level.

typedef GridFamily::Traits::HierarchicIterator	HierarchicIterator
	A type that is a model of Dune::HierarchicIterator A type of iterator that allows to examine, but not to modify, entities of codimension 0 that result from refinement of an entity of codimension 0.

Public Member Functions
	AlbertaGrid (const This &)=delete

This &	operator= (const This &)=delete

	AlbertaGrid ()
	create an empty grid

	AlbertaGrid (const Alberta::MacroData< dimension > &macroData, const std::shared_ptr< DuneBoundaryProjection< dimensionworld > > &projection=std::shared_ptr< DuneBoundaryProjection< dimensionworld > >())
	create a grid from an ALBERTA macro data structure

template<class Proj , class Impl >
	AlbertaGrid (const Alberta::MacroData< dimension > &macroData, const Alberta::ProjectionFactoryInterface< Proj, Impl > &projectionFactory)

	AlbertaGrid (const std::string &macroGridFileName)
	create a grid from an ALBERTA macro grid file

	~AlbertaGrid ()
	destructor

int	maxLevel () const

template<int cd, PartitionIteratorType pitype>
Traits::template Codim< cd >::template Partition< pitype >::LevelIterator	lbegin (int level) const
	Iterator to first entity of given codim on level.

template<int cd, PartitionIteratorType pitype>
Traits::template Codim< cd >::template Partition< pitype >::LevelIterator	lend (int level) const
	one past the end on this level

template<int codim>
Traits::template Codim< codim >::LevelIterator	lbegin (int level) const
	Iterator to first entity of given codim on level.

template<int codim>
Traits::template Codim< codim >::LevelIterator	lend (int level) const
	one past the end on this level

template<int codim, PartitionIteratorType pitype>
Traits::template Codim< codim >::template Partition< pitype >::LeafIterator	leafbegin () const
	return LeafIterator which points to first leaf entity

template<int codim, PartitionIteratorType pitype>
Traits::template Codim< codim >::template Partition< pitype >::LeafIterator	leafend () const
	return LeafIterator which points behind last leaf entity

template<int codim>
Traits::template Codim< codim >::LeafIterator	leafbegin () const
	return LeafIterator which points to first leaf entity

template<int codim>
Traits::template Codim< codim >::LeafIterator	leafend () const
	return LeafIterator which points behind last leaf entity

int	size (int level, int codim) const
	Number of grid entities per level and codim because lbegin and lend are none const, and we need this methods counting the entities on each level, you know.

int	size (int level, GeometryType type) const
	number of entities per level and geometry type in this process

int	size (int codim) const
	number of leaf entities per codim in this process

int	size (GeometryType type) const
	number of leaf entities per geometry type in this process

std::size_t	numBoundarySegments () const
	number of boundary segments within the macro grid

Traits::LevelGridView	levelGridView (int level) const
	View for a grid level for All_Partition.

Traits::LeafGridView	leafGridView () const
	View for the leaf grid for All_Partition.

int	getMark (const typename Traits::template Codim< 0 >::Entity &e) const
	returns adaptation mark for given entity

bool	mark (int refCount, const typename Traits::template Codim< 0 >::Entity &e)
	Marks an entity to be refined/coarsened in a subsequent adapt.

void	globalRefine (int refCount)
	uses the interface, mark on entity and refineLocal

template<class DataHandle >
void	globalRefine (int refCount, AdaptDataHandleInterface< This, DataHandle > &handle)

bool	adapt ()
	Refine all positive marked leaf entities, coarsen all negative marked entities if possible.

template<class DataHandle >
bool	adapt (AdaptDataHandleInterface< This, DataHandle > &handle)
	callback adapt method with AdaptDataHandleInterface

bool	preAdapt ()
	returns true, if a least one element is marked for coarsening

void	postAdapt ()
	clean up some markers

const Communication &	comm () const
	return reference to communication, if MPI found this is specialisation for MPI

template<class EntitySeed >
Traits::template Codim< EntitySeed::codimension >::Entity	entity (const EntitySeed &seed) const
	obtain Entity from EntitySeed.

bool	writeGrid (const std::string &filename, ctype time) const
	write Grid to file in Xdr

bool	readGrid (const std::string &filename, ctype &time)
	read Grid from file filename and store time of mesh in time

const HierarchicIndexSet &	hierarchicIndexSet () const

const Traits::LevelIndexSet &	levelIndexSet (int level) const
	return level index set for given level

const Traits::LeafIndexSet &	leafIndexSet () const
	return leaf index set

const GlobalIdSet &	globalIdSet () const
	return global IdSet

const LocalIdSet &	localIdSet () const
	return local IdSet

ALBERTA MESH *	getMesh () const

const MeshPointer &	meshPointer () const

const DofNumbering &	dofNumbering () const

const LevelProvider &	levelProvider () const

int	dune2alberta (int codim, int i) const

int	alberta2dune (int codim, int i) const

int	generic2alberta (int codim, int i) const

int	alberta2generic (int codim, int i) const

const Alberta::GlobalVector &	getCoord (const ElementInfo &elementInfo, int vertex) const

template<int codim, PartitionIteratorType pitype>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LevelIterator	lbegin (int level) const

template<int codim, PartitionIteratorType pitype>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LevelIterator	lend (int level) const

template<int codim>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LevelIterator	lbegin (int level) const

template<int codim>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LevelIterator	lend (int level) const

template<int codim, PartitionIteratorType pitype>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LeafIterator	leafbegin () const

template<int codim, PartitionIteratorType pitype>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LeafIterator	leafend () const

template<int codim>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LeafIterator	leafbegin () const

template<int codim>
AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LeafIterator	leafend () const

Traits::LeafIntersectionIterator	ileafbegin (const typename Traits::template Codim< 0 >::Entity &entity) const
	obtain begin intersection iterator on the leaf level

Traits::LeafIntersectionIterator	ileafend (const typename Traits::template Codim< 0 >::Entity &entity) const
	obtain end intersection iterator on the leaf level

Traits::LevelIntersectionIterator	ilevelbegin (const typename Traits::template Codim< 0 >::Entity &entity) const
	obtain begin intersection iterator on the entity level

Traits::LevelIntersectionIterator	ilevelend (const typename Traits::template Codim< 0 >::Entity &entity) const
	obtain end intersection iterator on the entity level

bool	mark (int refCount, const typename Traits ::template Codim< 0 >::Entity &e)
	Marks an entity to be refined/coarsened in a subsequent adapt.

bool	loadBalance ()
	default implementation of load balance does nothing and returns false

template<class DataHandle >
bool	loadBalance (DataHandle &data)
	default implementation of load balance does nothing and returns false

Adaptivity and grid refinement
bool	mark (int refCount, const typename Codim< 0 >::Entity &e)
	Marks an entity to be refined/coarsened in a subsequent adapt.

int	getMark (const typename Codim< 0 >::Entity &e) const
	returns adaptation mark for given entity

Static Public Member Functions
static std::string	typeName ()

template<int codim>
static int	getTwist (const typename Traits::template Codim< codim >::Entity &entity)

template<int codim>
static int	getTwist (const typename Traits::template Codim< 0 >::Entity &entity, int subEntity)

static int	getTwistInInside (const typename Traits::LeafIntersection &intersection)

static int	getTwistInOutside (const typename Traits::LeafIntersection &intersection)

Static Public Attributes
static const int	dimension = GridFamily::dimension

static const int	dimensionworld = GridFamily::dimensionworld

Protected Member Functions
Parallel data distribution and communication
GridImp &	asImp ()
	Barton-Nackman trick.

const GridImp &	asImp () const
	Barton-Nackman trick.

Detailed Description

template<int dim, int dimworld = Alberta::dimWorld>
class Dune::AlbertaGrid< dim, dimworld >

[ provides Dune::Grid ]

Simplicial grid implementation from the ALBERTA finite element toolbox

AlbertaGrid provides access to the grid from the ALBERTA finite element toolbox through the Dune interface.

ALBERTA is a finite element toolbox written by Alfred Schmidt and Kunibert G. Siebert (see http://www.alberta-fem.de). It contains a simplicial mesh in 1, 2 and 3 space dimensions that can be dynamically adapted by a bisection algorithm.

Supported ALBERTA versions include 3.0 or higher. It can be downloaded from the ALBERTA website (https://gitlab.mathematik.uni-stuttgart.de/ians-nmh/alberta/alberta3).

After installing ALBERTA, just configure DUNE with the cmake option -DAlberta_ROOT=[path/to/alberta] and provide the path to ALBERTA.

Each program linking to ALBERTA only supports a fixed dimension of world. This is obtained from the ALBERTA_DIM preprocessor variable. This variable and all other necessary link flags and libraries are set by the cmake function add_dune_alberta_flags(WORLDDIM [N] [targets]...) with N the world dimension.

CMake sets the compile flag HAVE_ALBERTA that tells you whether ALBERTA was found, and ALBERTA_DIM compile flags which tells you the dimension of world for this program.

Member Typedef Documentation

◆ Communication

template<int dim, int dimworld = Alberta::dimWorld>

typedef Traits::Communication Dune::AlbertaGrid< dim, dimworld >::Communication

type of communication

◆ ctype

template<int dim, int dimworld = Alberta::dimWorld>

typedef GridFamily::ctype Dune::AlbertaGrid< dim, dimworld >::ctype

◆ GlobalIdSet

template<int dim, int dimworld = Alberta::dimWorld>

typedef Traits::GlobalIdSet Dune::AlbertaGrid< dim, dimworld >::GlobalIdSet

type of global id set

◆ GridFamily

template<int dim, int dimworld = Alberta::dimWorld>

typedef AlbertaGridFamily< dim, dimworld > Dune::AlbertaGrid< dim, dimworld >::GridFamily

the grid family of AlbertaGrid

◆ HierarchicIndexSet

template<int dim, int dimworld = Alberta::dimWorld>

typedef Traits::HierarchicIndexSet Dune::AlbertaGrid< dim, dimworld >::HierarchicIndexSet

type of hierarchic index set

◆ HierarchicIterator

template<int dim, int dimworld, class ct , class GridFamily >

typedef GridFamily::Traits::HierarchicIterator Dune::Grid< dim, dimworld, ct, GridFamily >::HierarchicIterator

inherited

A type that is a model of Dune::HierarchicIterator A type of iterator that allows to examine, but not to modify, entities of codimension 0 that result from refinement of an entity of codimension 0.

◆ LeafGridView

template<int dim, int dimworld, class ct , class GridFamily >

typedef GridFamily::Traits::LeafGridView Dune::Grid< dim, dimworld, ct, GridFamily >::LeafGridView

inherited

type of view for leaf grid

◆ LeafIndexSet

template<int dim, int dimworld = Alberta::dimWorld>

typedef Traits::LeafIndexSet Dune::AlbertaGrid< dim, dimworld >::LeafIndexSet

type of leaf index set

◆ LeafIntersection

template<int dim, int dimworld, class ct , class GridFamily >

typedef GridFamily::Traits::LeafIntersection Dune::Grid< dim, dimworld, ct, GridFamily >::LeafIntersection

inherited

A type that is a model of Dune::Intersection, an intersections of two codimension 1 of two codimension 0 entities in the leaf view.

◆ LeafIntersectionIterator

template<int dim, int dimworld, class ct , class GridFamily >

typedef GridFamily::Traits::LeafIntersectionIterator Dune::Grid< dim, dimworld, ct, GridFamily >::LeafIntersectionIterator

inherited

A type that is a model of Dune::IntersectionIterator which is an iterator that allows to examine, but not to modify, the intersections of codimension 1 of an leaf element (entity of codimension 0) with other leaf elements.

◆ LevelGridView

template<int dim, int dimworld, class ct , class GridFamily >

typedef GridFamily::Traits::LevelGridView Dune::Grid< dim, dimworld, ct, GridFamily >::LevelGridView

inherited

type of view for level grid

◆ LevelIndexSet

template<int dim, int dimworld = Alberta::dimWorld>

typedef Traits::LevelIndexSet Dune::AlbertaGrid< dim, dimworld >::LevelIndexSet

type of level index sets

◆ LevelIntersection

template<int dim, int dimworld, class ct , class GridFamily >

typedef GridFamily::Traits::LevelIntersection Dune::Grid< dim, dimworld, ct, GridFamily >::LevelIntersection

inherited

A type that is a model of Dune::Intersection, an intersections of two codimension 1 of two codimension 0 entities in a level view.

◆ LevelIntersectionIterator

template<int dim, int dimworld, class ct , class GridFamily >

typedef GridFamily::Traits::LevelIntersectionIterator Dune::Grid< dim, dimworld, ct, GridFamily >::LevelIntersectionIterator

inherited

A type that is a model of Dune::IntersectionIterator which is an iterator that allows to examine, but not to modify, the intersections of codimension 1 of an element (entity of codimension 0) with other elements on the same level.

◆ LocalIdSet

template<int dim, int dimworld = Alberta::dimWorld>

typedef Traits::LocalIdSet Dune::AlbertaGrid< dim, dimworld >::LocalIdSet

type of local id set

◆ Traits

template<int dim, int dimworld = Alberta::dimWorld>

typedef AlbertaGridFamily<dim,dimworld>::Traits Dune::AlbertaGrid< dim, dimworld >::Traits

Constructor & Destructor Documentation

◆ AlbertaGrid() [1/5]

template<int dim, int dimworld = Alberta::dimWorld>

Dune::AlbertaGrid< dim, dimworld >::AlbertaGrid ( const This & )

delete

◆ AlbertaGrid() [2/5]

template<int dim, int dimworld>

Dune::AlbertaGrid< dim, dimworld >::AlbertaGrid ( )

inline

create an empty grid

◆ AlbertaGrid() [3/5]

template<int dim, int dimworld>

Dune::AlbertaGrid< dim, dimworld >::AlbertaGrid	(	const Alberta::MacroData< dimension > &	macroData,
		const std::shared_ptr< DuneBoundaryProjection< dimensionworld > > &	projection = `std::shared_ptr< DuneBoundaryProjection< dimensionworld > >()`
	)

inline

create a grid from an ALBERTA macro data structure

Parameters

[in]	macroData	macro data to create grid from
[in]	projection	shared pointer to a global boundary projection (defaults to 0)

◆ AlbertaGrid() [4/5]

template<int dim, int dimworld>

template<class Proj , class Impl >

Dune::AlbertaGrid< dim, dimworld >::AlbertaGrid	(	const Alberta::MacroData< dimension > &	macroData,
		const Alberta::ProjectionFactoryInterface< Proj, Impl > &	projectionFactory
	)

inline

◆ AlbertaGrid() [5/5]

template<int dim, int dimworld>

Dune::AlbertaGrid< dim, dimworld >::AlbertaGrid ( const std::string & macroGridFileName )

inline

create a grid from an ALBERTA macro grid file

Parameters

[in] macroGridFileName name of the macro grid file

◆ ~AlbertaGrid()

template<int dim, int dimworld>

Dune::AlbertaGrid< dim, dimworld >::~AlbertaGrid ( )

inline

destructor

Member Function Documentation

◆ adapt() [1/2]

template<int dim, int dimworld>

bool Dune::AlbertaGrid< dim, dimworld >::adapt ( )

inline

Refine all positive marked leaf entities, coarsen all negative marked entities if possible.

\return true if a least one entity was refined

The complete adaptation process works as follows:

- mark entities with the mark() method
- call preAdapt()
- if preAdapt() returned true: possibly save current solution
- call adapt()
- if adapt() returned true: possibly interpolate the (saved) solution
- call postAdapt()

◆ adapt() [2/2]

template<int dim, int dimworld>

template<class DataHandle >

bool Dune::AlbertaGrid< dim, dimworld >::adapt ( AdaptDataHandleInterface< This, DataHandle > & handle )

inline

callback adapt method with AdaptDataHandleInterface

◆ alberta2dune()

template<int dim, int dimworld = Alberta::dimWorld>

int Dune::AlbertaGrid< dim, dimworld >::alberta2dune	(	int	codim,
		int	i
	)		const

inline

◆ alberta2generic()

template<int dim, int dimworld = Alberta::dimWorld>

int Dune::AlbertaGrid< dim, dimworld >::alberta2generic	(	int	codim,
		int	i
	)		const

inline

◆ asImp() [1/2]

template<int dim, int dimworld, class ct , class GridFamily >

GridImp & Dune::Grid< dim, dimworld, ct, GridFamily >::asImp ( )

inlineprotectedinherited

Barton-Nackman trick.

◆ asImp() [2/2]

template<int dim, int dimworld, class ct , class GridFamily >

const GridImp & Dune::Grid< dim, dimworld, ct, GridFamily >::asImp ( ) const

inlineprotectedinherited

Barton-Nackman trick.

◆ comm()

template<int dim, int dimworld = Alberta::dimWorld>

const Communication & Dune::AlbertaGrid< dim, dimworld >::comm ( ) const

inline

return reference to communication, if MPI found this is specialisation for MPI

◆ dofNumbering()

template<int dim, int dimworld = Alberta::dimWorld>

const DofNumbering & Dune::AlbertaGrid< dim, dimworld >::dofNumbering ( ) const

inline

◆ dune2alberta()

template<int dim, int dimworld = Alberta::dimWorld>

int Dune::AlbertaGrid< dim, dimworld >::dune2alberta	(	int	codim,
		int	i
	)		const

inline

◆ entity()

template<int dim, int dimworld = Alberta::dimWorld>

template<class EntitySeed >

Traits::template Codim< EntitySeed::codimension >::Entity Dune::AlbertaGrid< dim, dimworld >::entity ( const EntitySeed & seed ) const

inline

obtain Entity from EntitySeed.

◆ generic2alberta()

template<int dim, int dimworld = Alberta::dimWorld>

int Dune::AlbertaGrid< dim, dimworld >::generic2alberta	(	int	codim,
		int	i
	)		const

inline

◆ getCoord()

template<int dim, int dimworld>

const Alberta::GlobalVector & Dune::AlbertaGrid< dim, dimworld >::getCoord	(	const ElementInfo &	elementInfo,
		int	vertex
	)		const

inline

◆ getMark() [1/2]

template<int dim, int dimworld, class ct , class GridFamily >

int Dune::Grid< dim, dimworld, ct, GridFamily >::getMark ( const typename Codim< 0 >::Entity & e ) const

inlineinherited

returns adaptation mark for given entity

Parameters

[in] e Entity for which adaptation mark should be determined

Returns: int adaptation mark currently set for given Entity e

◆ getMark() [2/2]

template<int dim, int dimworld>

int Dune::AlbertaGrid< dim, dimworld >::getMark ( const typename Traits::template Codim< 0 >::Entity & e ) const

inline

returns adaptation mark for given entity

Parameters

[in] e Entity for which adaptation mark should be determined

Returns: int adaptation mark currently set for given Entity e

◆ getMesh()

template<int dim, int dimworld = Alberta::dimWorld>

ALBERTA MESH * Dune::AlbertaGrid< dim, dimworld >::getMesh ( ) const

inline

◆ getTwist() [1/2]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

static int Dune::AlbertaGrid< dim, dimworld >::getTwist	(	const typename Traits::template Codim< 0 >::Entity &	entity,
		int	subEntity
	)

inlinestatic

◆ getTwist() [2/2]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

static int Dune::AlbertaGrid< dim, dimworld >::getTwist ( const typename Traits::template Codim< codim >::Entity & entity )

inlinestatic

◆ getTwistInInside()

template<int dim, int dimworld = Alberta::dimWorld>

static int Dune::AlbertaGrid< dim, dimworld >::getTwistInInside ( const typename Traits::LeafIntersection & intersection )

inlinestatic

◆ getTwistInOutside()

template<int dim, int dimworld = Alberta::dimWorld>

static int Dune::AlbertaGrid< dim, dimworld >::getTwistInOutside ( const typename Traits::LeafIntersection & intersection )

inlinestatic

◆ globalIdSet()

template<int dim, int dimworld = Alberta::dimWorld>

const GlobalIdSet & Dune::AlbertaGrid< dim, dimworld >::globalIdSet ( ) const

inline

return global IdSet

◆ globalRefine() [1/2]

template<int dim, int dimworld>

void Dune::AlbertaGrid< dim, dimworld >::globalRefine ( int refCount )

inline

uses the interface, mark on entity and refineLocal

◆ globalRefine() [2/2]

template<int dim, int dimworld>

template<class DataHandle >

void Dune::AlbertaGrid< dim, dimworld >::globalRefine	(	int	refCount,
		AdaptDataHandleInterface< This, DataHandle > &	handle
	)

inline

◆ hierarchicIndexSet()

template<int dim, int dimworld = Alberta::dimWorld>

const HierarchicIndexSet & Dune::AlbertaGrid< dim, dimworld >::hierarchicIndexSet ( ) const

inline

◆ ileafbegin()

template<int dim, int dimworld, class ct , class GridFamily >

Traits::LeafIntersectionIterator Dune::GridDefaultImplementation< dim, dimworld, ct, GridFamily >::ileafbegin ( const typename Traits::template Codim< 0 >::Entity & entity ) const

inlineinherited

obtain begin intersection iterator on the leaf level

◆ ileafend()

template<int dim, int dimworld, class ct , class GridFamily >

Traits::LeafIntersectionIterator Dune::GridDefaultImplementation< dim, dimworld, ct, GridFamily >::ileafend ( const typename Traits::template Codim< 0 >::Entity & entity ) const

inlineinherited

obtain end intersection iterator on the leaf level

◆ ilevelbegin()

template<int dim, int dimworld, class ct , class GridFamily >

Traits::LevelIntersectionIterator Dune::GridDefaultImplementation< dim, dimworld, ct, GridFamily >::ilevelbegin ( const typename Traits::template Codim< 0 >::Entity & entity ) const

inlineinherited

obtain begin intersection iterator on the entity level

◆ ilevelend()

template<int dim, int dimworld, class ct , class GridFamily >

Traits::LevelIntersectionIterator Dune::GridDefaultImplementation< dim, dimworld, ct, GridFamily >::ilevelend ( const typename Traits::template Codim< 0 >::Entity & entity ) const

inlineinherited

obtain end intersection iterator on the entity level

◆ lbegin() [1/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int cd, PartitionIteratorType pitype>

Traits::template Codim< cd >::template Partition< pitype >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lbegin ( int level ) const

Iterator to first entity of given codim on level.

◆ lbegin() [2/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

Traits::template Codim< codim >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lbegin ( int level ) const

Iterator to first entity of given codim on level.

◆ lbegin() [3/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim, PartitionIteratorType pitype>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lbegin ( int level ) const

inline

◆ lbegin() [4/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lbegin ( int level ) const

inline

◆ leafbegin() [1/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim, PartitionIteratorType pitype>

Traits::template Codim< codim >::template Partition< pitype >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafbegin ( ) const

return LeafIterator which points to first leaf entity

◆ leafbegin() [2/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

Traits::template Codim< codim >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafbegin ( ) const

return LeafIterator which points to first leaf entity

◆ leafbegin() [3/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim, PartitionIteratorType pitype>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafbegin ( ) const

inline

◆ leafbegin() [4/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafbegin ( ) const

inline

◆ leafend() [1/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim, PartitionIteratorType pitype>

Traits::template Codim< codim >::template Partition< pitype >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafend ( ) const

return LeafIterator which points behind last leaf entity

◆ leafend() [2/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

Traits::template Codim< codim >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafend ( ) const

return LeafIterator which points behind last leaf entity

◆ leafend() [3/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim, PartitionIteratorType pitype>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafend ( ) const

inline

◆ leafend() [4/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LeafIterator Dune::AlbertaGrid< dim, dimworld >::leafend ( ) const

inline

◆ leafGridView()

template<int dim, int dimworld = Alberta::dimWorld>

Traits::LeafGridView Dune::AlbertaGrid< dim, dimworld >::leafGridView ( ) const

inline

View for the leaf grid for All_Partition.

◆ leafIndexSet()

template<int dim, int dimworld>

const AlbertaGrid< dim, dimworld >::Traits::LeafIndexSet & Dune::AlbertaGrid< dim, dimworld >::leafIndexSet ( ) const

inline

return leaf index set

◆ lend() [1/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int cd, PartitionIteratorType pitype>

Traits::template Codim< cd >::template Partition< pitype >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lend ( int level ) const

one past the end on this level

◆ lend() [2/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

Traits::template Codim< codim >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lend ( int level ) const

one past the end on this level

◆ lend() [3/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim, PartitionIteratorType pitype>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::template Partition< pitype >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lend ( int level ) const

inline

◆ lend() [4/4]

template<int dim, int dimworld = Alberta::dimWorld>

template<int codim>

AlbertaGrid< dim, dimworld >::Traits::template Codim< codim >::LevelIterator Dune::AlbertaGrid< dim, dimworld >::lend ( int level ) const

inline

◆ levelGridView()

template<int dim, int dimworld = Alberta::dimWorld>

Traits::LevelGridView Dune::AlbertaGrid< dim, dimworld >::levelGridView ( int level ) const

inline

View for a grid level for All_Partition.

◆ levelIndexSet()

template<int dim, int dimworld>

const AlbertaGrid< dim, dimworld >::Traits::LevelIndexSet & Dune::AlbertaGrid< dim, dimworld >::levelIndexSet ( int level ) const

inline

return level index set for given level

◆ levelProvider()

template<int dim, int dimworld = Alberta::dimWorld>

const LevelProvider & Dune::AlbertaGrid< dim, dimworld >::levelProvider ( ) const

inline

◆ loadBalance() [1/2]

template<int dim, int dimworld, class ct , class GridFamily >

bool Dune::GridDefaultImplementation< dim, dimworld, ct, GridFamily >::loadBalance ( )

inlineinherited

default implementation of load balance does nothing and returns false

◆ loadBalance() [2/2]

template<int dim, int dimworld, class ct , class GridFamily >

template<class DataHandle >

bool Dune::GridDefaultImplementation< dim, dimworld, ct, GridFamily >::loadBalance ( DataHandle & data )

inlineinherited

default implementation of load balance does nothing and returns false

◆ localIdSet()

template<int dim, int dimworld = Alberta::dimWorld>

const LocalIdSet & Dune::AlbertaGrid< dim, dimworld >::localIdSet ( ) const

inline

return local IdSet

◆ mark() [1/3]

template<int dim, int dimworld, class ct , class GridFamily >

bool Dune::Grid< dim, dimworld, ct, GridFamily >::mark	(	int	refCount,
		const typename Codim< 0 >::Entity &	e
	)

inlineinherited

Marks an entity to be refined/coarsened in a subsequent adapt.

Parameters

[in]	refCount	Number of subdivisions that should be applied. Negative value means coarsening.
[in]	e	Entity that should be marked

Returns: true if Entity was marked, false otherwise.

◆ mark() [2/3]

template<int dim, int dimworld, class ct , class GridFamily >

bool Dune::GridDefaultImplementation< dim, dimworld, ct, GridFamily >::mark	(	int	refCount,
		const typename Traits ::template Codim< 0 >::Entity &	e
	)

inlineinherited

Marks an entity to be refined/coarsened in a subsequent adapt.

Parameters

[in]	refCount	Number of subdivisions that should be applied. Negative value means coarsening.
[in]	e	Entity to Entity that should be refined

Returns: true if Entity was marked, false otherwise.

Note

default implementation is: return false; for grids with no adaptation.
for the grid programmer: this method is implemented as a template method, because the Entity type is not defined when the class is instantiated You won't need this trick in the implementation. In your implementation you should use it as
bool mark( int refCount,

typename Traits::template Codim<0>::Entity & e ).

Dune::AlbertaGrid::mark
bool mark(int refCount, const typename Traits::template Codim< 0 >::Entity &e)
Marks an entity to be refined/coarsened in a subsequent adapt.
Definition albertagrid.cc:385

Dune::AlbertaGridFamily::Traits::Codim
Definition albertagrid/gridfamily.hh:117

Dune::Grid::Codim
A Traits struct that collects all associated types of one implementation.
Definition common/grid.hh:411

This template method will vanish due to the inheritance rules.

◆ mark() [3/3]

template<int dim, int dimworld>

bool Dune::AlbertaGrid< dim, dimworld >::mark	(	int	refCount,
		const typename Traits::template Codim< 0 >::Entity &	e
	)

inline

Marks an entity to be refined/coarsened in a subsequent adapt.

Parameters

[in]	refCount	Number of subdivisions that should be applied. Negative value means coarsening.
[in]	e	Entity that should be marked

Returns: true if Entity was marked, false otherwise.

◆ maxLevel()

template<int dim, int dimworld>

int Dune::AlbertaGrid< dim, dimworld >::maxLevel ( ) const

inline

Return maximum level defined in this grid. Levels are numbered 0 ... maxLevel with 0 the coarsest level.

◆ meshPointer()

template<int dim, int dimworld = Alberta::dimWorld>

const MeshPointer & Dune::AlbertaGrid< dim, dimworld >::meshPointer ( ) const

inline

◆ numBoundarySegments()

template<int dim, int dimworld = Alberta::dimWorld>

std::size_t Dune::AlbertaGrid< dim, dimworld >::numBoundarySegments ( ) const

inline

number of boundary segments within the macro grid

◆ operator=()

template<int dim, int dimworld = Alberta::dimWorld>

This & Dune::AlbertaGrid< dim, dimworld >::operator= ( const This & )

delete

◆ postAdapt()

template<int dim, int dimworld>

void Dune::AlbertaGrid< dim, dimworld >::postAdapt ( )

inline

clean up some markers

◆ preAdapt()

template<int dim, int dimworld>

bool Dune::AlbertaGrid< dim, dimworld >::preAdapt ( )

inline

returns true, if a least one element is marked for coarsening

◆ readGrid()

template<int dim, int dimworld>

bool Dune::AlbertaGrid< dim, dimworld >::readGrid	(	const std::string &	filename,
		ctype &	time
	)

inline

read Grid from file filename and store time of mesh in time

◆ size() [1/4]

template<int dim, int dimworld>

int Dune::AlbertaGrid< dim, dimworld >::size ( GeometryType type ) const

inline

number of leaf entities per geometry type in this process

◆ size() [2/4]

template<int dim, int dimworld>

int Dune::AlbertaGrid< dim, dimworld >::size ( int codim ) const

inline

number of leaf entities per codim in this process

◆ size() [3/4]

template<int dim, int dimworld>

int Dune::AlbertaGrid< dim, dimworld >::size	(	int	level,
		GeometryType	type
	)		const

inline

number of entities per level and geometry type in this process

◆ size() [4/4]

template<int dim, int dimworld>

int Dune::AlbertaGrid< dim, dimworld >::size	(	int	level,
		int	codim
	)		const

inline

Number of grid entities per level and codim because lbegin and lend are none const, and we need this methods counting the entities on each level, you know.

◆ typeName()

template<int dim, int dimworld = Alberta::dimWorld>

static std::string Dune::AlbertaGrid< dim, dimworld >::typeName ( )

inlinestatic

◆ writeGrid()

template<int dim, int dimworld>

bool Dune::AlbertaGrid< dim, dimworld >::writeGrid	(	const std::string &	filename,
		ctype	time
	)		const

inline

write Grid to file in Xdr

Member Data Documentation

◆ dimension

template<int dim, int dimworld = Alberta::dimWorld>

const int Dune::AlbertaGrid< dim, dimworld >::dimension = GridFamily::dimension

static

◆ dimensionworld

template<int dim, int dimworld = Alberta::dimWorld>

const int Dune::AlbertaGrid< dim, dimworld >::dimensionworld = GridFamily::dimensionworld

static

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

Public Types

Public Member Functions

Static Public Member Functions

Static Public Attributes

Protected Member Functions

Detailed Description

Member Typedef Documentation

◆ Communication

◆ ctype

◆ GlobalIdSet

◆ GridFamily

◆ HierarchicIndexSet

◆ HierarchicIterator

◆ LeafGridView

◆ LeafIndexSet

◆ LeafIntersection

◆ LeafIntersectionIterator

◆ LevelGridView

◆ LevelIndexSet

◆ LevelIntersection

◆ LevelIntersectionIterator

◆ LocalIdSet

◆ Traits

Constructor & Destructor Documentation

◆ AlbertaGrid() [1/5]

◆ AlbertaGrid() [2/5]

◆ AlbertaGrid() [3/5]

◆ AlbertaGrid() [4/5]

◆ AlbertaGrid() [5/5]

◆ ~AlbertaGrid()

Member Function Documentation

◆ adapt() [1/2]

◆ adapt() [2/2]

◆ alberta2dune()

◆ alberta2generic()

◆ asImp() [1/2]

◆ asImp() [2/2]

◆ comm()

◆ dofNumbering()

◆ dune2alberta()

◆ entity()

◆ generic2alberta()

◆ getCoord()

◆ getMark() [1/2]

◆ getMark() [2/2]

◆ getMesh()

◆ getTwist() [1/2]

◆ getTwist() [2/2]

◆ getTwistInInside()

◆ getTwistInOutside()

◆ globalIdSet()

◆ globalRefine() [1/2]

◆ globalRefine() [2/2]

◆ hierarchicIndexSet()

◆ ileafbegin()

◆ ileafend()

◆ ilevelbegin()

◆ ilevelend()

◆ lbegin() [1/4]

◆ lbegin() [2/4]

◆ lbegin() [3/4]

◆ lbegin() [4/4]

◆ leafbegin() [1/4]

◆ leafbegin() [2/4]

◆ leafbegin() [3/4]

◆ leafbegin() [4/4]

◆ leafend() [1/4]

◆ leafend() [2/4]

◆ leafend() [3/4]

◆ leafend() [4/4]

◆ leafGridView()

◆ leafIndexSet()

◆ lend() [1/4]

◆ lend() [2/4]

◆ lend() [3/4]

◆ lend() [4/4]

◆ levelGridView()

◆ levelIndexSet()

◆ levelProvider()

◆ loadBalance() [1/2]