songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

removed unused variable

This commit is contained in:
Peter Hachenberger 2008-07-28 09:18:10 +00:00
parent f6cb1522eb
commit 7b5b6f6fc5
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Convex_decomposition_3/test/Convex_decomposition_3/edge_sorter.cpp
View File

@ -49,7 +49,7 @@ bool check_sorting(Iterator begin, Iterator end, Compare& compare)
if(begin == end) return true; if(begin == end) return true;
Iterator next = begin; Iterator next = begin;
for(++next; next != end; ++begin, ++next) { for(++next; next != end; ++begin, ++next) {
if((*next)->source()->point() < (*begin)->source()->point()) if(compare((*next)->source()->point(), (*begin)->source()->point()))
return false; return false;
} }
return true; 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>, typedef CGAL::Generic_edge_sorter<Point_3, std::less<Point_3>, std::less<FT>,
SplitTest, Report_new_vertex<LEdge, LVertex>, std::deque<LEdge*> > GesSM; SplitTest, Report_new_vertex<LEdge, LVertex>, std::deque<LEdge*> > GesSM;
int main(int argc, char* argv[]) { int main() {
std::deque<LEdge*> edges; std::deque<LEdge*> edges;