template<
int dim>
struct internal::TriangulationImplementation::Strides< dim >
Strides of various arrays in a Triangulation.
The implementation of a Triangulation contains many arrays of subcell data, such as face orientations, neighbors, and the vertex index cache. For simplicity, we index those arrays by the largest stride required by all present ReferenceCell objects: e.g., if the only ReferenceCell is ReferenceCells::Tetrahedron then we only need to store 4 face orientations per cell (and thus the stride is 4), whereas if the Triangulation contains a Hexahedron then we store 6 per cell (and, for all cells, the stride is 6).
- Note
- Since refining a ReferenceCell produces the same ReferenceCell (except for ReferenceCells::Pyramid, which produces ReferenceCells::Tetrahedron and ReferenceCells::Pyramid), these strides only need to be set on level 0 and do not need to be updated during refinement (as a ReferenceCells::Tetrahedron has fewer vertices, lines, and faces then a ReferenceCells::Pyramid).
Definition at line 352 of file tria.h.