Lines Matching refs:fTop
359 , fTop(top) in Edge()
381 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt). member
411 fLine = Line(fTop, fBottom); in recompute()
415 fTop->fID, fBottom->fID, in intersect()
416 other.fTop->fID, other.fBottom->fID); in intersect()
417 if (fTop == other.fTop || fBottom == other.fBottom) { in intersect()
424 double dx = static_cast<double>(other.fTop->fPoint.fX) - fTop->fPoint.fX; in intersect()
425 double dy = static_cast<double>(other.fTop->fPoint.fY) - fTop->fPoint.fY; in intersect()
436 p->fX = SkDoubleToScalar(fTop->fPoint.fX - s * fLine.fB); in intersect()
437 p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fLine.fA); in intersect()
440 *alpha = (1.0 - s) * fTop->fAlpha + s * fBottom->fAlpha; in intersect()
443 *alpha = (1.0 - t) * other.fTop->fAlpha + t * other.fBottom->fAlpha; in intersect()
503 Edge bisector1(e->fTop, e->fTop->fPartner, 1, Edge::Type::kConnector); in create_event()
509 e->fTop->fID, e->fBottom->fID, p.fX, p.fY, alpha); in create_event()
566 vertices.append(e->fTop); in emit()
611 e->fTop->fID, e->fBottom->fID, fID, side == kLeft_Side ? "left" : "right"); in addEdge()
848 LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); in remove_edge()
854 LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); in insert_edge()
879 if (edge->fTop->fPoint == edge->fBottom->fPoint || in insert_edge_above()
880 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_above()
883 LOG("insert edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID); in insert_edge_above()
887 if (next->isRightOf(edge->fTop)) { in insert_edge_above()
897 if (edge->fTop->fPoint == edge->fBottom->fPoint || in insert_edge_below()
898 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_below()
901 LOG("insert edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID); in insert_edge_below()
915 LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, in remove_edge_above()
922 LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, in remove_edge_below()
923 edge->fTop->fID); in remove_edge_below()
925 edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow); in remove_edge_below()
960 Vertex* top = edge->fTop; in rewind_if_necessary()
963 Vertex* leftTop = edge->fLeft->fTop; in rewind_if_necessary()
977 Vertex* rightTop = edge->fRight->fTop; in rewind_if_necessary()
995 edge->fTop = v; in set_top()
1013 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) { in merge_edges_above()
1015 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in merge_edges_above()
1017 rewind(activeEdges, current, edge->fTop, c); in merge_edges_above()
1020 } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) { in merge_edges_above()
1021 rewind(activeEdges, current, edge->fTop, c); in merge_edges_above()
1023 set_bottom(edge, other->fTop, activeEdges, current, c); in merge_edges_above()
1025 rewind(activeEdges, current, other->fTop, c); in merge_edges_above()
1027 set_bottom(other, edge->fTop, activeEdges, current, c); in merge_edges_above()
1035 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in merge_edges_below()
1037 rewind(activeEdges, current, edge->fTop, c); in merge_edges_below()
1041 rewind(activeEdges, current, other->fTop, c); in merge_edges_below()
1045 rewind(activeEdges, current, edge->fTop, c); in merge_edges_below()
1053 if (edge->fPrevEdgeAbove && (edge->fTop == edge->fPrevEdgeAbove->fTop || in merge_collinear_edges()
1054 !edge->fPrevEdgeAbove->isLeftOf(edge->fTop))) { in merge_collinear_edges()
1056 } else if (edge->fNextEdgeAbove && (edge->fTop == edge->fNextEdgeAbove->fTop || in merge_collinear_edges()
1057 !edge->isLeftOf(edge->fNextEdgeAbove->fTop))) { in merge_collinear_edges()
1069 SkASSERT(!edge->fPrevEdgeAbove || edge->fPrevEdgeAbove->isLeftOf(edge->fTop)); in merge_collinear_edges()
1071 SkASSERT(!edge->fNextEdgeAbove || edge->fNextEdgeAbove->isRightOf(edge->fTop)); in merge_collinear_edges()
1077 if (v == edge->fTop || v == edge->fBottom) { in split_edge()
1081 edge->fTop->fID, edge->fBottom->fID, in split_edge()
1085 if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) { in split_edge()
1087 bottom = edge->fTop; in split_edge()
1110 insert_edge_below(edge, edge->fTop, c); in connect()
1145 return SkTMax(SkTMax(a->fTop->fAlpha, a->fBottom->fAlpha), in max_edge_alpha()
1146 SkTMax(b->fTop->fAlpha, b->fBottom->fAlpha)); in max_edge_alpha()
1152 if (c.sweep_lt(p, edge->fTop->fPoint) && in out_of_range_and_collinear()
1153 !Line(p, edge->fBottom->fPoint).dist(edge->fTop->fPoint)) { in out_of_range_and_collinear()
1156 !Line(edge->fTop->fPoint, p).dist(edge->fBottom->fPoint)) { in out_of_range_and_collinear()
1216 if (p == edge->fTop->fPoint) { in check_for_intersection()
1217 v = edge->fTop; in check_for_intersection()
1220 } else if (p == other->fTop->fPoint) { in check_for_intersection()
1221 v = other->fTop; in check_for_intersection()
1227 if (edge->fTop->fPartner) { in check_for_intersection()
1398 LOG(" edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding); in dump_mesh()
1401 LOG(" edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding); in dump_mesh()
1547 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, in tessellate()
1552 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, in tessellate()
1620 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, in tessellate()
1676 if (src == edge->fTop) { in reconnect()
1677 edge->fTop = dst; in reconnect()
1685 if (edge->fTop == edge->fBottom) { in reconnect()
1688 if (c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in reconnect()
1689 SkTSwap(edge->fTop, edge->fBottom); in reconnect()
1693 insert_edge_below(edge, edge->fTop, c); in reconnect()
1708 Vertex* prev = prevEdge->fWinding == 1 ? prevEdge->fTop : prevEdge->fBottom; in simplify_boundary()
1709 Vertex* next = e->fWinding == 1 ? e->fBottom : e->fTop; in simplify_boundary()
1784 Vertex* top = fEdge->fTop; in apply()
1786 Vertex* dest = create_sorted_vertex(fPoint, fAlpha, mesh, fEdge->fTop, c, alloc); in apply()
1948 Vertex* prevV = prevEdge->fWinding > 0 ? prevEdge->fTop : prevEdge->fBottom; in stroke_boundary()
1961 Vertex* v = e->fWinding > 0 ? e->fTop : e->fBottom; in stroke_boundary()
1974 Vertex* nextV = e->fWinding > 0 ? e->fBottom : e->fTop; in stroke_boundary()
2119 } else if ((next = e->fTop->fFirstEdgeAbove)) { in extract_boundary()
2300 Vertex* v0 = e->fTop; in contours_to_polys()
2303 Vertex* v3 = e->fTop->fPartner; in contours_to_polys()