Home
last modified time | relevance | path

Searched refs:sweep_lt (Results 1 – 4 of 4) sorted by relevance

/third_party/skia/src/gpu/geometry/
DGrTriangulator.cpp79 bool GrTriangulator::Comparator::sweep_lt(const SkPoint& a, const SkPoint& b) const { in sweep_lt() function in GrTriangulator::Comparator
622 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; in makeEdge()
655 c.sweep_lt(fBottom->fPoint, fTop->fPoint)) { in insertAbove()
673 c.sweep_lt(fBottom->fPoint, fTop->fPoint)) { in insertBelow()
711 if (!current || *current == dst || c.sweep_lt((*current)->fPoint, dst->fPoint)) { in rewind()
726 if (c.sweep_lt(top->fPoint, dst->fPoint) && in rewind()
746 if (c.sweep_lt(leftTop->fPoint, top->fPoint) && !edge->fLeft->isLeftOf(top)) { in rewind_if_necessary()
748 } else if (c.sweep_lt(top->fPoint, leftTop->fPoint) && !edge->isRightOf(leftTop)) { in rewind_if_necessary()
750 } else if (c.sweep_lt(bottom->fPoint, leftBottom->fPoint) && in rewind_if_necessary()
753 } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) { in rewind_if_necessary()
[all …]
DGrAATriangulator.cpp99 if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) && in makeEvent()
100 c.sweep_lt(p, bottom->fPoint)) { in makeEvent()
402 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; in inversion()
DGrTriangulator.h496 bool sweep_lt(const SkPoint& a, const SkPoint& b) const;
/third_party/flutter/skia/src/gpu/
DGrTessellator.cpp193 bool sweep_lt(const SkPoint& a, const SkPoint& b) const { in sweep_lt() function
549 if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) && in create_event()
550 c.sweep_lt(p, bottom->fPoint)) { in create_event()
883 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; in new_edge()
922 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_above()
940 c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { in insert_edge_below()
981 if (!current || *current == dst || c.sweep_lt((*current)->fPoint, dst->fPoint)) { in rewind()
1028 } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) { in merge_edges_above()
1049 } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) { in merge_edges_below()
1107 if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) { in split_edge()
[all …]