363         , fLine(top, bottom) {  in Edge()
385     Line     fLine;  member
387         return fLine.dist(p);  in dist()
390         return fLine.dist(v->fPoint) < 0.0;  in isRightOf()
393         return fLine.dist(v->fPoint) > 0.0;  in isLeftOf()
396         fLine = Line(fTop, fBottom);  in recompute()
405         double denom = fLine.fA * other.fLine.fB - fLine.fB * other.fLine.fA;  in intersect()
411         double sNumer = dy * other.fLine.fB + dx * other.fLine.fA;  in intersect()
412         double tNumer = dy * fLine.fB + dx * fLine.fA;  in intersect()
421         p->fX = SkDoubleToScalar(fTop->fPoint.fX - s * fLine.fB);  in intersect()
422         p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fLine.fA);  in intersect()
1253                 Line line1 = left->fLine;  in check_for_intersection()
1254                 Line line2 = right->fLine;  in check_for_intersection()
1256                 line1.fC += sqrt(left->fLine.magSq()) * (left->fWinding > 0 ? 1 : -1) * dir;  in check_for_intersection()
1257                 line2.fC += sqrt(right->fLine.magSq()) * (right->fWinding > 0 ? 1 : -1) * dir;  in check_for_intersection()
1673     normal->set(SkDoubleToScalar(e->fLine.fA),  in get_edge_normal()
1674                 SkDoubleToScalar(e->fLine.fB));  in get_edge_normal()
1722                 join->fLine.normalize();  in simplify_boundary()
1723                 join->fLine = join->fLine * join->fWinding;  in simplify_boundary()
1879     Line prevInner(prevEdge->fLine);  in stroke_boundary()
1881     Line prevOuter(prevEdge->fLine);  in stroke_boundary()
1891         Line inner(e->fLine);  in stroke_boundary()
1893         Line outer(e->fLine);  in stroke_boundary()
1897         if (!prevEdge->fLine.nearParallel(e->fLine) && prevInner.intersect(inner, &innerPoint) &&  in stroke_boundary()
2031         e->fLine.normalize();  in extract_boundary()
2032         e->fLine = e->fLine * e->fWinding;  in extract_boundary()