Go to the source code of this file.
|
#define | RootOf(T) ((T)->Root.Left->Data) |
|
|
KDTREE * | tesseract::MakeKDTree (int16_t KeySize, const PARAM_DESC KeyDesc[]) |
|
void | tesseract::KDStore (KDTREE *Tree, float *Key, CLUSTER *Data) |
|
void | tesseract::KDDelete (KDTREE *Tree, float Key[], void *Data) |
|
void | tesseract::KDNearestNeighborSearch (KDTREE *Tree, float Query[], int QuerySize, float MaxDistance, int *NumberOfResults, void **NBuffer, float DBuffer[]) |
|
void | tesseract::KDWalk (KDTREE *Tree, kdwalk_proc action, ClusteringContext *context) |
|
float | tesseract::DistanceSquared (int k, PARAM_DESC *dim, float p1[], float p2[]) |
|
float | tesseract::ComputeDistance (int k, PARAM_DESC *dim, float p1[], float p2[]) |
|
int | tesseract::QueryInSearch (KDTREE *tree) |
|
void | tesseract::Walk (KDTREE *tree, kdwalk_proc action, ClusteringContext *context, KDNODE *sub_tree, int32_t level) |
|
void | tesseract::InsertNodes (KDTREE *tree, KDNODE *nodes) |
|
◆ RootOf
#define RootOf |
( |
|
T | ) |
((T)->Root.Left->Data) |