From 7cf48beb417f54062aaf9e3452e7e6bd83b5b539 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Fri, 13 Dec 2013 12:01:33 +0100 Subject: [PATCH] int -> size_t to remove warnings --- .../CGAL/internal/Surface_mesh_segmentation/Filters.h | 2 +- .../internal/Surface_mesh_segmentation/K_means_clustering.h | 6 +++--- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/Filters.h b/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/Filters.h index 2e528a4a696..2de913a3c04 100644 --- a/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/Filters.h +++ b/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/Filters.h @@ -155,7 +155,7 @@ public: neighbor_values.push_back(values[it->first]); } // Find median. - int half_neighbor_count = neighbor_values.size() / 2; + std::size_t half_neighbor_count = neighbor_values.size() / 2; std::nth_element(neighbor_values.begin(), neighbor_values.begin() + half_neighbor_count, neighbor_values.end()); double median_sdf = neighbor_values[half_neighbor_count]; diff --git a/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h b/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h index f74de246950..2528fd0f64b 100644 --- a/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h +++ b/Surface_mesh_segmentation/include/CGAL/internal/Surface_mesh_segmentation/K_means_clustering.h @@ -134,9 +134,9 @@ public: // this can not select an already selected item since either (by considering that upper bounds returns greater) // - aready selected item is at 0, and its value is 0.0 // - or its value is equal to value of previous element - int selection_index = std::upper_bound(distance_square_cumulative.begin(), - distance_square_cumulative.end(), random_ds) - - distance_square_cumulative.begin(); + std::size_t selection_index = std::upper_bound( + distance_square_cumulative.begin(), distance_square_cumulative.end(), random_ds) + - distance_square_cumulative.begin(); centers.push_back(points[selection_index]); }