114 for (
auto ele_id : ele_ids_near_ply)
118 if (e->getDimension() == 1)
123 if (!e->isBoundaryElement())
128 for (
unsigned i = 0; i < e->getNumberOfEdges(); i++)
130 auto* edge = e->getEdge(i);
133 std::vector<std::size_t> edge_node_distances_along_ply;
134 if (includesAllEdgeNodeIDs(node_ids_on_poly, *edge,
135 edge_node_distances_along_ply))
137 auto* new_edge = modifyEdgeNodeOrdering(
138 *edge, ply, edge_node_distances_along_ply,
140 if (edge != new_edge)
160 std::size_t dist1 = std::distance(
161 node_ids_on_poly.begin(),
162 std::find(node_ids_on_poly.begin(),
163 node_ids_on_poly.end(), getNodeIndex(*e1, 0)));
164 std::size_t dist2 = std::distance(
165 node_ids_on_poly.begin(),
166 std::find(node_ids_on_poly.begin(),
167 node_ids_on_poly.end(), getNodeIndex(*e2, 0)));
168 return (dist1 < dist2);