NearestNeighborsSqrtApprox.h
89 }
void updateCheckCount()
The maximum number of checks to perform when searching for a nearest neighbor.
Definition: NearestNeighborsSqrtApprox.h:184
bool remove(const _T &data) override
Remove an element from the datastructure.
Definition: NearestNeighborsLinear.h:150
bool remove(const _T &data) override
Remove an element from the datastructure.
Definition: NearestNeighborsSqrtApprox.h:147
void add(const _T &data) override
Add an element to the datastructure.
Definition: NearestNeighborsSqrtApprox.h:135
std::size_t offset_
The offset to start checking at (between 0 and checks_)
Definition: NearestNeighborsSqrtApprox.h:193
void add(const _T &data) override
Add an element to the datastructure.
Definition: NearestNeighborsLinear.h:139
_T nearest(const _T &data) const override
Get the nearest neighbor of a point.
Definition: NearestNeighborsSqrtApprox.h:155
std::size_t checks_
The number of checks to be performed when looking for a nearest neighbor.
Definition: NearestNeighborsSqrtApprox.h:190
std::vector< _T > data_
The data elements stored in this structure.
Definition: NearestNeighborsLinear.h:220
std::size_t size() const override
Get the number of elements in the datastructure.
Definition: NearestNeighborsLinear.h:208
A nearest neighbors datastructure that uses linear search.
Definition: NearestNeighborsLinear.h:88