#include <kdtree.h>
Definition at line 41 of file kdtree.h.
◆ KDNODE() [1/2]
tesseract::KDNODE::KDNODE |
( |
| ) |
|
|
default |
This routine allocates memory for a new K-D tree node and places the specified Key and Data into it. The left and right subtree pointers for the node are initialized to empty subtrees.
- Parameters
-
tree | The tree to create the node for |
Key | Access key for new node in KD tree |
Data | ptr to data to be stored in new node |
Index | index of Key to branch on |
◆ KDNODE() [2/2]
tesseract::KDNODE::KDNODE |
( |
KDTREE * |
tree, |
|
|
float |
key[], |
|
|
CLUSTER * |
data, |
|
|
int |
Index |
|
) |
| |
|
inline |
◆ ~KDNODE()
tesseract::KDNODE::~KDNODE |
( |
| ) |
|
|
inline |
◆ BranchPoint
float tesseract::KDNODE::BranchPoint |
needed to make deletes work efficiently
Definition at line 59 of file kdtree.h.
◆ Data
data that corresponds to key
Definition at line 58 of file kdtree.h.
◆ Key
float* tesseract::KDNODE::Key |
search key
Definition at line 57 of file kdtree.h.
◆ Left
KDNODE* tesseract::KDNODE::Left |
ptrs for KD tree structure
Definition at line 62 of file kdtree.h.
◆ LeftBranch
float tesseract::KDNODE::LeftBranch |
used to optimize search pruning
Definition at line 60 of file kdtree.h.
◆ Right
KDNODE* tesseract::KDNODE::Right |
◆ RightBranch
float tesseract::KDNODE::RightBranch |
used to optimize search pruning
Definition at line 61 of file kdtree.h.
The documentation for this struct was generated from the following file:
- /media/home/debian/src/github/tesseract-ocr/tesseract/src/classify/kdtree.h