diff options
author | anmoreau <anmoreau@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2015-06-25 09:50:25 +0000 |
---|---|---|
committer | anmoreau <anmoreau@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2015-06-25 09:50:25 +0000 |
commit | f480e331debb810dcc843d865b8f3e07a6b10d0a (patch) | |
tree | 6875b4d453473b9dc38fc68fc7658031eab9db70 /src/Simplex_tree/test | |
parent | f7090b7ea2f54eb69f31b0199cf4d2dcf5382668 (diff) |
Fix find and insert functions : they now sort a copy of the given range before the recursive calls.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/copy_move@646 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: d45b7e23500076d44c88a44671bd0dd47ebdbbc2
Diffstat (limited to 'src/Simplex_tree/test')
-rw-r--r-- | src/Simplex_tree/test/simplex_tree_unit_test.cpp | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/src/Simplex_tree/test/simplex_tree_unit_test.cpp b/src/Simplex_tree/test/simplex_tree_unit_test.cpp index fdd1a5be..b5c201d9 100644 --- a/src/Simplex_tree/test/simplex_tree_unit_test.cpp +++ b/src/Simplex_tree/test/simplex_tree_unit_test.cpp @@ -130,6 +130,7 @@ void test_simplex_tree_contains(typeST& simplexTree, typeSimplex& simplex, int p BOOST_CHECK( AreAlmostTheSame(simplexTree.filtration(*f_simplex),simplex.second) ); int simplexIndex=simplex.first.size()-1; + std::sort(simplex.first.begin(), simplex.first.end()); // if the simplex wasn't sorted, the next test could fail for( auto vertex : simplexTree.simplex_vertex_range(*f_simplex) ) { std::cout << "test_simplex_tree_contains - vertex=" << vertex << "||" << simplex.first.at(simplexIndex) << std::endl; |