From 2328885e90c7c3a906968faca032c75ca92db276 Mon Sep 17 00:00:00 2001 From: Andreas Fabri Date: Fri, 6 Aug 2010 11:43:29 +0000 Subject: [PATCH] int -> size_t --- Min_circle_2/include/CGAL/Min_circle_2.h | 2 +- Min_circle_2/test/Min_circle_2/test_Min_circle.cpp | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/Min_circle_2/include/CGAL/Min_circle_2.h b/Min_circle_2/include/CGAL/Min_circle_2.h index 3d9677f1e64..16a6721028c 100644 --- a/Min_circle_2/include/CGAL/Min_circle_2.h +++ b/Min_circle_2/include/CGAL/Min_circle_2.h @@ -192,7 +192,7 @@ class Min_circle_2 { // random access for support points inline const Point& - support_point( int i) const + support_point( std::size_t i) const { CGAL_optimisation_precondition( (i >= 0) && (i < number_of_support_points())); diff --git a/Min_circle_2/test/Min_circle_2/test_Min_circle.cpp b/Min_circle_2/test/Min_circle_2/test_Min_circle.cpp index 26f77685db8..b020ad0f099 100644 --- a/Min_circle_2/test/Min_circle_2/test_Min_circle.cpp +++ b/Min_circle_2/test/Min_circle_2/test_Min_circle.cpp @@ -69,7 +69,7 @@ cover_Min_circle_2( bool verbose, const Traits&, const RT&) const int n = 20; CGAL::Random random_x, random_y; Point random_points[ n]; - int i; + std::size_t i; verr << n << " random points from [0,128)^2:" << endl; for ( i = 0; i < n; ++i) { random_points[ i] = Point( RT( random_x( 128)),