Lines Matching refs:edge
31 // Also tests active edge list forced into an invalid ordering by
171 // a split edge must remain active.
186 // Handle the case where edge.dist(edge.fTop) != 0.0.
246 // same edge to be added to more than one poly on the same side.
262 // A shape with a vertex collinear to the right hand edge.
275 // Exercises the case where an edge becomes collinear with *two* of its
350 // A path which hangs during simplification. It produces an edge which is
352 // right-enclosing-edge splitting.
372 // zombie edge.
385 // From crbug.com/844873. Crashes trying to merge a zombie edge.
412 // repeatedly splits on the opposite edge from case 34 above.
436 // This causes bad ordering in the active edge list.
524 // An edge collapse event which also collapses a neighbour, requiring
540 // An edge collapse event causes an edge to become collinear, requiring
606 // requires the active edge list to go out-of-order.
821 Edge edge{p0, p1};
822 // First check if this edge already exists in reverse.
823 auto reverseIter = edgeMap.find(edge.reverse());
827 ++edgeMap[edge];
843 for (auto [edge, count] : edges) {
844 // We should only have one ordering of any given edge.
845 SkASSERT(edges.find(edge.reverse()) == edges.end());
850 simplifiedEdges[edge] = count;
852 simplifiedEdges[edge.reverse()] = -count;
922 // verify that every inner polygon edge can be found in the triangulation.
923 for (auto [edge, count] : innerFanEdges) {
924 auto it = trianglePlusBreadcrumbEdges.find(edge);
932 it = trianglePlusBreadcrumbEdges.find(edge.reverse());
940 ERRORF(r, "error: %s: edge [%g,%g]:[%g,%g] not found in triangulation.",
941 shapeName, edge.fP0.fX, edge.fP0.fY, edge.fP1.fX, edge.fP1.fY);
952 for (auto [edge, count] : trianglePlusBreadcrumbEdges) {
954 if (edge.fP0.fX == edge.fP1.fX && !hasSpuriousVert) {
958 if (edge.fP0.fY == edge.fP1.fY && !hasSpuriousHorz) {
963 ERRORF(r, "error: %s: spurious edge [%g,%g]:[%g,%g] found in triangulation.",
964 shapeName, edge.fP0.fX, edge.fP0.fY, edge.fP1.fX, edge.fP1.fY);