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

Rename invalidate_built to invalidate_build.

This commit is contained in:
Marc Glisse 2017-05-02 22:23:34 +02:00
parent e5c8142bcf
commit 49dc0855cd
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h
View File

@ -109,7 +109,7 @@ explicit call to `build()` or implicitly by the next query or removal. The only
reason to call this function explicitly is to rebalance the tree after some reason to call this function explicitly is to rebalance the tree after some
number of removals. number of removals.
*/ */
void invalidate_built(); void invalidate_build();
/// @} /// @}
/// \name Operations /// \name Operations

10
Spatial_searching/include/CGAL/Kd_tree.h
View File

@ -259,7 +259,7 @@ public:
build() build()
{ {
// This function is not ready to be called when a tree already exists, one // This function is not ready to be called when a tree already exists, one
// must call invalidate_built() first. // must call invalidate_build() first.
CGAL_assertion(!is_built()); CGAL_assertion(!is_built());
CGAL_assertion(!removed_); CGAL_assertion(!removed_);
const Point_d& p = *pts.begin(); const Point_d& p = *pts.begin();
@ -312,7 +312,7 @@ public:
return built_; return built_;
} }
void invalidate_built() void invalidate_build()
{ {
if(removed_){ if(removed_){
// Walk the tree to collect the remaining points. // Walk the tree to collect the remaining points.
@ -335,7 +335,7 @@ public:
void clear() void clear()
{ {
invalidate_built(); invalidate_build();
pts.clear(); pts.clear();
removed_ = false; removed_ = false;
} }
@ -343,7 +343,7 @@ public:
void void
insert(const Point_d& p) insert(const Point_d& p)
{ {
invalidate_built(); invalidate_build();
pts.push_back(p); pts.push_back(p);
} }
@ -351,7 +351,7 @@ public:
void void
insert(InputIterator first, InputIterator beyond) insert(InputIterator first, InputIterator beyond)
{ {
invalidate_built(); invalidate_build();
pts.insert(pts.end(),first, beyond); pts.insert(pts.end(),first, beyond);
} }