Lines Matching refs:fBottom
252 fTop->fID, fBottom->fID, other.fTop->fID, other.fBottom->fID);
253 if (fTop == other.fTop || fBottom == other.fBottom ||
254 fTop == other.fBottom || fBottom == other.fTop) {
262 fLine, fTop->fPoint, fBottom->fPoint,
263 other.fLine, other.fTop->fPoint, other.fBottom->fPoint,
282 *alpha = std::max((1.0 - s) * fTop->fAlpha + s * fBottom->fAlpha,
283 (1.0 - t) * other.fTop->fAlpha + t * other.fBottom->fAlpha);
294 TESS_LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
321 vertices.append(e->fBottom);
324 vertices.prepend(e->fBottom);
394 e->fTop->fID, e->fBottom->fID, fID, side == kLeft_Side ? "left" : "right");
412 } else if (e->fBottom == fTail->fLastEdge->fBottom) {
418 e = alloc->make<Edge>(fTail->fLastEdge->fBottom, e->fBottom, 1, EdgeType::kInner);
629 TESS_LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
654 if (fTop->fPoint == fBottom->fPoint ||
655 c.sweep_lt(fBottom->fPoint, fTop->fPoint)) {
658 TESS_LOG("insert edge (%g -> %g) above vertex %g\n", fTop->fID, fBottom->fID, v->fID);
672 if (fTop->fPoint == fBottom->fPoint ||
673 c.sweep_lt(fBottom->fPoint, fTop->fPoint)) {
676 TESS_LOG("insert edge (%g -> %g) below vertex %g\n", fTop->fID, fBottom->fID, v->fID);
680 if (next->isRightOf(fBottom)) {
690 SkASSERT(edge->fTop && edge->fBottom);
691 TESS_LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID,
692 edge->fBottom->fID);
694 edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove);
698 SkASSERT(edge->fTop && edge->fBottom);
700 edge->fTop->fID, edge->fBottom->fID, edge->fTop->fID);
742 Vertex* bottom = edge->fBottom;
745 Vertex* leftBottom = edge->fLeft->fBottom;
759 Vertex* rightBottom = edge->fRight->fBottom;
778 fBreadcrumbList.append(fAlloc, edge->fTop->fPoint, edge->fBottom->fPoint, v->fPoint,
792 fBreadcrumbList.append(fAlloc, edge->fTop->fPoint, edge->fBottom->fPoint, v->fPoint,
795 edge->fBottom = v;
807 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY);
811 edge->fTop = edge->fBottom = nullptr;
825 if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) {
828 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY);
832 edge->fTop = edge->fBottom = nullptr;
833 } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) {
836 this->setTop(other, edge->fBottom, activeEdges, current, c);
840 this->setTop(edge, other->fBottom, activeEdges, current, c);
856 return left->fBottom->fPoint == right->fBottom->fPoint ||
857 !left->isLeftOf(right->fBottom) || !right->isRightOf(left->fBottom);
883 if (!edge->fTop || !edge->fBottom || v == edge->fTop || v == edge->fBottom) {
887 edge->fTop->fID, edge->fBottom->fID, v->fID, v->fPoint.fX, v->fPoint.fY);
901 } else if (c.sweep_lt(edge->fBottom->fPoint, v->fPoint)) {
904 top = edge->fBottom;
912 bottom = edge->fBottom;
924 if (!left->fTop || !left->fBottom || !right->fTop || !right->fBottom) {
927 if (left->fTop == right->fTop || left->fBottom == right->fBottom) {
941 if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) {
942 if (!left->isLeftOf(right->fBottom)) {
943 rewind(activeEdges, current, right->fBottom, c);
944 return this->splitEdge(left, right->fBottom, activeEdges, current, c);
947 if (!right->isRightOf(left->fBottom)) {
948 rewind(activeEdges, current, left->fBottom, c);
949 return this->splitEdge(right, left->fBottom, activeEdges, current, c);
962 edge->insertAbove(edge->fBottom, c);
1077 p = clamp(p, left->fTop->fPoint, left->fBottom->fPoint, c);
1078 p = clamp(p, right->fTop->fPoint, right->fBottom->fPoint, c);
1082 } else if (coincident(p, left->fBottom->fPoint)) {
1083 v = left->fBottom;
1086 } else if (coincident(p, right->fBottom->fPoint)) {
1087 v = right->fBottom;
1250 TESS_LOG(" edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding);
1253 TESS_LOG(" edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding);
1265 SkASSERT(left->isLeftOf(right->fBottom));
1266 SkASSERT(right->isRightOf(left->fBottom));
1272 if (left->fBottom == right->fBottom) {
1275 } else if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) {
1276 SkASSERT(left->isLeftOf(right->fBottom));
1278 SkASSERT(right->isRightOf(left->fBottom));
1380 e->fTop->fID, e->fBottom->fID,
1387 e->fTop->fID, e->fBottom->fID,
1458 e->fTop->fID, e->fBottom->fID,