Tesseract 3.02

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- File List
- File Members

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
bestfirst.h
Go to the documentation of this file.
1 /* -*-C-*-
2 ********************************************************************************
3 *
4 * File: bestfirst.h (Formerly bestfirst.h)
5 * Description: Best first search functions
6 * Author: Mark Seaman, OCR Technology
7 * Created: Mon May 14 11:23:29 1990
8 * Modified: Mon Apr 29 14:21:57 1991 (Mark Seaman) marks@hpgrlt
9 * Language: C
10 * Package: N/A
11 * Status: Experimental (Do Not Distribute)
12 *
13 * (c) Copyright 1990, Hewlett-Packard Company.
14 ** Licensed under the Apache License, Version 2.0 (the "License");
15 ** you may not use this file except in compliance with the License.
16 ** You may obtain a copy of the License at
17 ** http://www.apache.org/licenses/LICENSE-2.0
18 ** Unless required by applicable law or agreed to in writing, software
19 ** distributed under the License is distributed on an "AS IS" BASIS,
20 ** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
21 ** See the License for the specific language governing permissions and
22 ** limitations under the License.
23 *
24 *******************************************************************************/
25
26 #ifndef BESTFIRST_H
27 #define BESTFIRST_H
28
29 /*----------------------------------------------------------------------
30 I n c l u d e s
31 ----------------------------------------------------------------------*/
32
33 #include "associate.h"
34 #include "blobs.h"
35 #include "closed.h"
36 #include "oldheap.h"
37 #include "ratngs.h"
38 #include "seam.h"
39 #include "states.h"
40 #include "stopper.h"
41
42 /*----------------------------------------------------------------------
43 T y p e s
44 ----------------------------------------------------------------------*/
45 struct SEARCH_RECORD
46 {
47 HEAP *open_states;
48 HASH_TABLE closed_states;
49 STATE *this_state;
50 STATE *first_state;
51 STATE *best_state;
52 int num_joints;
53 long num_states;
54 long before_best;
55 float segcost_bias;
56 WERD_CHOICE *best_choice;
57 WERD_CHOICE *raw_choice;
58 BLOB_CHOICE_LIST_VECTOR *best_char_choices;
59 };
60
61
62 /*----------------------------------------------------------------------
63 F u n c t i o n s
64 ----------------------------------------------------------------------*/
65 int chunks_width(WIDTH_RECORD *width_record, int start_chunk, int last_chunk);
66 int chunks_gap(WIDTH_RECORD *width_record, int last_chunk);
67 STATE *pop_queue(HEAP *queue);
68 void replace_char_widths(CHUNKS_RECORD *chunks_record, SEARCH_STATE state);
69
70 #endif