Code review : no need to clear intersection

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/graph_expansion_with_blocker_oracle@2633 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 9a59d20c5786b012229cc5db45181ba165af8f8a

1 files changed, 0 insertions, 5 deletions

diff --git a/src/Simplex_tree/include/gudhi/Simplex_tree.h b/src/Simplex_tree/include/gudhi/Simplex_tree.h
index aa097a38..b1767f63 100644
--- a/src/Simplex_tree/include/gudhi/Simplex_tree.h
+++ b/src/Simplex_tree/include/gudhi/Simplex_tree.h
@@ -1146,13 +1146,9 @@ class Simplex_tree {
       }
       if (intersection.size() != 0) {
         // Reverse the order to insert
-        //std::reverse(std::begin(intersection), std::end(intersection));
         Siblings * new_sib = new Siblings(siblings,  // oncles
                                           simplex->first,  // parent
                                           boost::adaptors::reverse(intersection));  // boost::container::ordered_unique_range_t
-        // intersection must be cleared before the function to be called recursively
-        intersection.clear();
-
         std::vector<Simplex_handle> blocked_new_sib_list;
         // As all intersections are inserted, we can call the blocker function on all new_sib members
         for (auto new_sib_member = new_sib->members().begin();
@@ -1179,7 +1175,6 @@ class Simplex_tree {
       } else {
         // ensure the children property
         simplex->second.assign_children(siblings);
-        intersection.clear();
       }
     }
   }