Lines Matching defs:fTop

236         , fTop(top)
249 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt).
272 fDX = static_cast<double>(fBottom->fPoint.fX) - fTop->fPoint.fX;
273 fDY = static_cast<double>(fBottom->fPoint.fY) - fTop->fPoint.fY;
274 fC = static_cast<double>(fTop->fPoint.fY) * fBottom->fPoint.fX -
275 static_cast<double>(fTop->fPoint.fX) * fBottom->fPoint.fY;
279 fTop->fID, fBottom->fID,
280 other.fTop->fID, other.fBottom->fID);
281 if (fTop == other.fTop || fBottom == other.fBottom) {
288 double dx = static_cast<double>(fTop->fPoint.fX) - other.fTop->fPoint.fX;
289 double dy = static_cast<double>(fTop->fPoint.fY) - other.fTop->fPoint.fY;
300 p->fX = SkDoubleToScalar(fTop->fPoint.fX + s * fDX);
301 p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fDY);
645 LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
651 LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
680 if ((c.sweep_gt(edge->fTop->fPoint, next->fTop->fPoint) && next->isRightOf(edge->fTop)) ||
681 (c.sweep_gt(next->fTop->fPoint, edge->fTop->fPoint) && edge->isLeftOf(next->fTop)) ||
697 if (edge->fBottom->fProcessed || !edge->fTop->fProcessed) {
700 } else if (edge->fTop->fProcessed && !edge->fBottom->fProcessed) {
709 if (edge->fTop->fPoint == edge->fBottom->fPoint ||
710 c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {
713 LOG("insert edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);
717 if (next->isRightOf(edge->fTop)) {
727 if (edge->fTop->fPoint == edge->fBottom->fPoint ||
728 c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {
731 LOG("insert edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);
745 LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID,
752 LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID,
753 edge->fTop->fID);
755 edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow);
762 LOG("erasing edge (%g -> %g)\n", edge->fTop->fID, edge->fBottom->fID);
774 edge->fTop = v;
791 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) {
793 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY,
799 } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) {
802 set_bottom(edge, other->fTop, activeEdges, c);
806 set_bottom(other, edge->fTop, activeEdges, c);
813 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY,
831 if (edge->fPrevEdgeAbove && (edge->fTop == edge->fPrevEdgeAbove->fTop ||
832 !edge->fPrevEdgeAbove->isLeftOf(edge->fTop))) {
834 } else if (edge->fNextEdgeAbove && (edge->fTop == edge->fNextEdgeAbove->fTop ||
835 !edge->isLeftOf(edge->fNextEdgeAbove->fTop))) {
850 Vertex* top = edge->fTop;
853 Vertex* leftTop = edge->fLeft->fTop;
856 split_edge(edge->fLeft, edge->fTop, activeEdges, c, alloc);
867 Vertex* rightTop = edge->fRight->fTop;
885 edge->fTop->fID, edge->fBottom->fID,
887 if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) {
927 if (p == edge->fTop->fPoint || c.sweep_lt(p, edge->fTop->fPoint)) {
928 split_edge(other, edge->fTop, activeEdges, c, alloc);
929 v = edge->fTop;
933 } else if (p == other->fTop->fPoint || c.sweep_lt(p, other->fTop->fPoint)) {
934 split_edge(edge, other->fTop, activeEdges, c, alloc);
935 v = other->fTop;
940 Vertex* nextV = edge->fTop;
1198 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,
1203 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,
1217 SkASSERT(rightEdge->isRightOf(leftEdge->fTop));
1240 leftPoly = new_poly(&polys, leftEnclosingEdge->fTop, leftPoly->fWinding,
1246 rightPoly = new_poly(&polys, rightEnclosingEdge->fTop, rightPoly->fWinding,
1280 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,