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

Fix warnings of possible loss of data converting std::size_t to unsigned int

This commit is contained in:
Simon Giraudot 2015-08-19 15:22:17 +02:00
parent fbf99e3a35
commit 05e0965655
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Point_set_processing_3/include/CGAL/bilateral_smooth_point_set.h
View File

@ -451,7 +451,7 @@ bilateral_smooth_point_set(
pwns.push_back(Pwn(p, n)); pwns.push_back(Pwn(p, n));
} }
unsigned int nb_points = pwns.size(); std::size_t nb_points = pwns.size();
#ifdef CGAL_PSP3_VERBOSE #ifdef CGAL_PSP3_VERBOSE
std::cout << "Initialization and compute max spacing: " << std::endl; std::cout << "Initialization and compute max spacing: " << std::endl;

8
Point_set_processing_3/include/CGAL/edge_aware_upsample_point_set.h
View File

@ -153,7 +153,7 @@ update_new_point(
typedef typename Kernel::FT FT; typedef typename Kernel::FT FT;
typedef typename rich_grid_internal::Rich_point<Kernel> Rich_point; typedef typename rich_grid_internal::Rich_point<Kernel> Rich_point;
CGAL_assertion_code( unsigned int size = rich_point_set.size() ); CGAL_assertion_code( unsigned int size = static_cast<unsigned int>(rich_point_set.size()) );
CGAL_point_set_processing_precondition(father_index >= 0 && CGAL_point_set_processing_precondition(father_index >= 0 &&
father_index < size); father_index < size);
CGAL_point_set_processing_precondition(mother_index >= 0 && CGAL_point_set_processing_precondition(mother_index >= 0 &&
@ -431,7 +431,7 @@ edge_aware_upsample_point_set(
std::cout << "current radius: " << current_radius << std::endl; std::cout << "current radius: " << current_radius << std::endl;
#endif #endif
unsigned int current_size = rich_point_set.size(); std::size_t current_size = rich_point_set.size();
std::vector<bool> is_pass_threshold(current_size, false); std::vector<bool> is_pass_threshold(current_size, false);
if (iter_time == 0) if (iter_time == 0)
@ -533,7 +533,7 @@ edge_aware_upsample_point_set(
Rich_point& base = rich_point_set[mother_index]; Rich_point& base = rich_point_set[mother_index];
Vector diff_v_base = base.pt - v.pt; Vector diff_v_base = base.pt - v.pt;
new_v.pt = v.pt + (diff_v_base * FT(0.5)); new_v.pt = v.pt + (diff_v_base * FT(0.5));
new_v.index = rich_point_set.size(); new_v.index = static_cast<unsigned int>(rich_point_set.size());
unsigned int new_point_index = new_v.index; unsigned int new_point_index = new_v.index;
rich_point_set.push_back(new_v); rich_point_set.push_back(new_v);
@ -570,7 +570,7 @@ edge_aware_upsample_point_set(
} }
} }
for (unsigned int i = number_of_input; i < rich_point_set.size(); ++i) for (std::size_t i = number_of_input; i < rich_point_set.size(); ++i)
{ {
Rich_point& v = rich_point_set[i]; Rich_point& v = rich_point_set[i];
Point point = v.pt; Point point = v.pt;