NearestNeighborsSqrtApprox.h
A nearest neighbors datastructure that uses linear search.
Definition: NearestNeighborsLinear.h:57
std::size_t size() const override
Get the number of elements in the datastructure.
Definition: NearestNeighborsLinear.h:144
void add(const _T &data) override
Add an element to the datastructure.
Definition: NearestNeighborsLinear.h:75
bool remove(const _T &data) override
Remove an element from the datastructure.
Definition: NearestNeighborsLinear.h:86
A nearest neighbors datastructure that uses linear search. The linear search is done over sqrt(n) ele...
Definition: NearestNeighborsSqrtApprox.h:58
void add(const std::vector< _T > &data) override
Add a vector of points.
Definition: NearestNeighborsSqrtApprox.h:77
bool remove(const _T &data) override
Remove an element from the datastructure.
Definition: NearestNeighborsSqrtApprox.h:83
void add(const _T &data) override
Add an element to the datastructure.
Definition: NearestNeighborsSqrtApprox.h:71
_T nearest(const _T &data) const override
Get the nearest neighbor of a point.
Definition: NearestNeighborsSqrtApprox.h:91
void updateCheckCount()
The maximum number of checks to perform when searching for a nearest neighbor.
Definition: NearestNeighborsSqrtApprox.h:120
std::size_t offset_
The offset to start checking at (between 0 and checks_)
Definition: NearestNeighborsSqrtApprox.h:129
std::size_t checks_
The number of checks to be performed when looking for a nearest neighbor.
Definition: NearestNeighborsSqrtApprox.h:126
Main namespace. Contains everything in this library.
Definition: ConstrainedSpaceInformation.h:53