Searched refs:LexLess (Results 1 - 5 of 5) sorted by relevance

/inkscape/src/2geom/
H A Dint-point.h120 template <Dim2 d> struct LexLess;
140 template<> struct IntPoint::LexLess<X> { struct in class:Geom::IntPoint
145 template<> struct IntPoint::LexLess<Y> { struct in class:Geom::IntPoint
161 return dim ? IntPoint::LexLess<Y>()(a, b) : IntPoint::LexLess<X>()(a, b);
H A Dconvex-hull.h287 if (!ymin || Point::LexLess<Y>()(p, *ymin)) {
290 if (!xmin || Point::LexLess<X>()(p, *xmin)) {
312 std::sort(out.begin(), out.end(), Point::LexLess<X>());
H A Dpoint.h236 template <Dim2 DIM> struct LexLess;
260 template<> struct Point::LexLess<X> { struct in class:Geom::Point
269 template<> struct Point::LexLess<Y> { struct in class:Geom::Point
297 return dim ? Point::LexLess<Y>()(a, b) : Point::LexLess<X>()(a, b);
H A Dconvex-hull.cpp68 std::sort(_boundary.begin(), _boundary.end(), Point::LexLess<X>());
79 std::sort(_boundary.begin(), _boundary.end(), Point::LexLess<X>());
91 std::sort(_boundary.begin(), _boundary.end(), Point::LexLess<X>());
102 std::sort(_boundary.begin(), _boundary.end(), Point::LexLess<X>());
115 // _boundary must already be sorted in LexLess<X> order
238 if (!below_x_monotonic_polyline(p, ub, ue, Point::LexLess<X>())) return false;
284 std::sort(_boundary.begin(), _boundary.end(), Point::LexLess<X>());
H A Dconic_section_clipper_impl.cpp176 std::sort (cpts.begin(), cpts.end(), Point::LexLess<X>());

Completed in 365 milliseconds