#include <assert.h>
#include "bestfirst.h"
#include "associate.h"
#include "blobs.h"
#include <math.h>
#include "states.h"
#include "oldheap.h"
#include "ratngs.h"
#include "seam.h"
#include "stopper.h"
#include "tessclas.h"
#include "baseline.h"
#include "bitvec.h"
#include "callback.h"
#include "dict.h"
#include "freelist.h"
#include "globals.h"
#include "bestfirst.h"
#include "permute.h"
#include "matrix.h"
#include "host.h"
#include "callcpp.h"
#include "structures.h"
#include "tordvars.h"
#include "unicharset.h"
#include "classify.h"
#include <stdio.h>
Namespaces | |
namespace | tesseract |
Functions | |
void | call_caller () |
chunks_width | |
int | chunks_width (WIDTH_RECORD *width_record, int start_blob, int last_blob) |
chunks_gap | |
int | chunks_gap (WIDTH_RECORD *width_record, int last_chunk) |
void | delete_search (SEARCH_RECORD *the_search) |
new_search | |
SEARCH_RECORD * | new_search (CHUNKS_RECORD *chunks_record, int num_joints, WERD_CHOICE *best_choice, WERD_CHOICE *raw_choice, STATE *state) |
pop_queue | |
STATE * | pop_queue (HEAP *queue) |
push_queue | |
void | push_queue (HEAP *queue, STATE *state, FLOAT32 worst_priority, FLOAT32 priority) |
replace_char_widths | |
void | replace_char_widths (CHUNKS_RECORD *chunks_record, SEARCH_STATE state) |
Variables | |
int | num_joints |
int | num_pushed = 0 |
int | num_popped = 0 |
int | wordrec_num_seg_states = 30 |
double | wordrec_worst_state = 1 |
void call_caller | ( | ) |
int chunks_gap | ( | WIDTH_RECORD * | width_record, | |
int | last_chunk | |||
) |
int chunks_width | ( | WIDTH_RECORD * | width_record, | |
int | start_blob, | |||
int | last_blob | |||
) |
void delete_search | ( | SEARCH_RECORD * | the_search | ) |
delete_search
Terminate the current search and free all the memory involved.
SEARCH_RECORD* new_search | ( | CHUNKS_RECORD * | chunks_record, | |
int | num_joints, | |||
WERD_CHOICE * | best_choice, | |||
WERD_CHOICE * | raw_choice, | |||
STATE * | state | |||
) |
void replace_char_widths | ( | CHUNKS_RECORD * | chunks_record, | |
SEARCH_STATE | state | |||
) |
int num_joints |
int num_popped = 0 |
int num_pushed = 0 |
int wordrec_num_seg_states = 30 |
"Segmentation states"
double wordrec_worst_state = 1 |
"Worst segmentation state"