Lines Matching defs:fTop
234 , fTop(top)
247 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt).
270 fDX = static_cast<double>(fBottom->fPoint.fX) - fTop->fPoint.fX;
271 fDY = static_cast<double>(fBottom->fPoint.fY) - fTop->fPoint.fY;
272 fC = static_cast<double>(fTop->fPoint.fY) * fBottom->fPoint.fX -
273 static_cast<double>(fTop->fPoint.fX) * fBottom->fPoint.fY;
277 fTop->fID, fBottom->fID,
278 other.fTop->fID, other.fBottom->fID);
279 if (fTop == other.fTop || fBottom == other.fBottom) {
286 double dx = static_cast<double>(fTop->fPoint.fX) - other.fTop->fPoint.fX;
287 double dy = static_cast<double>(fTop->fPoint.fY) - other.fTop->fPoint.fY;
298 p->fX = SkDoubleToScalar(fTop->fPoint.fX + s * fDX);
299 p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fDY);
646 LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
652 LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
681 if ((c.sweep_gt(edge->fTop->fPoint, next->fTop->fPoint) && next->isRightOf(edge->fTop)) ||
682 (c.sweep_gt(next->fTop->fPoint, edge->fTop->fPoint) && edge->isLeftOf(next->fTop)) ||
698 if (edge->fBottom->fProcessed || !edge->fTop->fProcessed) {
701 } else if (edge->fTop->fProcessed && !edge->fBottom->fProcessed) {
710 if (edge->fTop->fPoint == edge->fBottom->fPoint ||
711 c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {
714 LOG("insert edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);
718 if (next->isRightOf(edge->fTop)) {
728 if (edge->fTop->fPoint == edge->fBottom->fPoint ||
729 c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {
732 LOG("insert edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);
746 LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID,
753 LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID,
754 edge->fTop->fID);
756 edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow);
763 LOG("erasing edge (%g -> %g)\n", edge->fTop->fID, edge->fBottom->fID);
775 edge->fTop = v;
792 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) {
794 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY,
800 } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) {
803 set_bottom(edge, other->fTop, activeEdges, c);
807 set_bottom(other, edge->fTop, activeEdges, c);
814 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY,
832 if (edge->fPrevEdgeAbove && (edge->fTop == edge->fPrevEdgeAbove->fTop ||
833 !edge->fPrevEdgeAbove->isLeftOf(edge->fTop))) {
835 } else if (edge->fNextEdgeAbove && (edge->fTop == edge->fNextEdgeAbove->fTop ||
836 !edge->isLeftOf(edge->fNextEdgeAbove->fTop))) {
851 Vertex* top = edge->fTop;
854 Vertex* leftTop = edge->fLeft->fTop;
857 split_edge(edge->fLeft, edge->fTop, activeEdges, c, alloc);
868 Vertex* rightTop = edge->fRight->fTop;
886 edge->fTop->fID, edge->fBottom->fID,
888 if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) {
928 if (p == edge->fTop->fPoint || c.sweep_lt(p, edge->fTop->fPoint)) {
929 split_edge(other, edge->fTop, activeEdges, c, alloc);
930 v = edge->fTop;
934 } else if (p == other->fTop->fPoint || c.sweep_lt(p, other->fTop->fPoint)) {
935 split_edge(edge, other->fTop, activeEdges, c, alloc);
936 v = other->fTop;
941 Vertex* nextV = edge->fTop;
1199 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,
1204 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,
1218 SkASSERT(rightEdge->isRightOf(leftEdge->fTop));
1241 leftPoly = new_poly(&polys, leftEnclosingEdge->fTop, leftPoly->fWinding,
1247 rightPoly = new_poly(&polys, rightEnclosingEdge->fTop, rightPoly->fWinding,
1281 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,
