#include </home/guntram/tmp/GrAL/gral/cartesian2d/include/Gral/Grids/Cartesian2D/subrange.h>

Public Member Functions | |
| const Grid & | TheGrid () const |
| Anchor grid. | |
Constructors | |
| SubrangeReg2D () | |
| Empty subranges. | |
| SubrangeReg2D (const Grid &gg, const index_type &llv, const index_type &urv) | |
Subrange containing vertex indices [llv, urv] . | |
| SubrangeReg2D (const Grid &gg, int llx, int lly, int urx, int ury) | |
Subrange containing vertex indices [(llx,lly), (urx,ury)] . | |
| SubrangeReg2D (const Grid &gg, const index_type &llv_v, const index_type &urv_v, const index_type &llv_c, const index_type &urv_c) | |
Bounds | |
| const index_type & | ll () const |
| lower vertex index bound | |
| const index_type & | ur () const |
| upper vertex index bound | |
| int | llx () const |
| int | lly () const |
| int | urx () const |
| int | ury () const |
| index_type | low_vertex_index () const |
| index_type | high_vertex_index () const |
| index_type | beyond_vertex_index () const |
| index_type | low_cell_index () const |
| index_type | high_cell_index () const |
| index_type | beyond_cell_index () const |
Sequence iteration | |
| VertexIterator | FirstVertex () const |
| VertexIterator | EndVertex () const |
| EdgeIterator | FirstEdge () const |
| EdgeIterator | EndEdge () const |
| EdgeIterator | FirstFacet () const |
| EdgeIterator | EndFacet () const |
| CellIterator | FirstCell () const |
| CellIterator | EndCell () const |
| unsigned | NumOfVertices () const |
| unsigned | NumOfEdges () const |
| unsigned | NumOfFacets () const |
| unsigned | NumOfCells () const |
Cartesian size information | |
Number of elements in each direction | |
| int | NumOfXVertices () const |
| int | NumOfYVertices () const |
| int | NumOfXCells () const |
| int | NumOfYCells () const |
Element / handle conversion | |
Conversion to and from element handles | |
| vertex_handle | handle (Vertex const &V) const |
| Vertex | vertex (vertex_handle v) const |
| vertex_handle | MinVertexNum () const |
| vertex_handle | MaxVertexNum () const |
| Edge | edge (edge_handle e) const |
| edge_handle | MinEdgeNum () const |
| edge_handle | MaxEdgeNum () const |
| cell_handle | handle (Cell const &C) const |
| Cell | cell (cell_handle v) const |
| cell_handle | MinCellNum () const |
| cell_handle | MaxCellNum () const |
Static Public Member Functions | |
| static unsigned | dimension () |
| Combinatorial dimension. | |
Archetype handling | |
| |
|
typedef grid_type::archetype_iterator | archetype_iterator |
| typedef grid_type::archetype_type | archetype_type |
| typedef grid_type::archetype_handle | archetype_handle |
| static archetype_iterator | BeginArchetype () |
| static archetype_iterator | EndArchetype () |
| static archetype_type const & | Archetype (archetype_handle=0) |
| static archetype_type const & | ArchetypeOf (Cell const &) |
| static archetype_type const & | ArchetypeOf (cell_handle) |
| static archetype_handle | archetype_of (cell_handle) |
| static archetype_handle | archetype_of (Cell const &) |
| static unsigned | NumOfArchetypes () |
This class allows it to describe a rectangular subrange of a regular 2D-grid. It defines altered versions of the sequence iterators bounded by the range, but it does not behave like a (sub)grid, the underlying grid is still considered to be the original one. Especially there is no means to iterate over the boundary of the subrange.
Definition at line 39 of file subrange.h.
| GrAL::cartesian2d::SubrangeReg2D::SubrangeReg2D | ( | const Grid & | gg, | |
| const index_type & | llv_v, | |||
| const index_type & | urv_v, | |||
| const index_type & | llv_c, | |||
| const index_type & | urv_c | |||
| ) | [inline] |
Non-closed subrange
[llv_v,urv_v] is the vertex range, [llv_c,urv_c] is the cell range. This is a hack. Use with care
Definition at line 84 of file subrange.h.
1.5.8