Lines Matching refs:fPoint
150 : fPoint(point), fPrev(nullptr), fNext(nullptr) in Vertex()
160 SkPoint fPoint; // Vertex position member
199 verts.write(v->fPoint); in emit_vertex()
209 LOG("emit_triangle %g (%g, %g) %d\n", v0->fID, v0->fPoint.fX, v0->fPoint.fY, v0->fAlpha); in emit_triangle()
210 LOG(" %g (%g, %g) %d\n", v1->fID, v1->fPoint.fX, v1->fPoint.fY, v1->fAlpha); in emit_triangle()
211 LOG(" %g (%g, %g) %d\n", v2->fID, v2->fPoint.fX, v2->fPoint.fY, v2->fAlpha); in emit_triangle()
278 Line(Vertex* p, Vertex* q) : Line(p->fPoint, q->fPoint) {} in Line()
390 return fLine.dist(v->fPoint) < 0.0; in isRightOf()
393 return fLine.dist(v->fPoint) > 0.0; in isLeftOf()
409 double dx = static_cast<double>(other.fTop->fPoint.fX) - fTop->fPoint.fX; in intersect()
410 double dy = static_cast<double>(other.fTop->fPoint.fY) - fTop->fPoint.fY; 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()
470 : fEdge(edge), fIsOuterBoundary(isOuterBoundary), fPoint(point), fAlpha(alpha) in Event()
475 SkPoint fPoint; member
573 double ax = static_cast<double>(curr->fPoint.fX) - prev->fPoint.fX; in emit()
574 double ay = static_cast<double>(curr->fPoint.fY) - prev->fPoint.fY; in emit()
575 double bx = static_cast<double>(next->fPoint.fX) - curr->fPoint.fX; in emit()
576 double by = static_cast<double>(next->fPoint.fY) - curr->fPoint.fY; in emit()
826 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; in new_edge()
864 if (edge->fTop->fPoint == edge->fBottom->fPoint || in insert_edge_above()
865 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_above()
882 if (edge->fTop->fPoint == edge->fBottom->fPoint || in insert_edge_below()
883 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_below()
924 if (!current || *current == dst || c.sweep_lt((*current)->fPoint, dst->fPoint)) { in rewind()
952 if (c.sweep_lt(leftTop->fPoint, top->fPoint) && !edge->fLeft->isLeftOf(top)) { in rewind_if_necessary()
954 } else if (c.sweep_lt(top->fPoint, leftTop->fPoint) && !edge->isRightOf(leftTop)) { in rewind_if_necessary()
956 } else if (c.sweep_lt(bottom->fPoint, leftBottom->fPoint) && in rewind_if_necessary()
959 } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) { in rewind_if_necessary()
966 if (c.sweep_lt(rightTop->fPoint, top->fPoint) && !edge->fRight->isRightOf(top)) { in rewind_if_necessary()
968 } else if (c.sweep_lt(top->fPoint, rightTop->fPoint) && !edge->isLeftOf(rightTop)) { in rewind_if_necessary()
970 } else if (c.sweep_lt(bottom->fPoint, rightBottom->fPoint) && in rewind_if_necessary()
973 } else if (c.sweep_lt(rightBottom->fPoint, bottom->fPoint) && in rewind_if_necessary()
1000 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) { in merge_edges_above()
1002 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in merge_edges_above()
1003 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); in merge_edges_above()
1008 } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) { in merge_edges_above()
1021 if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) { in merge_edges_below()
1023 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in merge_edges_below()
1024 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); in merge_edges_below()
1029 } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) { in merge_edges_below()
1044 return left->fTop->fPoint == right->fTop->fPoint || in top_collinear()
1052 return left->fBottom->fPoint == right->fBottom->fPoint || in bottom_collinear()
1083 v->fID, v->fPoint.fX, v->fPoint.fY); in split_edge()
1087 if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) { in split_edge()
1091 } else if (c.sweep_lt(edge->fBottom->fPoint, v->fPoint)) { in split_edge()
1114 if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) { in intersect_edge_pair()
1125 if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) { in intersect_edge_pair()
1141 if (!prev || !next || prev->fPoint == next->fPoint) { in connect()
1154 LOG("found coincident verts at %g, %g; merging %g into %g\n", src->fPoint.fX, src->fPoint.fY, in merge_vertices()
1172 while (prevV && c.sweep_lt(p, prevV->fPoint)) { in create_sorted_vertex()
1176 while (nextV && c.sweep_lt(nextV->fPoint, p)) { in create_sorted_vertex()
1181 if (prevV && coincident(prevV->fPoint, p)) { in create_sorted_vertex()
1183 } else if (nextV && coincident(nextV->fPoint, p)) { in create_sorted_vertex()
1205 SkPoint diff = edge->fBottom->fPoint - edge->fTop->fPoint; in nearly_flat()
1233 while (top && c.sweep_lt(p, top->fPoint)) { in check_for_intersection()
1237 p = clamp(p, left->fTop->fPoint, left->fBottom->fPoint, c); in check_for_intersection()
1240 p = clamp(p, right->fTop->fPoint, right->fBottom->fPoint, c); in check_for_intersection()
1242 if (p == left->fTop->fPoint) { in check_for_intersection()
1244 } else if (p == left->fBottom->fPoint) { in check_for_intersection()
1246 } else if (p == right->fTop->fPoint) { in check_for_intersection()
1248 } else if (p == right->fBottom->fPoint) { in check_for_intersection()
1280 round(&prev->fPoint); in sanitize_contours()
1284 round(&v->fPoint); in sanitize_contours()
1288 if (coincident(prev->fPoint, v->fPoint)) { in sanitize_contours()
1289 LOG("vertex %g,%g coincident; removing\n", v->fPoint.fX, v->fPoint.fY); in sanitize_contours()
1291 } else if (!v->fPoint.isFinite()) { in sanitize_contours()
1292 LOG("vertex %g,%g non-finite; removing\n", v->fPoint.fX, v->fPoint.fY); in sanitize_contours()
1294 } else if (Line(prev->fPoint, nextWrap->fPoint).dist(v->fPoint) == 0.0) { in sanitize_contours()
1295 LOG("vertex %g,%g collinear; removing\n", v->fPoint.fX, v->fPoint.fY); in sanitize_contours()
1312 if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) { in merge_coincident_vertices()
1313 v->fPoint = v->fPrev->fPoint; in merge_coincident_vertices()
1315 if (coincident(v->fPrev->fPoint, v->fPoint)) { in merge_coincident_vertices()
1359 if (sweep_lt(a->fPoint, b->fPoint)) { in sorted_merge()
1420 LOG("vertex %g (%g, %g) alpha %d", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); in dump_mesh()
1422 LOG(", partner %g (%g, %g) alpha %d\n", p->fID, p->fPoint.fX, p->fPoint.fY, p->fAlpha); in dump_mesh()
1444 } else if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) { in validate_edge_pair()
1452 } else if (c.sweep_lt(right->fBottom->fPoint, left->fBottom->fPoint)) { in validate_edge_pair()
1485 LOG("\nvertex %g: (%g,%g), alpha %d\n", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); in simplify()
1539 LOG("\nvertex %g: (%g,%g), alpha %d\n", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); in tessellate()
1691 if (c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in reconnect()
1713 double distPrev = e->dist(prev->fPoint); in simplify_boundary()
1714 double distNext = prevEdge->dist(next->fPoint); in simplify_boundary()
1721 if (prev->fPoint != next->fPoint) { in simplify_boundary()
1770 Vertex* dest = create_sorted_vertex(fPoint, fAlpha, mesh, fEdge->fTop, c, alloc); in apply()
1772 top->fID, bottom->fID, dest->fID, fPoint.fX, fPoint.fY, fAlpha); in apply()
1859 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; in inversion()
1896 LOG("stroking vertex %g (%g, %g)\n", v->fID, v->fPoint.fX, v->fPoint.fY); in stroke_boundary()
1905 Line tangent(v->fPoint, v->fPoint + SkPoint::Make(bisector.fA, bisector.fB)); in stroke_boundary()
1922 Line prevTangent(prevV->fPoint, in stroke_boundary()
1923 prevV->fPoint + SkVector::Make(prevOuter.fA, prevOuter.fB)); in stroke_boundary()
1924 Line nextTangent(nextV->fPoint, in stroke_boundary()
1925 nextV->fPoint + SkVector::Make(outer.fA, outer.fB)); in stroke_boundary()
1939 Line prevTangent(prevV->fPoint, in stroke_boundary()
1940 prevV->fPoint + SkVector::Make(prevInner.fA, prevInner.fB)); in stroke_boundary()
1941 Line nextTangent(nextV->fPoint, in stroke_boundary()
1942 nextV->fPoint + SkVector::Make(inner.fA, inner.fB)); in stroke_boundary()
2082 LOG("path.moveTo(%20.20g, %20.20g);\n", v->fPoint.fX, v->fPoint.fY); in contours_to_mesh()
2084 LOG("path.lineTo(%20.20g, %20.20g);\n", v->fPoint.fX, v->fPoint.fY); in contours_to_mesh()