Lines Matching refs:fPoint
85 verts.write(v->fPoint); in emit_vertex()
95 TESS_LOG("emit_triangle %g (%g, %g) %d\n", v0->fID, v0->fPoint.fX, v0->fPoint.fY, v0->fAlpha); in emit_triangle()
96 TESS_LOG(" %g (%g, %g) %d\n", v1->fID, v1->fPoint.fX, v1->fPoint.fY, v1->fAlpha); in emit_triangle()
97 TESS_LOG(" %g (%g, %g) %d\n", v2->fID, v2->fPoint.fX, v2->fPoint.fY, v2->fAlpha); in emit_triangle()
162 double dx = static_cast<double>(other.fTop->fPoint.fX) - fTop->fPoint.fX; in intersect()
163 double dy = static_cast<double>(other.fTop->fPoint.fY) - fTop->fPoint.fY; in intersect()
174 p->fX = double_to_clamped_scalar(fTop->fPoint.fX - s * fLine.fB); in intersect()
175 p->fY = double_to_clamped_scalar(fTop->fPoint.fY + s * fLine.fA); in intersect()
247 double ax = static_cast<double>(curr->fPoint.fX) - prev->fPoint.fX; in emitMonotonePoly()
248 double ay = static_cast<double>(curr->fPoint.fY) - prev->fPoint.fY; in emitMonotonePoly()
249 double bx = static_cast<double>(next->fPoint.fX) - curr->fPoint.fX; in emitMonotonePoly()
250 double by = static_cast<double>(next->fPoint.fY) - curr->fPoint.fY; in emitMonotonePoly()
279 fBreadcrumbList.append(fAlloc, prev->fPoint, curr->fPoint, next->fPoint, abs(winding) - 1); in emitTriangle()
529 SkASSERT(prev->fPoint != next->fPoint); in makeEdge()
530 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; in makeEdge()
562 if (fTop->fPoint == fBottom->fPoint || in insertAbove()
563 c.sweep_lt(fBottom->fPoint, fTop->fPoint)) { in insertAbove()
580 if (fTop->fPoint == fBottom->fPoint || in insertBelow()
581 c.sweep_lt(fBottom->fPoint, fTop->fPoint)) { in insertBelow()
619 if (!current || *current == dst || c.sweep_lt((*current)->fPoint, dst->fPoint)) { in rewind()
634 if (c.sweep_lt(top->fPoint, dst->fPoint) && in rewind()
654 if (c.sweep_lt(leftTop->fPoint, top->fPoint) && !edge->fLeft->isLeftOf(top)) { in rewind_if_necessary()
656 } else if (c.sweep_lt(top->fPoint, leftTop->fPoint) && !edge->isRightOf(leftTop)) { in rewind_if_necessary()
658 } else if (c.sweep_lt(bottom->fPoint, leftBottom->fPoint) && in rewind_if_necessary()
661 } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) { in rewind_if_necessary()
668 if (c.sweep_lt(rightTop->fPoint, top->fPoint) && !edge->fRight->isRightOf(top)) { in rewind_if_necessary()
670 } else if (c.sweep_lt(top->fPoint, rightTop->fPoint) && !edge->isLeftOf(rightTop)) { in rewind_if_necessary()
672 } else if (c.sweep_lt(bottom->fPoint, rightBottom->fPoint) && in rewind_if_necessary()
675 } else if (c.sweep_lt(rightBottom->fPoint, bottom->fPoint) && in rewind_if_necessary()
686 fBreadcrumbList.append(fAlloc, edge->fTop->fPoint, edge->fBottom->fPoint, v->fPoint, in setTop()
700 fBreadcrumbList.append(fAlloc, edge->fTop->fPoint, edge->fBottom->fPoint, v->fPoint, in setBottom()
712 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) { in mergeEdgesAbove()
714 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in mergeEdgesAbove()
715 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); in mergeEdgesAbove()
720 } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) { in mergeEdgesAbove()
733 if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) { in mergeEdgesBelow()
735 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in mergeEdgesBelow()
736 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); in mergeEdgesBelow()
741 } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) { in mergeEdgesBelow()
756 return left->fTop->fPoint == right->fTop->fPoint || in top_collinear()
764 return left->fBottom->fPoint == right->fBottom->fPoint || in bottom_collinear()
795 edge->fTop->fID, edge->fBottom->fID, v->fID, v->fPoint.fX, v->fPoint.fY); in splitEdge()
799 if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) { in splitEdge()
803 } else if (c.sweep_lt(edge->fBottom->fPoint, v->fPoint)) { in splitEdge()
827 if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) { in intersectEdgePair()
838 if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) { in intersectEdgePair()
854 if (!prev || !next || prev->fPoint == next->fPoint) { in makeConnectingEdge()
868 src->fPoint.fX, src->fPoint.fY, src->fID, dst->fID); in mergeVertices()
886 while (prevV && c.sweep_lt(p, prevV->fPoint)) { in makeSortedVertex()
890 while (nextV && c.sweep_lt(nextV->fPoint, p)) { in makeSortedVertex()
895 if (prevV && coincident(prevV->fPoint, p)) { in makeSortedVertex()
897 } else if (nextV && coincident(nextV->fPoint, p)) { in makeSortedVertex()
919 SkPoint diff = edge->fBottom->fPoint - edge->fTop->fPoint; in nearly_flat()
968 while (top && c.sweep_lt(p, top->fPoint)) { in checkForIntersection()
977 p = clamp(p, left->fTop->fPoint, left->fBottom->fPoint, c); in checkForIntersection()
980 p = clamp(p, right->fTop->fPoint, right->fBottom->fPoint, c); in checkForIntersection()
982 if (coincident(p, left->fTop->fPoint)) { in checkForIntersection()
984 } else if (coincident(p, left->fBottom->fPoint)) { in checkForIntersection()
986 } else if (coincident(p, right->fTop->fPoint)) { in checkForIntersection()
988 } else if (coincident(p, right->fBottom->fPoint)) { in checkForIntersection()
1011 prev->fPoint.fX = double_to_clamped_scalar((double) prev->fPoint.fX); in sanitizeContours()
1012 prev->fPoint.fY = double_to_clamped_scalar((double) prev->fPoint.fY); in sanitizeContours()
1014 round(&prev->fPoint); in sanitizeContours()
1017 v->fPoint.fX = double_to_clamped_scalar((double) v->fPoint.fX); in sanitizeContours()
1018 v->fPoint.fY = double_to_clamped_scalar((double) v->fPoint.fY); in sanitizeContours()
1020 round(&v->fPoint); in sanitizeContours()
1024 if (coincident(prev->fPoint, v->fPoint)) { in sanitizeContours()
1025 TESS_LOG("vertex %g,%g coincident; removing\n", v->fPoint.fX, v->fPoint.fY); in sanitizeContours()
1027 } else if (!v->fPoint.isFinite()) { in sanitizeContours()
1028 TESS_LOG("vertex %g,%g non-finite; removing\n", v->fPoint.fX, v->fPoint.fY); in sanitizeContours()
1031 Line(prev->fPoint, nextWrap->fPoint).dist(v->fPoint) == 0.0) { in sanitizeContours()
1032 TESS_LOG("vertex %g,%g collinear; removing\n", v->fPoint.fX, v->fPoint.fY); in sanitizeContours()
1049 if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) { in mergeCoincidentVertices()
1050 v->fPoint = v->fPrev->fPoint; in mergeCoincidentVertices()
1052 if (coincident(v->fPrev->fPoint, v->fPoint)) { in mergeCoincidentVertices()
1082 if (sweep_lt(a->fPoint, b->fPoint)) { in sorted_merge()
1144 TESS_LOG("vertex %g (%g, %g) alpha %d", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); in dump()
1147 p->fID, p->fPoint.fX, p->fPoint.fY, p->fAlpha); in dump()
1169 } else if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) { in validate_edge_pair()
1177 } else if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) { in validate_edge_pair()
1212 v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); in simplify()
1264 TESS_LOG("\nvertex %g: (%g,%g), alpha %d\n", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); in tessellate()
1377 TESS_LOG("path.moveTo(%20.20g, %20.20g);\n", v->fPoint.fX, v->fPoint.fY); in contoursToMesh()
1379 TESS_LOG("path.lineTo(%20.20g, %20.20g);\n", v->fPoint.fX, v->fPoint.fY); in contoursToMesh()