Data structure used for Nearest Neighbor search implementation.
More...
#include <rtree.h>
|
Branch | m_branch |
|
ELEMTYPE | minDist |
|
bool | isLeaf |
|
template<class DATATYPE, class ELEMTYPE, int NUMDIMS, class ELEMTYPEREAL = ELEMTYPE, int TMAXNODES = 8, int TMINNODES = TMAXNODES / 2>
struct RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::NNNode
Data structure used for Nearest Neighbor search implementation.
◆ operator<()
template<class DATATYPE , class ELEMTYPE , int NUMDIMS, class ELEMTYPEREAL = ELEMTYPE, int TMAXNODES = 8, int TMINNODES = TMAXNODES / 2>
bool RTree< DATATYPE, ELEMTYPE, NUMDIMS, ELEMTYPEREAL, TMAXNODES, TMINNODES >::NNNode::operator< |
( |
const NNNode & |
other | ) |
const |
|
inline |
This is reversed on purpose to use std::priority_queue
The documentation for this struct was generated from the following file: