This record represents a branch point when finding neighbors in the tree.
It contains a record of the minimum distance to the query point, as well as the node at which the search resumes.
Public Member Functions | |
| BranchStruct () | |
| BranchStruct (const T &aNode, DistanceType dist) | |
| bool | operator< (const BranchStruct< T, DistanceType > &rhs) const |
Public Attributes | |
| T | node |
| DistanceType | mindist |
| nanoflann::KDTreeSingleIndexAdaptor::BranchStruct::BranchStruct | ( | ) | [inline] |
Definition at line 652 of file nanoflann.hpp.
| nanoflann::KDTreeSingleIndexAdaptor::BranchStruct::BranchStruct | ( | const T & | aNode, |
| DistanceType | dist | ||
| ) | [inline] |
Definition at line 653 of file nanoflann.hpp.
| bool nanoflann::KDTreeSingleIndexAdaptor::BranchStruct::operator< | ( | const BranchStruct< T, DistanceType > & | rhs | ) | const [inline] |
Definition at line 655 of file nanoflann.hpp.
Definition at line 650 of file nanoflann.hpp.
Definition at line 649 of file nanoflann.hpp.
| Page generated by Doxygen 1.7.5 for MRPT 0.9.5 SVN: at Thu Oct 13 21:25:36 UTC 2011 |