43 #ifndef HEXAHEDRALMESHITERATORS_HH
44 #define HEXAHEDRALMESHITERATORS_HH
46 #include "../Core/Iterators.hh"
73 for(
int i = 0; i < _n; ++i) {
80 for(
int i = 0; i < _n; ++i) {
86 for(
int i = 0; i < _n; ++i) {
92 for(
int i = 0; i < _n; ++i) {
102 std::vector<CellHandle> neighb_sheet_cell_hs_;
127 for(
int i = 0; i < _n; ++i) {
134 for(
int i = 0; i < _n; ++i) {
140 for(
int i = 0; i < _n; ++i) {
146 for(
int i = 0; i < _n; ++i) {
155 const EdgeHandle& common_edge()
const {
return common_edges_[cur_index_]; }
158 std::vector<HalfFaceHandle> adjacent_halffaces_;
159 std::vector<EdgeHandle> common_edges_;
200 for(
int i = 0; i < _n; ++i) {
207 for(
int i = 0; i < _n; ++i) {
213 for(
int i = 0; i < _n; ++i) {
219 for(
int i = 0; i < _n; ++i) {
229 std::vector<VertexHandle> vertices_;
Iterate over all vertices of a hexahedron in a specific order.
A data structure basing on PolyhedralMesh with specializations for hexahedra.