83 std::array<simplex::internal::VisitedArray<simplex::IdSimplex>, 2>
85 std::array<simplex::internal::VisitedArray<simplex::IdSimplex>, 2>
Iterator & step_edge_mesh()
TopDimensionCofacesIterable::Iterator m_it
Iterator & step_depth_3()
Use breadth first search to find all d-simplices, and iterate through all cofaces in a d-simplex.
Tuple navigate_to_link(Tuple t)
bool operator!=(const Iterator &other) const
int64_t depth()
Compute the depth from the mesh and the simplex type.
Iterator(ClosedStarIterable &container, const Tuple &t=Tuple())
void init()
Depending on the depth, the iterator must be initialized differently.
ClosedStarIterable & m_container
bool step_faces_triangle()
Iterator & step_tri_mesh()
Iterator & step_tet_mesh()
bool step_faces_tetrahedron()
This iterator internally uses TopDimensionCofacesIterable.
std::array< simplex::internal::VisitedArray< simplex::IdSimplex >, 2 > m_visited_cofaces
TopDimensionCofacesIterable m_tdc_itrbl
TopDimensionCofacesIterable::Iterator m_it_end
ClosedStarIterable(const Mesh &mesh, const Simplex &simplex)
std::array< simplex::internal::VisitedArray< simplex::IdSimplex >, 2 > m_visited_link
const Tuple & tuple() const
Iterating through the d-simplices of a mesh can be done in different ways, depending on the simplex d...