mirror of https://github.com/CGAL/cgal
Fix more warnings
This commit is contained in:
parent
701f230f24
commit
2fa19c2818
|
|
@ -203,7 +203,6 @@ public:
|
|||
Array bbox_max;
|
||||
|
||||
// init bbox with first values found
|
||||
for (FT& f : bbox_min)
|
||||
{
|
||||
const Point& p = get (m_point_map, *(point_range.begin()));
|
||||
std::size_t i = 0;
|
||||
|
|
@ -650,7 +649,7 @@ public:
|
|||
std::size_t i = 0;
|
||||
for (const FT& f : cartesian_range(m_bbox_min))
|
||||
{
|
||||
bary[i] = FT(node.global_coordinates()[i]) * size + size / 2.0 + f;
|
||||
bary[i] = FT(node.global_coordinates()[i]) * size + size / FT(2) + f;
|
||||
++ i;
|
||||
}
|
||||
|
||||
|
|
|
|||
|
|
@ -46,7 +46,7 @@ void naive_vs_octree(std::size_t dataset_size) {
|
|||
auto naive_start_time = high_resolution_clock::now();
|
||||
{
|
||||
|
||||
FT distance_nearest = std::numeric_limits<FT>::max();
|
||||
FT distance_nearest = (std::numeric_limits<FT>::max)();
|
||||
for (auto &p : points.points()) {
|
||||
|
||||
FT distance_current = CGAL::squared_distance(p, random_point);
|
||||
|
|
|
|||
Loading…
Reference in New Issue