#include <KdtreeBoundingBoxNearestNeighbors.h>
◆ KdtreeBoundingBoxNearestNeighbors()
rl::plan::KdtreeBoundingBoxNearestNeighbors::KdtreeBoundingBoxNearestNeighbors |
( |
Model * |
model | ) |
|
◆ ~KdtreeBoundingBoxNearestNeighbors()
rl::plan::KdtreeBoundingBoxNearestNeighbors::~KdtreeBoundingBoxNearestNeighbors |
( |
| ) |
|
|
virtual |
◆ clear()
void rl::plan::KdtreeBoundingBoxNearestNeighbors::clear |
( |
| ) |
|
|
virtual |
◆ empty()
bool rl::plan::KdtreeBoundingBoxNearestNeighbors::empty |
( |
| ) |
const |
|
virtual |
◆ getChecks()
boost::optional<::std::size_t > rl::plan::KdtreeBoundingBoxNearestNeighbors::getChecks |
( |
| ) |
const |
◆ getNodeDataMax()
std::size_t rl::plan::KdtreeBoundingBoxNearestNeighbors::getNodeDataMax |
( |
| ) |
const |
◆ nearest()
◆ push()
◆ setChecks()
void rl::plan::KdtreeBoundingBoxNearestNeighbors::setChecks |
( |
const ::boost::optional< ::std::size_t > & |
checks | ) |
|
◆ setNodeDataMax()
void rl::plan::KdtreeBoundingBoxNearestNeighbors::setNodeDataMax |
( |
const ::std::size_t & |
nodeDataMax | ) |
|
◆ size()
std::size_t rl::plan::KdtreeBoundingBoxNearestNeighbors::size |
( |
| ) |
const |
|
virtual |
◆ container
The documentation for this class was generated from the following files: