Allocator_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
Distance_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
evaluate(const Point_t &q, const Point_t &p, Node_t *n) | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | virtual |
Format_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
HyperRect_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
Key_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
KeyCompare_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
KNearest(unsigned int k=1) | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
m_dist2Fn | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | protected |
m_k | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | protected |
m_queue | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | protected |
Node_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
Point_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
PQueue_t typedef | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
reset() | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
reset(int k) | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
result() | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
shouldRecurse(const Point_t &q, const HyperRect_t &r) | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | virtual |
Vector_t typedef | mpblocks::kd_tree::NearestSearchIface< Traits > | |
~KNearest() | mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | inlinevirtual |
~NearestSearchIface() | mpblocks::kd_tree::NearestSearchIface< Traits > | inlinevirtual |