110 for (
auto ele_id : ele_ids_near_ply)
114 if (e->getDimension() == 1)
119 if (!e->isBoundaryElement())
124 for (
unsigned i = 0; i < e->getNumberOfEdges(); i++)
126 auto* edge = e->getEdge(i);
129 std::vector<std::size_t> edge_node_distances_along_ply;
130 if (includesAllEdgeNodeIDs(node_ids_on_poly, *edge,
131 edge_node_distances_along_ply))
133 auto* new_edge = modifyEdgeNodeOrdering(
134 *edge, ply, edge_node_distances_along_ply,
136 if (edge != new_edge)
156 std::size_t dist1 = std::distance(
157 node_ids_on_poly.begin(),
158 std::find(node_ids_on_poly.begin(),
159 node_ids_on_poly.end(), getNodeIndex(*e1, 0)));
160 std::size_t dist2 = std::distance(
161 node_ids_on_poly.begin(),
162 std::find(node_ids_on_poly.begin(),
163 node_ids_on_poly.end(), getNodeIndex(*e2, 0)));
164 return (dist1 < dist2);