49 KDNODE(
KDTREE *tree,
float key[],
void *data,
int Index);
96#define RootOf(T) ((T)->Root.Left->Data)
101KDTREE *
MakeKDTree(int16_t KeySize,
const PARAM_DESC KeyDesc[]);
103void KDStore(KDTREE *Tree,
float *Key,
void *Data);
105void KDDelete(KDTREE *Tree,
float Key[],
void *Data);
108 int *NumberOfResults,
void **NBuffer,
float DBuffer[]);
void KDDelete(KDTREE *Tree, float Key[], void *Data)
void Walk(KDTREE *tree, void_proc action, void *context, KDNODE *sub_tree, int32_t level)
void KDStore(KDTREE *Tree, float *Key, void *Data)
float ComputeDistance(int k, PARAM_DESC *dim, float p1[], float p2[])
float DistanceSquared(int k, PARAM_DESC *dim, float p1[], float p2[])
void InsertNodes(KDTREE *tree, KDNODE *nodes)
KDTREE * MakeKDTree(int16_t KeySize, const PARAM_DESC KeyDesc[])
void KDWalk(KDTREE *Tree, void_proc action, void *context)
int QueryInSearch(KDTREE *tree)
void KDNearestNeighborSearch(KDTREE *Tree, float Query[], int QuerySize, float MaxDistance, int *NumberOfResults, void **NBuffer, float DBuffer[])
std::vector< PARAM_DESC > KeyDesc