Searched refs:sweep_lt (Results 1 - 3 of 3) sorted by relevance
| /third_party/skia/src/gpu/geometry/ |
| H A D | GrTriangulator.cpp | 79 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(leftBotto in rewind_if_necessary()
[all...] |
| H A D | GrAATriangulator.cpp | 99 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()
|
| H A D | GrTriangulator.h | 258 * are re-ordered by the merge sort according to the sweep_lt comparator (usually, increasing
401 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt).
496 bool sweep_lt(const SkPoint& a, const SkPoint& b) const;
|
Completed in 5 milliseconds