Dune::Capabilities::hasEntity< IdentityGrid< HostGrid >, codim > | |
Dune::Capabilities::hasHangingNodes< IdentityGrid< HostGrid > > | |
Dune::IdentityGrid< HostGrid > | [ provides Dune::Grid ] |
Dune::IdentityGridEntity< codim, dim, GridImp > | The implementation of entities in a IdentityGridA 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 |
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 |
Dune::IdentityGridEntityPointer< codim, GridImp > | |
Dune::IdentityGridFamily< dim, HostGrid > | |
Dune::IdentityGridGeometry< mydim, coorddim, GridImp > | |
Dune::IdentityGridGlobalIdSet< GridImp > | |
Dune::IdentityGridHierarchicIterator< GridImp > | Iterator over the descendants of an entity.Mesh entities of codimension 0 ("elements") allow to visit all entities of codimension 0 obtained through nested, hierarchic refinement of the entity. Iteration over this set of entities is provided by the HierarchicIterator, starting from a given entity |
Dune::IdentityGridLeafIndexSet< GridImp > | |
Dune::IdentityGridLeafIntersection< GridImp > | An intersection with a leaf neighbor elementMesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element! |
Dune::IdentityGridLeafIntersectionIterator< GridImp > | Iterator over all element neighborsMesh entities of codimension 0 ("elements") allow to visit all neighbors, where a neighbor is an entity of codimension 0 which has a common entity of codimension 1 These neighbors are accessed via a IntersectionIterator. This allows the implement non-matching meshes. The number of neighbors may be different from the number of an element! |
Dune::IdentityGridLeafIterator< codim, pitype, GridImp > | Iterator over all entities of a given codimension and level of a grid |
Dune::IdentityGridLevelIndexSet< GridImp > | |
Dune::IdentityGridLevelIntersection< GridImp > | |
Dune::IdentityGridLevelIntersectionIterator< GridImp > | |
Dune::IdentityGridLevelIterator< codim, pitype, GridImp > | Iterator over all entities of a given codimension and level of a grid |
Dune::IdentityGridLocalIdSet< GridImp > | |
Dune::IdentityGridMakeableEntity< codim, dim, GridImp > | |
IdSet | |
IndexSet | |
Dune::Capabilities::isLeafwiseConforming< IdentityGrid< HostGrid > > | |
Dune::Capabilities::isLevelwiseConforming< IdentityGrid< HostGrid > > | |
Dune::Capabilities::isParallel< IdentityGrid< HostGrid > > | |