From 7449716dca77dd81759d024ae1e9dbfcfeb202e7 Mon Sep 17 00:00:00 2001 From: fgodi Date: Mon, 28 Nov 2016 15:25:17 +0000 Subject: compute and compute_exactly merged git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bottleneck_integration@1792 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: 7c4e66f5449759f7d99319ca14989b2d74e96e20 --- src/Bottleneck_distance/include/gudhi/Neighbors_finder.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'src/Bottleneck_distance/include/gudhi/Neighbors_finder.h') diff --git a/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h b/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h index f28e21a2..90ddabef 100644 --- a/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h +++ b/src/Bottleneck_distance/include/gudhi/Neighbors_finder.h @@ -122,8 +122,8 @@ inline int Neighbors_finder::pull_near(int u_point_index) { else{ //Is the query point near to a V point in the plane ? Internal_point u_point = g.get_u_point(u_point_index); - std::vector w = {1., 1.}; - K_neighbor_search search(kd_t, u_point, 0., true, Distance(0, 2, w)); + std::array w = { {1., 1.} }; + K_neighbor_search search(kd_t, u_point, 0., true, Distance(0, 2, w.begin(), w.end())); auto it = search.begin(); if(it==search.end() || g.distance(u_point_index, it->first.point_index) > r) return null_point_index(); -- cgit v1.2.3