From 7b5b6f6fc5c641a80b39da71a4bbd85bf6e02e77 Mon Sep 17 00:00:00 2001
From: Peter Hachenberger <hachenberger@mpi-inf.mpg.de>
Date: Mon, 28 Jul 2008 09:18:10 +0000
Subject: [PATCH] removed unused variable

---
 .../test/Convex_decomposition_3/edge_sorter.cpp               | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Convex_decomposition_3/test/Convex_decomposition_3/edge_sorter.cpp b/Convex_decomposition_3/test/Convex_decomposition_3/edge_sorter.cpp
index 0552062af27..e993035e58a 100644
--- a/Convex_decomposition_3/test/Convex_decomposition_3/edge_sorter.cpp
+++ b/Convex_decomposition_3/test/Convex_decomposition_3/edge_sorter.cpp
@@ -49,7 +49,7 @@ bool check_sorting(Iterator begin, Iterator end, Compare& compare)
   if(begin == end) return true;
   Iterator next = begin;
   for(++next; next != end; ++begin, ++next) {
-    if((*next)->source()->point() < (*begin)->source()->point())
+    if(compare((*next)->source()->point(), (*begin)->source()->point()))
       return false;
   }
   return true;
@@ -59,7 +59,7 @@ typedef CGAL::Need_to_split<Kernel, std::less<Point_3> > SplitTest;
 typedef CGAL::Generic_edge_sorter<Point_3, std::less<Point_3>,  std::less<FT>,
 				  SplitTest, Report_new_vertex<LEdge, LVertex>, std::deque<LEdge*> > GesSM;
 
-int main(int argc, char* argv[]) {
+int main() {
 
 
   std::deque<LEdge*> edges;