47     struct Vertex;
134     void* emitTriangle(Vertex* prev, Vertex* curr, Vertex* next, int winding, void* data) const;
136     Poly* makePoly(Poly** head, Vertex* v, int winding) const;
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&,
154     void mergeVertices(Vertex* src, Vertex* dst, VertexList* mesh, const Comparator&) const;
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,
162     Vertex* makeSortedVertex(const SkPoint&, uint8_t alpha, VertexList* mesh, Vertex* reference,
164     void computeBisector(Edge* edge1, Edge* edge2, Vertex*) const;
165     bool checkForIntersection(Edge* left, Edge* right, EdgeList* activeEdges, Vertex** current,
266 struct GrTriangulator::Vertex {  struct
267   Vertex(const SkPoint& point, uint8_t alpha)  in Vertex()  argument
280     Vertex* fPrev;                // Linked list of contours, then Y-sorted vertices.  argument
281     Vertex* fNext;                // "  argument
288     Vertex* fPartner;             // Corresponding inner or outer vertex (for AA).  argument
299     VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {}  in VertexList()  argument
300     Vertex* fHead;
301     Vertex* fTail;
302     void insert(Vertex* v, Vertex* prev, Vertex* next);
303     void append(Vertex* v) { insert(v, fTail, nullptr); }  in append()
316     void prepend(Vertex* v) { insert(v, nullptr, fHead); }  in prepend()
317     void remove(Vertex* v);
332     Line(Vertex* p, Vertex* q) : Line(p->fPoint, q->fPoint) {}  in Line()
379     Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type)  in Edge()
401     Vertex*  fTop;              // The top vertex in vertex-sort-order (sweep_lt).
402     Vertex*  fBottom;           // The bottom vertex in vertex-sort-order.
426     bool isRightOf(Vertex* v) const { return this->dist(v->fPoint) < 0.0; }  in isRightOf()
427     bool isLeftOf(Vertex* v) const { return this->dist(v->fPoint) > 0.0; }  in isLeftOf()
429     void insertAbove(Vertex*, const Comparator&);
430     void insertBelow(Vertex*, const Comparator&);
477     Poly(Vertex* v, int winding);
480     Vertex* lastVertex() const { return fTail ? fTail->fLastEdge->fBottom : fFirstVertex; }  in lastVertex()
481     Vertex* fFirstVertex;