Returns the dim'th component of the idx'th point in the class:

Must return the number of data points

Helper accessor to the dataset points:

Frees the previously-built index. Automatically called within * buildIndex(). */

* Called during search to add an element matching the criteria. * @return true if the search should be continued, false if the results are * suf

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist. *

* Builds the index */

Frees all allocated memory chunks */

* Find the "num_closest" nearest neighbors to the \a query_point[0:dim-1]. * Their indices and distances are stored in the provided pointers to

* Returns a pointer to a piece of new memory of the given size in bytes * allocated from the pool. */

finds position of least significant unset bit */

Constructor: takes a const ref to the matrix object with the data points

Deleted copy constructor*/

* KDTree constructor * * Refer to docs in README.md or online in * https://github.com/jlblancoc/nanoflann * * The KD-Tree point dimensi

* KDTree constructor * * Refer to docs in README.md or online in * https://github.com/jlblancoc/nanoflann * * The KD-Tree point dimensi

Default constructor. Initializes a new pool. */

* Note: Only use-defined parameters are `num_laser_channels_per_zone_` and * `num_sectors_for_each_zone_` */

* Called during search to add an element matching the criteria. * @return true if the search should be continued, false if the results are * suf

Add points to the set, Inserts all points from [start, end] */

* Builds the index */