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