Lines Matching refs:fTop
345 , fTop(top) in Edge()
365 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt). member
393 fLine = Line(fTop, fBottom); in recompute()
397 fTop->fID, fBottom->fID, in intersect()
398 other.fTop->fID, other.fBottom->fID); in intersect()
399 if (fTop == other.fTop || fBottom == other.fBottom) { in intersect()
406 double dx = static_cast<double>(other.fTop->fPoint.fX) - fTop->fPoint.fX; in intersect()
407 double dy = static_cast<double>(other.fTop->fPoint.fY) - fTop->fPoint.fY; in intersect()
418 p->fX = SkDoubleToScalar(fTop->fPoint.fX - s * fLine.fB); in intersect()
419 p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fLine.fA); in intersect()
422 *alpha = (1.0 - s) * fTop->fAlpha + s * fBottom->fAlpha; in intersect()
425 *alpha = (1.0 - t) * other.fTop->fAlpha + t * other.fBottom->fAlpha; in intersect()
528 prev->fID, next->fID, e->fEdge->fTop->fID, e->fEdge->fBottom->fID, p.fX, p.fY, alpha); in create_event()
539 Vertex* top = edge->fEdge->fTop; in create_event()
608 vertices.append(e->fTop); in emit()
653 e->fTop->fID, e->fBottom->fID, fID, side == kLeft_Side ? "left" : "right"); in addEdge()
890 LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); in remove_edge()
896 LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); in insert_edge()
921 if (edge->fTop->fPoint == edge->fBottom->fPoint || in insert_edge_above()
922 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_above()
925 LOG("insert edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID); in insert_edge_above()
929 if (next->isRightOf(edge->fTop)) { in insert_edge_above()
939 if (edge->fTop->fPoint == edge->fBottom->fPoint || in insert_edge_below()
940 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_below()
943 LOG("insert edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID); in insert_edge_below()
957 SkASSERT(edge->fTop && edge->fBottom); in remove_edge_above()
958 LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, in remove_edge_above()
965 SkASSERT(edge->fTop && edge->fBottom); in remove_edge_below()
966 LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, in remove_edge_below()
967 edge->fTop->fID); in remove_edge_below()
969 edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow); in remove_edge_below()
1002 edge->fTop = v; in set_top()
1005 rewind(activeEdges, current, edge->fTop, c); in set_top()
1014 rewind(activeEdges, current, edge->fTop, c); in set_bottom()
1020 if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) { in merge_edges_above()
1022 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in merge_edges_above()
1024 rewind(activeEdges, current, edge->fTop, c); in merge_edges_above()
1027 edge->fTop = edge->fBottom = nullptr; in merge_edges_above()
1028 } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) { in merge_edges_above()
1029 rewind(activeEdges, current, edge->fTop, c); in merge_edges_above()
1031 set_bottom(edge, other->fTop, activeEdges, current, c); in merge_edges_above()
1033 rewind(activeEdges, current, other->fTop, c); in merge_edges_above()
1035 set_bottom(other, edge->fTop, activeEdges, current, c); in merge_edges_above()
1043 edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, in merge_edges_below()
1045 rewind(activeEdges, current, edge->fTop, c); in merge_edges_below()
1048 edge->fTop = edge->fBottom = nullptr; in merge_edges_below()
1050 rewind(activeEdges, current, other->fTop, c); in merge_edges_below()
1054 rewind(activeEdges, current, edge->fTop, c); in merge_edges_below()
1064 return left->fTop->fPoint == right->fTop->fPoint || in top_collinear()
1065 !left->isLeftOf(right->fTop) || !right->isRightOf(left->fTop); in top_collinear()
1098 if (!edge->fTop || !edge->fBottom || v == edge->fTop || v == edge->fBottom) { in split_edge()
1102 edge->fTop->fID, edge->fBottom->fID, in split_edge()
1107 if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) { in split_edge()
1109 bottom = edge->fTop; in split_edge()
1128 if (!left->fTop || !left->fBottom || !right->fTop || !right->fBottom) { in intersect_edge_pair()
1131 if (left->fTop == right->fTop || left->fBottom == right->fBottom) { in intersect_edge_pair()
1134 if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) { in intersect_edge_pair()
1135 if (!left->isLeftOf(right->fTop)) { in intersect_edge_pair()
1136 rewind(activeEdges, current, right->fTop, c); in intersect_edge_pair()
1137 return split_edge(left, right->fTop, activeEdges, current, c, alloc); in intersect_edge_pair()
1140 if (!right->isRightOf(left->fTop)) { in intersect_edge_pair()
1141 rewind(activeEdges, current, left->fTop, c); in intersect_edge_pair()
1142 return split_edge(right, left->fTop, activeEdges, current, c, alloc); in intersect_edge_pair()
1165 insert_edge_below(edge, edge->fTop, c); in connect()
1226 SkPoint diff = edge->fBottom->fPoint - edge->fTop->fPoint; in nearly_flat()
1277 p = clamp(p, left->fTop->fPoint, left->fBottom->fPoint, c); in check_for_intersection()
1280 p = clamp(p, right->fTop->fPoint, right->fBottom->fPoint, c); in check_for_intersection()
1282 if (p == left->fTop->fPoint) { in check_for_intersection()
1283 v = left->fTop; in check_for_intersection()
1286 } else if (p == right->fTop->fPoint) { in check_for_intersection()
1287 v = right->fTop; in check_for_intersection()
1292 if (left->fTop->fPartner) { in check_for_intersection()
1458 LOG(" edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding); in dump_mesh()
1461 LOG(" edge %g -> %g, winding %d\n", e->fTop->fID, e->fBottom->fID, e->fWinding); in dump_mesh()
1474 if (edge->fEdge->fTop && edge->fEdge->fBottom) { in dump_skel()
1476 edge->fEdge->fTop->fID, in dump_skel()
1491 if (left->fTop == right->fTop) { in validate_edge_pair()
1494 } else if (c.sweep_lt(left->fTop->fPoint, right->fTop->fPoint)) { in validate_edge_pair()
1495 SkASSERT(left->isLeftOf(right->fTop)); in validate_edge_pair()
1497 SkASSERT(right->isRightOf(left->fTop)); in validate_edge_pair()
1500 SkASSERT(left->isLeftOf(right->fTop)); in validate_edge_pair()
1501 SkASSERT(right->isRightOf(left->fTop)); in validate_edge_pair()
1610 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, in tessellate()
1615 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, in tessellate()
1683 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, in tessellate()
1740 Vertex* prev = prevEdge->fWinding == 1 ? prevEdge->fTop : prevEdge->fBottom; in simplify_boundary()
1741 Vertex* next = e->fWinding == 1 ? e->fBottom : e->fTop; in simplify_boundary()
1811 prev->fID, next->fID, fEdge->fEdge->fTop->fID, fEdge->fEdge->fBottom->fID, in apply()
1884 e->fTop->fID, e->fBottom->fID); in collapse_overlap_regions()
1887 LOG("found overlap edge %g -> %g%s\n", e->fTop->fID, e->fBottom->fID, in collapse_overlap_regions()
1889 Vertex* prevVertex = e->fWinding < 0 ? e->fBottom : e->fTop; in collapse_overlap_regions()
1890 Vertex* nextVertex = e->fWinding < 0 ? e->fTop : e->fBottom; in collapse_overlap_regions()
1959 Vertex* prevV = prevEdge->fWinding > 0 ? prevEdge->fTop : prevEdge->fBottom; in stroke_boundary()
1972 Vertex* v = e->fWinding > 0 ? e->fTop : e->fBottom; in stroke_boundary()
1985 Vertex* nextV = e->fWinding > 0 ? e->fBottom : e->fTop; in stroke_boundary()
2112 Vertex* start = down ? e->fTop : e->fBottom; in extract_boundary()
2132 } else if ((next = e->fTop->fFirstEdgeAbove)) { in extract_boundary()
2140 } while (e && (down ? e->fTop : e->fBottom) != start); in extract_boundary()
2306 Vertex* v0 = e->fTop; in outer_mesh_to_triangles()
2309 Vertex* v3 = e->fTop->fPartner; in outer_mesh_to_triangles()