Lines Matching defs:Edge
50 struct Edge;
143 Edge* makeEdge(Vertex* prev, Vertex* next, EdgeType type, const Comparator&) const;
144 void setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
146 void setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
148 void mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
150 void mergeEdgesBelow(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
152 Edge* makeConnectingEdge(Vertex* prev, Vertex* next, EdgeType, const Comparator&,
155 static void FindEnclosingEdges(Vertex* v, EdgeList* edges, Edge** left, Edge** right);
156 void mergeCollinearEdges(Edge* edge, EdgeList* activeEdges, Vertex** current,
158 bool splitEdge(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
160 bool intersectEdgePair(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current,
164 void computeBisector(Edge* edge1, Edge* edge2, Vertex*) const;
165 bool checkForIntersection(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current,
201 // x <- Edge splits at x. New breadcrumb triangle is: [a, b, x].
282 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
283 Edge* fLastEdgeAbove; // "
284 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
285 Edge* fLastEdgeBelow; // "
286 Edge* fLeftEnclosingEdge; // Nearest edge in the AEL left of this vertex.
287 Edge* fRightEnclosingEdge; // Nearest edge in the AEL right of this vertex.
361 * An Edge joins a top Vertex to a bottom Vertex. Edge ordering for the list of "edges above" and
363 * Note that an Edge will give occasionally dist() != 0 for its own endpoints (because floating
378 struct GrTriangulator::Edge {
379 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type)
404 Edge* fLeft; // The linked list of edges in the active edge list.
405 Edge* fRight; // "
406 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above".
407 Edge* fNextEdgeAbove; // "
408 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below".
409 Edge* fNextEdgeBelow; // "
412 Edge* fLeftPolyPrev;
413 Edge* fLeftPolyNext;
414 Edge* fRightPolyPrev;
415 Edge* fRightPolyNext;
432 bool intersect(const Edge& other, SkPoint* p, uint8_t* alpha = nullptr) const;
437 Edge* fHead;
438 Edge* fTail;
439 void insert(Edge* edge, Edge* prev, Edge* next);
440 void insert(Edge* edge, Edge* prev);
441 void append(Edge* e) { insert(e, fTail, nullptr); }
442 void remove(Edge* edge);
454 bool contains(Edge* edge) const { return edge->fLeft || edge->fRight || fHead == edge; }
458 MonotonePoly(Edge* edge, Side side, int winding)
468 Edge* fFirstEdge;
469 Edge* fLastEdge;
473 void addEdge(Edge*);
479 Poly* addEdge(Edge* e, Side side, SkArenaAlloc* alloc);