summaryrefslogtreecommitdiff
path: root/src/Bottleneck_distance/test/bottleneck_unit_test.cpp
diff options
context:
space:
mode:
authorfgodi <fgodi@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2016-11-28 09:57:43 +0000
committerfgodi <fgodi@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2016-11-28 09:57:43 +0000
commite9dd788438bff7289ddff1e0ade2de0f031a2f9b (patch)
tree09f21d3a81cea03e65ad5818d6c38b42032c0888 /src/Bottleneck_distance/test/bottleneck_unit_test.cpp
parentaa6960f50b6a9e20e5361b4dc87ac03a33dab1fc (diff)
Bug fix
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bottleneck_integration@1789 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: f2c3ef0dab1a0d80cfcf0018da83dd2b6b9a9ef1
Diffstat (limited to 'src/Bottleneck_distance/test/bottleneck_unit_test.cpp')
-rw-r--r--src/Bottleneck_distance/test/bottleneck_unit_test.cpp30
1 files changed, 0 insertions, 30 deletions
diff --git a/src/Bottleneck_distance/test/bottleneck_unit_test.cpp b/src/Bottleneck_distance/test/bottleneck_unit_test.cpp
index 31ba18ad..7edfa062 100644
--- a/src/Bottleneck_distance/test/bottleneck_unit_test.cpp
+++ b/src/Bottleneck_distance/test/bottleneck_unit_test.cpp
@@ -89,36 +89,6 @@ BOOST_AUTO_TEST_CASE(persistence_diagrams_graph){
BOOST_CHECK(std::count(d.begin(), d.end(), G::distance((n1+n2)-1,(n1+n2)-1))==1);
}
-BOOST_AUTO_TEST_CASE(planar_neighbors_finder) {
- Planar_neighbors_finder pnf(1.);
- for(int v_point_index=0; v_point_index<n1; v_point_index+=2)
- pnf.add(v_point_index);
- //
- BOOST_CHECK(pnf.contains(0));
- BOOST_CHECK(!pnf.contains(1));
- BOOST_CHECK(pnf.contains(2));
- BOOST_CHECK(!pnf.contains(3));
- //
- pnf.remove(0);
- pnf.remove(1);
- //
- BOOST_CHECK(!pnf.contains(0));
- BOOST_CHECK(!pnf.contains(1));
- BOOST_CHECK(pnf.contains(2));
- BOOST_CHECK(!pnf.contains(3));
- //
- int v_point_index_1 = pnf.pull_near(n2/2);
- BOOST_CHECK((v_point_index_1 == -1) || ((G::distance(n2/2,v_point_index_1)<=1.)));
- BOOST_CHECK(!pnf.contains(v_point_index_1));
- std::vector<int> l = pnf.pull_all_near(n2/2);
- bool v = true;
- for(auto it = l.cbegin(); it != l.cend(); ++it)
- v = v && (G::distance(n2/2,*it)>1.);
- BOOST_CHECK(v);
- int v_point_index_2 = pnf.pull_near(n2/2);
- BOOST_CHECK(v_point_index_2 == -1);
-}
-
BOOST_AUTO_TEST_CASE(neighbors_finder) {
Neighbors_finder nf(1.);
for(int v_point_index=1; v_point_index<((n2+n1)*9/10); v_point_index+=2)