#include "findseam.h"
#include "gradechop.h"
#include "olutil.h"
#include "plotedges.h"
#include "outlines.h"
#include "freelist.h"
#include "seam.h"
#include "wordrec.h"
Namespaces | |
namespace | tesseract |
Defines | |
#define | SPLIT_CLOSENESS 20 |
#define | MAX_NUM_SEAMS 150 |
#define | MAX_OLD_SEAMS 150 |
#define | NO_FULL_PRIORITY -1 |
#define | BAD_PRIORITY 9999.0 |
#define | add_seam_to_queue(seams, seam, priority) |
#define | best_seam_priority(seam_queue) |
#define | create_seam_queue(seam_queue) (seam_queue = MakeHeap (MAX_NUM_SEAMS)) |
#define | create_seam_pile(seam_pile) (seam_pile = array_new (MAX_OLD_SEAMS)) |
#define | delete_seam_queue(seam_queue) |
#define | pop_next_seam(seams, seam, priority) (HeapPop (seams,&priority,&seam) == TESS_HEAP_OK) \ |
#define | seam_queue_element(seam_queue, index) |
#define add_seam_to_queue | ( | seams, | |||
seam, | |||||
priority | ) |
#define BAD_PRIORITY 9999.0 |
#define best_seam_priority | ( | seam_queue | ) |
(HeapEmpty (seam_queue) ? \ NO_FULL_PRIORITY : \ ((SEAM*) seam_queue_element(seam_queue, 0))->priority)
#define create_seam_pile | ( | seam_pile | ) | (seam_pile = array_new (MAX_OLD_SEAMS)) |
#define create_seam_queue | ( | seam_queue | ) | (seam_queue = MakeHeap (MAX_NUM_SEAMS)) |
#define delete_seam_queue | ( | seam_queue | ) |
(FreeHeapData (seam_queue, delete_seam), \ seam_queue = NULL) \
#define MAX_NUM_SEAMS 150 |
#define MAX_OLD_SEAMS 150 |
#define NO_FULL_PRIORITY -1 |
#define pop_next_seam | ( | seams, | |||
seam, | |||||
priority | ) | (HeapPop (seams,&priority,&seam) == TESS_HEAP_OK) \ |
#define seam_queue_element | ( | seam_queue, | |||
index | ) |
((index < SizeOfHeap (seam_queue)) ? \ HeapDataFor (seam_queue, index) : \ NULL) \
#define SPLIT_CLOSENESS 20 |