mirror of https://github.com/CGAL/cgal
3b6a821105
This
vector<const Point_d*> data;
is no longer needed after being `.clear()`ed at the end of `build()`.
This can save a good amount of memory, a `Point_d*` on a 64-bit system
is 8 bytes; almost as large as a typical 3-float `Point_d`.
There's no point keeping its capacity, since any call to `build()`
will efficiently `.reserve()` it anyway.
|
||
|---|---|---|
| .. | ||
| Spatial_searching/internal | ||
| Euclidean_distance.h | ||
| Euclidean_distance_sphere_point.h | ||
| Fuzzy_iso_box.h | ||
| Fuzzy_sphere.h | ||
| Incremental_neighbor_search.h | ||
| Iso_rectangle_d.h | ||
| K_neighbor_search.h | ||
| Kd_tree.h | ||
| Kd_tree_node.h | ||
| Kd_tree_rectangle.h | ||
| Manhattan_distance_iso_box_point.h | ||
| Orthogonal_incremental_neighbor_search.h | ||
| Orthogonal_k_neighbor_search.h | ||
| Plane_separator.h | ||
| Point_container.h | ||
| Search_traits.h | ||
| Search_traits_2.h | ||
| Search_traits_3.h | ||
| Search_traits_adapter.h | ||
| Search_traits_d.h | ||
| Splitters.h | ||
| Weighted_Minkowski_distance.h | ||