233 struct Edge {  struct
234     Edge(Vertex* top, Vertex* bottom, int winding)  in Edge()  function
248     int      fWinding;          // 1 == edge goes downward; -1 = edge goes upward.
249     Vertex*  fTop;              // The top vertex in vertex-sort-order (sweep_lt).
250     Vertex*  fBottom;           // The bottom vertex in vertex-sort-order.
251     Edge*    fLeft;             // The linked list of edges in the active edge list.
252     Edge*    fRight;            // "
253     Edge*    fPrevEdgeAbove;    // The linked list of edges in the bottom Vertex's "edges above".
254     Edge*    fNextEdgeAbove;    // "
255     Edge*    fPrevEdgeBelow;    // The linked list of edges in the top Vertex's "edges below".
256     Edge*    fNextEdgeBelow;    // "
257     Poly*    fLeftPoly;         // The Poly to the left of this edge, if any.
258     Poly*    fRightPoly;        // The Poly to the right of this edge, if any.
259     double   fDX;               // The line equation for this edge, in implicit form.
260     double   fDY;               // fDY * x + fDX * y + fC = 0, for point (x, y) on the line.
261     double   fC;
262     double dist(const SkPoint& p) const {  in dist()
265     bool isRightOf(Vertex* v) const {  in isRightOf()
268     bool isLeftOf(Vertex* v) const {  in isLeftOf()
271     void recompute() {  in recompute()
277     bool intersect(const Edge& other, SkPoint* p) {  in intersect()
304     bool isActive(EdgeList* activeEdges) const {  in isActive()