int -> size_t

Polygon/include/CGAL/Polygon_2.h

@@ -313,19 +313,19 @@ class Polygon_2 {
     //             Random access methods
     //--------------------------------------------------------
 
-    const Point_2& vertex(int i) const
+  const Point_2& vertex(std::size_t i) const
       { return *(d_container.begin() + i); }
 
-//    Point_2& vertex(int i)
+//    Point_2& vertex(std::size_t i)
 //      { return *(d_container.begin() + i); }
 
-    const Point_2& operator[](int i) const
+  const Point_2& operator[](std::size_t i) const
       { return vertex(i); }
 
-//    Point_2& operator[](int i)
+//    Point_2& operator[](std::size_t i)
 //      { return vertex(i); }
 
-    Segment_2 edge(int i) const
+  Segment_2 edge(std::size_t i) const
       { return *(edges_begin() + i); }
 
     //--------------------------------------------------------

Polygon/test/Polygon/PolygonTest.cpp

@@ -194,7 +194,7 @@ void test_access_functions(VectorPolygon& p)
   cout << "p.is_empty()           = " << (p.is_empty() ? "true" : "false") << endl;
 
   // test random access methods
-  for (int i=0; i<p.size(); i++) {
+  for (std::size_t i=0; i<p.size(); i++) {
     cout << "vertex " << i << " = " << p.vertex(i) << endl;
     cout << "edge   " << i << " = " << p.edge(i) << endl;
   }

Polygon/test/Polygon/SimplicityTest.cpp

@@ -1,6 +1,5 @@
 #define CGAL_POLYGON_DEBUG 1
 
-#include <CGAL/basic.h>
 #include <CGAL/Cartesian.h>
 #include <CGAL/Quotient.h>
 #ifdef CGAL_USE_GMP