#include <cstddef>
#include <cmath>
Go to the source code of this file.
Namespaces | |
namespace | KDTree |
Classes | |
struct | KDTree::_Node_base |
struct | KDTree::_Node< _Val > |
class | KDTree::_Node_compare< _Val, _Acc, _Cmp > |
Functions | |
template<typename _ValA, typename _ValB, typename _Cmp, typename _Acc> | |
bool | KDTree::_S_node_compare (const size_t __dim, const _Cmp &__cmp, const _Acc &__acc, const _ValA &__a, const _ValB &__b) |
template<typename _ValA, typename _ValB, typename _Dist, typename _Acc> | |
_Dist::distance_type | KDTree::_S_node_distance (const size_t __dim, const _Dist &__dist, const _Acc &__acc, const _ValA &__a, const _ValB &__b) |
template<typename _ValA, typename _ValB, typename _Dist, typename _Acc> | |
_Dist::distance_type | KDTree::_S_accumulate_node_distance (const size_t __dim, const _Dist &__dist, const _Acc &__acc, const _ValA &__a, const _ValB &__b) |
template<typename _Val, typename _Cmp, typename _Acc> | |
_Node_base * | KDTree::_S_node_descend (const size_t __dim, const _Cmp &__cmp, const _Acc &__acc, const _Val &__val, const _Node_base *__node) |
template<class SearchVal, typename _Val, typename _Cmp, typename _Acc, typename _Dist, typename _Predicate> | |
std::pair< const _Node< _Val > *, std::pair< size_t, typename _Dist::distance_type > > | KDTree::_S_node_nearest (const size_t __k, size_t __dim, SearchVal const &__val, const _Node< _Val > *__node, const _Node_base *__end, const _Node< _Val > *__best, typename _Dist::distance_type __max, const _Cmp &__cmp, const _Acc &__acc, const _Dist &__dist, _Predicate __p) |