#include "findseam.h"
#include "gradechop.h"
#include "olutil.h"
#include "plotedges.h"
#include "outlines.h"
#include "freelist.h"
#include "seam.h"
#include "wordrec.h"
Go to the source code of this file.
| #define add_seam_to_queue |
( |
|
seams, |
|
|
|
seam, |
|
|
|
priority |
|
) |
| |
Value:if (seam)\
{\
junk_worst_seam(seams,seam,priority);
\
HeapPush (seams, priority, (
char*) seam);\
}
void HeapPush(HEAP *Heap, FLOAT32 Key, void *Data)
Definition at line 64 of file findseam.cpp.
| #define BAD_PRIORITY 9999.0 |
| #define best_seam_priority |
( |
|
seam_queue | ) |
|
Value:
#define seam_queue_element(seam_queue, index)
Definition at line 79 of file findseam.cpp.
| #define delete_seam_queue |
( |
|
seam_queue | ) |
|
Value:
void FreeHeapData(HEAP *Heap, void_dest destructor)
void delete_seam(void *arg)
Definition at line 109 of file findseam.cpp.
| #define MAX_NUM_SEAMS 150 |
| #define MAX_OLD_SEAMS 150 |
| #define NO_FULL_PRIORITY -1/* Special marker for pri. */ |
| #define pop_next_seam |
( |
|
seams, |
|
|
|
seam, |
|
|
|
priority |
|
) |
| (HeapPop (seams,&priority,&seam) == TESS_HEAP_OK) \ |
| #define seam_queue_element |
( |
|
seam_queue, |
|
|
|
index |
|
) |
| |
Value:
#define HeapDataFor(H, E)
Definition at line 132 of file findseam.cpp.
| #define SPLIT_CLOSENESS 20/* Difference in x value */ |