Lines Matching refs:fBottom
360 , fBottom(bottom) in Edge()
382 Vertex* fBottom; // The bottom vertex in vertex-sort-order. 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()
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()
504 Edge bisector2(e->fBottom, e->fBottom->fPartner, 1, Edge::Type::kConnector); in create_event()
509 e->fTop->fID, e->fBottom->fID, p.fX, p.fY, alpha); in create_event()
570 vertices.append(e->fBottom); in emit()
573 vertices.prepend(e->fBottom); in emit()
611 e->fTop->fID, e->fBottom->fID, fID, side == kLeft_Side ? "left" : "right"); in addEdge()
629 } else if (e->fBottom == fTail->fLastEdge->fBottom) { in addEdge()
635 e = alloc.make<Edge>(fTail->fLastEdge->fBottom, e->fBottom, 1, Edge::Type::kInner); in addEdge()
660 Vertex* lastVertex() const { return fTail ? fTail->fLastEdge->fBottom : fFirstVertex; } in lastVertex()
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()
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()
905 if (next->isRightOf(edge->fBottom)) { in insert_edge_below()
915 LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, in remove_edge_above()
916 edge->fBottom->fID); in remove_edge_above()
918 edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove); in remove_edge_above()
922 LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, in remove_edge_below()
961 Vertex* bottom = edge->fBottom; in rewind_if_necessary()
964 Vertex* leftBottom = edge->fLeft->fBottom; in rewind_if_necessary()
978 Vertex* rightBottom = edge->fRight->fBottom; in rewind_if_necessary()
1004 edge->fBottom = v; in set_bottom()
1016 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); in merge_edges_above()
1033 if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) { in merge_edges_below()
1036 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); in merge_edges_below()
1040 } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) { in merge_edges_below()
1043 set_top(other, edge->fBottom, activeEdges, current, c); in merge_edges_below()
1047 set_top(edge, other->fBottom, activeEdges, current, c); in merge_edges_below()
1059 } else if (edge->fPrevEdgeBelow && (edge->fBottom == edge->fPrevEdgeBelow->fBottom || in merge_collinear_edges()
1060 !edge->fPrevEdgeBelow->isLeftOf(edge->fBottom))) { in merge_collinear_edges()
1062 } else if (edge->fNextEdgeBelow && (edge->fBottom == edge->fNextEdgeBelow->fBottom || in merge_collinear_edges()
1063 !edge->isLeftOf(edge->fNextEdgeBelow->fBottom))) { in merge_collinear_edges()
1070 SkASSERT(!edge->fPrevEdgeBelow || edge->fPrevEdgeBelow->isLeftOf(edge->fBottom)); in merge_collinear_edges()
1072 SkASSERT(!edge->fNextEdgeBelow || edge->fNextEdgeBelow->isRightOf(edge->fBottom)); 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()
1089 } else if (c.sweep_lt(edge->fBottom->fPoint, v->fPoint)) { in split_edge()
1090 top = edge->fBottom; in split_edge()
1095 bottom = edge->fBottom; in split_edge()
1111 insert_edge_above(edge, edge->fBottom, 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()
1153 !Line(p, edge->fBottom->fPoint).dist(edge->fTop->fPoint)) { in out_of_range_and_collinear()
1155 } else if (c.sweep_lt(edge->fBottom->fPoint, p) && in out_of_range_and_collinear()
1156 !Line(edge->fTop->fPoint, p).dist(edge->fBottom->fPoint)) { in out_of_range_and_collinear()
1218 } else if (p == edge->fBottom->fPoint) { in check_for_intersection()
1219 v = edge->fBottom; in check_for_intersection()
1222 } else if (p == other->fBottom->fPoint) { in check_for_intersection()
1223 v = other->fBottom; 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()
1679 SkASSERT(src == edge->fBottom); in reconnect()
1680 edge->fBottom = 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()
1694 insert_edge_above(edge, edge->fBottom, 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()
1785 Vertex* bottom = fEdge->fBottom; 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()
2110 } else if ((next = e->fBottom->fLastEdgeBelow)) { in extract_boundary()
2301 Vertex* v1 = e->fBottom; in contours_to_polys()
2302 Vertex* v2 = e->fBottom->fPartner; in contours_to_polys()