340 struct Edge {  struct
341     enum class Type { kInner, kOuter, kConnector };
342     Edge(Vertex* top, Vertex* bottom, int winding, Type type)  in Edge()  function
365     int      fWinding;          // 1 == edge goes downward; -1 = edge goes upward.
366     Vertex*  fTop;              // The top vertex in vertex-sort-order (sweep_lt).
367     Vertex*  fBottom;           // The bottom vertex in vertex-sort-order.
368     Type     fType;
369     Edge*    fLeft;             // The linked list of edges in the active edge list.
370     Edge*    fRight;            // "
371     Edge*    fPrevEdgeAbove;    // The linked list of edges in the bottom Vertex's "edges above".
372     Edge*    fNextEdgeAbove;    // "
373     Edge*    fPrevEdgeBelow;    // The linked list of edges in the top Vertex's "edges below".
374     Edge*    fNextEdgeBelow;    // "
375     Poly*    fLeftPoly;         // The Poly to the left of this edge, if any.
376     Poly*    fRightPoly;        // The Poly to the right of this edge, if any.
377     Event*   fEvent;
378     Edge*    fLeftPolyPrev;
379     Edge*    fLeftPolyNext;
380     Edge*    fRightPolyPrev;
381     Edge*    fRightPolyNext;
382     bool     fOverlap;          // True if there's an overlap region adjacent to this edge.
383     bool     fUsedInLeftPoly;
384     bool     fUsedInRightPoly;
385     Line     fLine;
386     double dist(const SkPoint& p) const {  in dist()
389     bool isRightOf(Vertex* v) const {  in isRightOf()
392     bool isLeftOf(Vertex* v) const {  in isLeftOf()
395     void recompute() {  in recompute()
398     bool intersect(const Edge& other, SkPoint* p, uint8_t* alpha = nullptr) const {  in intersect()