songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Allocate a big enough vector for the nodes of the K3_tree

This commit is contained in:
Andreas Fabri 2022-04-06 15:55:49 +01:00
parent 45330944e4
commit d5311e37c4
1 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Nef_3/include/CGAL/Nef_3/K3_tree.h
View File

@ -22,13 +22,11 @@
#include <CGAL/Nef_3/quotient_coordinates_to_homogeneous_point.h> #include <CGAL/Nef_3/quotient_coordinates_to_homogeneous_point.h>
#include <CGAL/Lazy_kernel.h> #include <CGAL/Lazy_kernel.h>
#include <CGAL/Cartesian.h> #include <CGAL/Cartesian.h>
#include <boost/container/deque.hpp>
#include <deque>
#include <sstream> #include <sstream>
#include <string> #include <string>
#include <map> #include <map>
#include <vector>
#undef CGAL_NEF_DEBUG #undef CGAL_NEF_DEBUG
#define CGAL_NEF_DEBUG 503 #define CGAL_NEF_DEBUG 503
@ -212,7 +210,7 @@ private:
Object_list object_list; Object_list object_list;
}; };
typedef boost::container::deque<Node> Node_range; typedef std::vector<Node> Node_range;
typedef Node* Node_handle; typedef Node* Node_handle;
@ -439,6 +437,7 @@ public:
CGAL_NEF_TRACEN("reference counted " << reference_counted); CGAL_NEF_TRACEN("reference counted " << reference_counted);
#endif #endif
non_efective_splits=0; non_efective_splits=0;
nodes.reserve(2 * (vertices.size() + edges.size() + facets.size()));
root = build_kdtree(vertices, edges, facets, 0); root = build_kdtree(vertices, edges, facets, 0);
} }
const Object_list& objects_around_point( const Point_3& p) const { const Object_list& objects_around_point( const Point_3& p) const {