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