#include <NearestNeighborsGNAT.h>
Public Member Functions | |
void | add (GNAT &gnat, const _T &data) |
void | insertNeighborK (NearQueue &nbh, std::size_t k, const _T &data, double dist) const |
void | insertNeighborR (NearQueue &nbh, double r, const _T &data, double dist) const |
void | list (std::vector< _T > &data) const |
void | nearestK (const GNAT &gnat, const _T &data, std::size_t k, NearQueue &nbh, NodeQueue &nodeQueue) const |
void | nearestR (const GNAT &gnat, const _T &data, double r, NearQueue &nbh, NodeQueue &nodeQueue) const |
bool | needToSplit (const GNAT &gnat) const |
Node (const Node *parent, int degree, const _T &pivot) | |
void | split (GNAT &gnat) |
~Node () | |
Public Attributes | |
std::vector< Node * > | children_ |
std::vector< _T > | data_ |
unsigned int | degree_ |
double | maxRadius_ |
std::vector< double > | maxRange_ |
double | minRadius_ |
std::vector< double > | minRange_ |
const _T | pivot_ |
Friends | |
std::ostream & | operator<< (std::ostream &out, const Node &node) |
Definition at line 297 of file NearestNeighborsGNAT.h.
ompl::NearestNeighborsGNAT< _T >::Node::Node | ( | const Node * | parent, | |
int | degree, | |||
const _T & | pivot | |||
) | [inline] |
Definition at line 300 of file NearestNeighborsGNAT.h.
ompl::NearestNeighborsGNAT< _T >::Node::~Node | ( | ) | [inline] |
Definition at line 308 of file NearestNeighborsGNAT.h.
void ompl::NearestNeighborsGNAT< _T >::Node::add | ( | GNAT & | gnat, | |
const _T & | data | |||
) | [inline] |
Definition at line 314 of file NearestNeighborsGNAT.h.
void ompl::NearestNeighborsGNAT< _T >::Node::insertNeighborK | ( | NearQueue & | nbh, | |
std::size_t | k, | |||
const _T & | data, | |||
double | dist | |||
) | const [inline] |
Definition at line 409 of file NearestNeighborsGNAT.h.
void ompl::NearestNeighborsGNAT< _T >::Node::insertNeighborR | ( | NearQueue & | nbh, | |
double | r, | |||
const _T & | data, | |||
double | dist | |||
) | const [inline] |
Definition at line 465 of file NearestNeighborsGNAT.h.
void ompl::NearestNeighborsGNAT< _T >::Node::list | ( | std::vector< _T > & | data | ) | const [inline] |
Definition at line 511 of file NearestNeighborsGNAT.h.
void ompl::NearestNeighborsGNAT< _T >::Node::nearestK | ( | const GNAT & | gnat, | |
const _T & | data, | |||
std::size_t | k, | |||
NearQueue & | nbh, | |||
NodeQueue & | nodeQueue | |||
) | const [inline] |
Definition at line 420 of file NearestNeighborsGNAT.h.
void ompl::NearestNeighborsGNAT< _T >::Node::nearestR | ( | const GNAT & | gnat, | |
const _T & | data, | |||
double | r, | |||
NearQueue & | nbh, | |||
NodeQueue & | nodeQueue | |||
) | const [inline] |
Definition at line 471 of file NearestNeighborsGNAT.h.
bool ompl::NearestNeighborsGNAT< _T >::Node::needToSplit | ( | const GNAT & | gnat | ) | const [inline] |
Definition at line 353 of file NearestNeighborsGNAT.h.
void ompl::NearestNeighborsGNAT< _T >::Node::split | ( | GNAT & | gnat | ) | [inline] |
Definition at line 358 of file NearestNeighborsGNAT.h.
std::ostream& operator<< | ( | std::ostream & | out, | |
const Node & | node | |||
) | [friend] |
Definition at line 520 of file NearestNeighborsGNAT.h.
std::vector<Node*> ompl::NearestNeighborsGNAT< _T >::Node::children_ |
Definition at line 552 of file NearestNeighborsGNAT.h.
std::vector<_T> ompl::NearestNeighborsGNAT< _T >::Node::data_ |
Definition at line 551 of file NearestNeighborsGNAT.h.
unsigned int ompl::NearestNeighborsGNAT< _T >::Node::degree_ |
Definition at line 545 of file NearestNeighborsGNAT.h.
double ompl::NearestNeighborsGNAT< _T >::Node::maxRadius_ |
Definition at line 548 of file NearestNeighborsGNAT.h.
std::vector<double> ompl::NearestNeighborsGNAT< _T >::Node::maxRange_ |
Definition at line 550 of file NearestNeighborsGNAT.h.
double ompl::NearestNeighborsGNAT< _T >::Node::minRadius_ |
Definition at line 547 of file NearestNeighborsGNAT.h.
std::vector<double> ompl::NearestNeighborsGNAT< _T >::Node::minRange_ |
Definition at line 549 of file NearestNeighborsGNAT.h.
const _T ompl::NearestNeighborsGNAT< _T >::Node::pivot_ |
Definition at line 546 of file NearestNeighborsGNAT.h.