summaryrefslogtreecommitdiffstats
path: root/src/2geom/conic_section_clipper_impl.cpp
diff options
context:
space:
mode:
authorAndrew Higginson <at.higginson@gmail.com>2011-12-27 21:04:47 +0000
committerAndrew <at.higginson@gmail.com>2011-12-27 21:04:47 +0000
commit80960b623a99aae1402ab651b2974ef544ed3b03 (patch)
treeba49d42c2789e9e11f805e2d5263e10f9fedeef8 /src/2geom/conic_section_clipper_impl.cpp
parenttry to fix bug (diff)
parentGDL: Cherry-pick upstream patch 73852 (2011-03-23) - Add missing return value. (diff)
downloadinkscape-80960b623a99aae1402ab651b2974ef544ed3b03.tar.gz
inkscape-80960b623a99aae1402ab651b2974ef544ed3b03.zip
merged with trunk so I can build again...
(bzr r10092.1.36)
Diffstat (limited to 'src/2geom/conic_section_clipper_impl.cpp')
-rw-r--r--src/2geom/conic_section_clipper_impl.cpp23
1 files changed, 2 insertions, 21 deletions
diff --git a/src/2geom/conic_section_clipper_impl.cpp b/src/2geom/conic_section_clipper_impl.cpp
index edfafb11c..33a218a8c 100644
--- a/src/2geom/conic_section_clipper_impl.cpp
+++ b/src/2geom/conic_section_clipper_impl.cpp
@@ -1,6 +1,4 @@
-/**
- * \file
- * \brief Conic section clipping with respect to a rectangle
+/* Conic section clipping with respect to a rectangle
*
* Authors:
* Marco Cecchetti <mrcekets at gmail>
@@ -31,30 +29,13 @@
* the specific language governing rights and limitations.
*/
-
-
-
#ifndef CLIP_WITH_CAIRO_SUPPORT
#include <2geom/conic_section_clipper.h>
#endif
-
-
-
namespace Geom
{
-struct lex_lesser
-{
- bool operator() (const Point & P, const Point & Q) const
- {
- if (P[X] < Q[X]) return true;
- if (P[X] == Q[X] && P[Y] < Q[Y]) return true;
- return false;
- }
-};
-
-
/*
* Find rectangle-conic crossing points. They are returned in the
* "crossing_points" parameter.
@@ -192,7 +173,7 @@ bool CLIPPER_CLASS::intersect (std::vector<Point> & crossing_points) const
cpts.size())
// remove duplicates
- std::sort (cpts.begin(), cpts.end(), lex_lesser());
+ std::sort (cpts.begin(), cpts.end(), Point::LexOrder<X>());
cpts.erase (std::unique (cpts.begin(), cpts.end()), cpts.end());