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

fix warning

This commit is contained in:
Sébastien Loriot 2022-08-04 08:46:18 +02:00
parent cbabc5f0d3
commit ce0ae181c4
3 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Shape_detection/examples/Shape_detection/include/utils.h
View File

@ -261,7 +261,7 @@ struct Insert_point_colored_by_region_index {
const unsigned char g = static_cast<unsigned char>(64 + rand.get_int(0, 192)); const unsigned char g = static_cast<unsigned char>(64 + rand.get_int(0, 192));
const unsigned char b = static_cast<unsigned char>(64 + rand.get_int(0, 192)); const unsigned char b = static_cast<unsigned char>(64 + rand.get_int(0, 192));
for (const Item index : region.second) { for (Item index : region.second) {
const auto& point = get(m_point_map, index); const auto& point = get(m_point_map, index);
const auto it = m_output_range.insert(point); const auto it = m_output_range.insert(point);

2
Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h
View File

@ -326,7 +326,7 @@ namespace Point_set {
// Flip the plane's normal to agree with all input normals. // Flip the plane's normal to agree with all input normals.
long votes_to_keep_normal = 0; long votes_to_keep_normal = 0;
for (const Item item : region) { for (Item item : region) {
const Vector_3& normal = get(m_normal_map, item); const Vector_3& normal = get(m_normal_map, item);
const bool agrees = const bool agrees =
m_scalar_product_3(normal, unoriented_normal_of_best_fit) > FT(0); m_scalar_product_3(normal, unoriented_normal_of_best_fit) > FT(0);

6
Shape_detection/include/CGAL/Shape_detection/Region_growing/Region_growing.h
View File

@ -378,7 +378,7 @@ namespace Shape_detection {
m_neighbor_query(item, neighbors); m_neighbor_query(item, neighbors);
// Visit all found neighbors. // Visit all found neighbors.
for (const Item neighbor : neighbors) { for (Item neighbor : neighbors) {
if (!get(m_visited, neighbor)) { if (!get(m_visited, neighbor)) {
if (m_region_type.is_part_of_region(item, neighbor, region)) { if (m_region_type.is_part_of_region(item, neighbor, region)) {
@ -409,7 +409,7 @@ namespace Shape_detection {
// Verify that associated elements are still within the tolerance. // Verify that associated elements are still within the tolerance.
bool fits = true; bool fits = true;
Item former = region.front(); Item former = region.front();
for (const Item item : region) { for (Item item : region) {
if (!m_region_type.is_part_of_region(former, item, region)) { if (!m_region_type.is_part_of_region(former, item, region)) {
fits = false; fits = false;
break; break;
@ -452,7 +452,7 @@ namespace Shape_detection {
} }
void revert(const Region& region) { void revert(const Region& region) {
for (const Item item : region) for (Item item : region)
put(m_visited, item, false); put(m_visited, item, false);
} }
}; };