tesseract  4.00.00dev
tesseract::Dawg Class Referenceabstract

#include <dawg.h>

Inheritance diagram for tesseract::Dawg:
tesseract::SquishedDawg tesseract::Trie

Public Member Functions

DawgType type () const
 
const STRINGlang () const
 
PermuterType permuter () const
 
virtual ~Dawg ()
 
bool word_in_dawg (const WERD_CHOICE &word) const
 Returns true if the given word is in the Dawg. More...
 
bool prefix_in_dawg (const WERD_CHOICE &prefix, bool requires_complete) const
 
int check_for_words (const char *filename, const UNICHARSET &unicharset, bool enable_wildcard) const
 
void iterate_words (const UNICHARSET &unicharset, TessCallback1< const WERD_CHOICE *> *cb) const
 
void iterate_words (const UNICHARSET &unicharset, TessCallback1< const char *> *cb) const
 
virtual EDGE_REF edge_char_of (NODE_REF node, UNICHAR_ID unichar_id, bool word_end) const =0
 Returns the edge that corresponds to the letter out of this node. More...
 
virtual void unichar_ids_of (NODE_REF node, NodeChildVector *vec, bool word_end) const =0
 
virtual NODE_REF next_node (EDGE_REF edge_ref) const =0
 
virtual bool end_of_word (EDGE_REF edge_ref) const =0
 
virtual UNICHAR_ID edge_letter (EDGE_REF edge_ref) const =0
 Returns UNICHAR_ID stored in the edge indicated by the given EDGE_REF. More...
 
virtual void print_node (NODE_REF node, int max_num_edges) const =0
 
virtual void unichar_id_to_patterns (UNICHAR_ID unichar_id, const UNICHARSET &unicharset, GenericVector< UNICHAR_ID > *vec) const
 
virtual EDGE_REF pattern_loop_edge (EDGE_REF edge_ref, UNICHAR_ID unichar_id, bool word_end) const
 

Static Public Attributes

static const inT16 kDawgMagicNumber = 42
 Magic number to determine endianness when reading the Dawg from file. More...
 
static const UNICHAR_ID kPatternUnicharID = 0
 

Protected Member Functions

 Dawg (DawgType type, const STRING &lang, PermuterType perm, int debug_level)
 
NODE_REF next_node_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns the next node visited by following this edge. More...
 
bool marker_flag_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns the marker flag of this edge. More...
 
int direction_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns the direction flag of this edge. More...
 
bool end_of_word_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns true if this edge marks the end of a word. More...
 
UNICHAR_ID unichar_id_from_edge_rec (const EDGE_RECORD &edge_rec) const
 Returns UNICHAR_ID recorded in this edge. More...
 
void set_next_node_in_edge_rec (EDGE_RECORD *edge_rec, EDGE_REF value)
 Sets the next node link for this edge in the Dawg. More...
 
void set_marker_flag_in_edge_rec (EDGE_RECORD *edge_rec)
 Sets this edge record to be the last one in a sequence of edges. More...
 
int given_greater_than_edge_rec (NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, const EDGE_RECORD &edge_rec) const
 
bool edge_rec_match (NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, NODE_REF other_next_node, bool other_word_end, UNICHAR_ID other_unichar_id) const
 
void init (int unicharset_size)
 
bool match_words (WERD_CHOICE *word, inT32 index, NODE_REF node, UNICHAR_ID wildcard) const
 
void iterate_words_rec (const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const WERD_CHOICE *> *cb) const
 

Protected Attributes

DawgType type_
 
STRING lang_
 
PermuterType perm_
 Permuter code that should be used if the word is found in this Dawg. More...
 
int unicharset_size_
 
int flag_start_bit_
 
int next_node_start_bit_
 
uinT64 next_node_mask_
 
uinT64 flags_mask_
 
uinT64 letter_mask_
 
int debug_level_
 

Detailed Description

Abstract class (an interface) that declares methods needed by the various tesseract classes to operate on SquishedDawg and Trie objects.

This class initializes all the edge masks (since their usage by SquishedDawg and Trie is identical) and implements simple accessors for each of the fields encoded in an EDGE_RECORD. This class also implements word_in_dawg() and check_for_words() (since they use only the public methods of SquishedDawg and Trie classes that are inherited from the Dawg base class).

Definition at line 119 of file dawg.h.

Constructor & Destructor Documentation

◆ ~Dawg()

virtual tesseract::Dawg::~Dawg ( )
inlinevirtual

Definition at line 132 of file dawg.h.

132 {}

◆ Dawg()

tesseract::Dawg::Dawg ( DawgType  type,
const STRING lang,
PermuterType  perm,
int  debug_level 
)
inlineprotected

Definition at line 205 of file dawg.h.

206  : type_(type),
207  lang_(lang),
208  perm_(perm),
209  unicharset_size_(0),
210  debug_level_(debug_level) {}
int unicharset_size_
Definition: dawg.h:309
DawgType type() const
Definition: dawg.h:128
PermuterType perm_
Permuter code that should be used if the word is found in this Dawg.
Definition: dawg.h:304
STRING lang_
Definition: dawg.h:302
int debug_level_
Definition: dawg.h:316
DawgType type_
Definition: dawg.h:301

Member Function Documentation

◆ check_for_words()

int tesseract::Dawg::check_for_words ( const char *  filename,
const UNICHARSET unicharset,
bool  enable_wildcard 
) const

Checks the Dawg for the words that are listed in the requested file. Returns the number of words in the given file missing from the Dawg.

Definition at line 73 of file dawg.cpp.

75  {
76  if (filename == NULL) return 0;
77 
78  FILE *word_file;
79  char string [CHARS_PER_LINE];
80  int misses = 0;
81  UNICHAR_ID wildcard = unicharset.unichar_to_id(kWildcard);
82 
83  word_file = open_file (filename, "r");
84 
85  while (fgets (string, CHARS_PER_LINE, word_file) != NULL) {
86  chomp_string(string); // remove newline
87  WERD_CHOICE word(string, unicharset);
88  if (word.length() > 0 &&
89  !word.contains_unichar_id(INVALID_UNICHAR_ID)) {
90  if (!match_words(&word, 0, 0,
91  enable_wildcard ? wildcard : INVALID_UNICHAR_ID)) {
92  tprintf("Missing word: %s\n", string);
93  ++misses;
94  }
95  } else {
96  tprintf("Failed to create a valid word from %s\n", string);
97  }
98  }
99  fclose (word_file);
100  // Make sure the user sees this with fprintf instead of tprintf.
101  if (debug_level_) tprintf("Number of lost words=%d\n", misses);
102  return misses;
103 }
FILE * open_file(const char *filename, const char *mode)
Definition: cutil.cpp:82
void chomp_string(char *str)
Definition: helpers.h:82
#define tprintf(...)
Definition: tprintf.h:31
UNICHAR_ID unichar_to_id(const char *const unichar_repr) const
Definition: unicharset.cpp:207
int debug_level_
Definition: dawg.h:316
bool match_words(WERD_CHOICE *word, inT32 index, NODE_REF node, UNICHAR_ID wildcard) const
Definition: dawg.cpp:144
#define CHARS_PER_LINE
Definition: cutil.h:57
int UNICHAR_ID
Definition: unichar.h:35

◆ direction_from_edge_rec()

int tesseract::Dawg::direction_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns the direction flag of this edge.

Definition at line 221 of file dawg.h.

221  {
222  return ((edge_rec & (DIRECTION_FLAG << flag_start_bit_))) ?
224  }
#define FORWARD_EDGE
Definition: dawg.h:85
#define DIRECTION_FLAG
Definition: dawg.h:89
#define BACKWARD_EDGE
Definition: dawg.h:86
int flag_start_bit_
Definition: dawg.h:310

◆ edge_char_of()

virtual EDGE_REF tesseract::Dawg::edge_char_of ( NODE_REF  node,
UNICHAR_ID  unichar_id,
bool  word_end 
) const
pure virtual

Returns the edge that corresponds to the letter out of this node.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

◆ edge_letter()

virtual UNICHAR_ID tesseract::Dawg::edge_letter ( EDGE_REF  edge_ref) const
pure virtual

Returns UNICHAR_ID stored in the edge indicated by the given EDGE_REF.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

◆ edge_rec_match()

bool tesseract::Dawg::edge_rec_match ( NODE_REF  next_node,
bool  word_end,
UNICHAR_ID  unichar_id,
NODE_REF  other_next_node,
bool  other_word_end,
UNICHAR_ID  other_unichar_id 
) const
inlineprotected

Returns true if all the values are equal (any value matches next_node if next_node == NO_EDGE, any value matches word_end if word_end is false).

Definition at line 272 of file dawg.h.

277  {
278  return ((unichar_id == other_unichar_id) &&
279  (next_node == NO_EDGE || next_node == other_next_node) &&
280  (!word_end || (word_end == other_word_end)));
281  }
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0

◆ end_of_word()

virtual bool tesseract::Dawg::end_of_word ( EDGE_REF  edge_ref) const
pure virtual

Returns true if the edge indicated by the given EDGE_REF marks the end of a word.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

◆ end_of_word_from_edge_rec()

bool tesseract::Dawg::end_of_word_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns true if this edge marks the end of a word.

Definition at line 226 of file dawg.h.

226  {
227  return (edge_rec & (WERD_END_FLAG << flag_start_bit_)) != 0;
228  }
#define WERD_END_FLAG
Definition: dawg.h:90
int flag_start_bit_
Definition: dawg.h:310

◆ given_greater_than_edge_rec()

int tesseract::Dawg::given_greater_than_edge_rec ( NODE_REF  next_node,
bool  word_end,
UNICHAR_ID  unichar_id,
const EDGE_RECORD edge_rec 
) const
inlineprotected

Sequentially compares the given values of unichar ID, next node and word end marker with the values in the given EDGE_RECORD. Returns: 1 if at any step the given input value exceeds that of edge_rec (and all the values already checked are the same) 0 if edge_rec_match() returns true -1 otherwise

Definition at line 251 of file dawg.h.

254  {
255  UNICHAR_ID curr_unichar_id = unichar_id_from_edge_rec(edge_rec);
256  NODE_REF curr_next_node = next_node_from_edge_rec(edge_rec);
257  bool curr_word_end = end_of_word_from_edge_rec(edge_rec);
258  if (edge_rec_match(next_node, word_end, unichar_id, curr_next_node,
259  curr_word_end, curr_unichar_id)) return 0;
260  if (unichar_id > curr_unichar_id) return 1;
261  if (unichar_id == curr_unichar_id) {
262  if (next_node > curr_next_node) return 1;
263  if (next_node == curr_next_node) {
264  if (word_end > curr_word_end) return 1;
265  }
266  }
267  return -1;
268  }
NODE_REF next_node_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns the next node visited by following this edge.
Definition: dawg.h:213
bool end_of_word_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns true if this edge marks the end of a word.
Definition: dawg.h:226
bool edge_rec_match(NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, NODE_REF other_next_node, bool other_word_end, UNICHAR_ID other_unichar_id) const
Definition: dawg.h:272
inT64 NODE_REF
Definition: dawg.h:56
UNICHAR_ID unichar_id_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns UNICHAR_ID recorded in this edge.
Definition: dawg.h:230
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
int UNICHAR_ID
Definition: unichar.h:35

◆ init()

void tesseract::Dawg::init ( int  unicharset_size)
protected

Sets unicharset_size_. Initializes the values of various masks from unicharset_size_.

Definition at line 176 of file dawg.cpp.

176  {
177  ASSERT_HOST(unicharset_size > 0);
178  unicharset_size_ = unicharset_size;
179  // Set bit masks. We will use the value unicharset_size_ as a null char, so
180  // the actual number of unichars is unicharset_size_ + 1.
181  flag_start_bit_ = ceil(log(unicharset_size_ + 1.0) / log(2.0));
183  letter_mask_ = ~(~0ull << flag_start_bit_);
186 }
int unicharset_size_
Definition: dawg.h:309
uinT64 flags_mask_
Definition: dawg.h:313
int next_node_start_bit_
Definition: dawg.h:311
uinT64 letter_mask_
Definition: dawg.h:314
#define NUM_FLAG_BITS
Definition: dawg.h:92
uinT64 next_node_mask_
Definition: dawg.h:312
#define ASSERT_HOST(x)
Definition: errcode.h:84
int flag_start_bit_
Definition: dawg.h:310

◆ iterate_words() [1/2]

void tesseract::Dawg::iterate_words ( const UNICHARSET unicharset,
TessCallback1< const WERD_CHOICE *> *  cb 
) const

Definition at line 105 of file dawg.cpp.

106  {
107  WERD_CHOICE word(&unicharset);
108  iterate_words_rec(word, 0, cb);
109 }
void iterate_words_rec(const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const WERD_CHOICE *> *cb) const
Definition: dawg.cpp:126

◆ iterate_words() [2/2]

void tesseract::Dawg::iterate_words ( const UNICHARSET unicharset,
TessCallback1< const char *> *  cb 
) const

Definition at line 117 of file dawg.cpp.

118  {
121  WERD_CHOICE word(&unicharset);
122  iterate_words_rec(word, 0, shim);
123  delete shim;
124 }
void iterate_words_rec(const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const WERD_CHOICE *> *cb) const
Definition: dawg.cpp:126
void CallWithUTF8(TessCallback1< const char *> *cb, const WERD_CHOICE *wc)
Definition: dawg.cpp:111
_ConstTessMemberResultCallback_0_0< false, R, T1 >::base * NewPermanentTessCallback(const T1 *obj, R(T2::*member)() const)
Definition: tesscallback.h:116

◆ iterate_words_rec()

void tesseract::Dawg::iterate_words_rec ( const WERD_CHOICE word_so_far,
NODE_REF  to_explore,
TessCallback1< const WERD_CHOICE *> *  cb 
) const
protected

Definition at line 126 of file dawg.cpp.

128  {
129  NodeChildVector children;
130  this->unichar_ids_of(to_explore, &children, false);
131  for (int i = 0; i < children.size(); i++) {
132  WERD_CHOICE next_word(word_so_far);
133  next_word.append_unichar_id(children[i].unichar_id, 1, 0.0, 0.0);
134  if (this->end_of_word(children[i].edge_ref)) {
135  cb->Run(&next_word);
136  }
137  NODE_REF next = next_node(children[i].edge_ref);
138  if (next != 0) {
139  iterate_words_rec(next_word, next, cb);
140  }
141  }
142 }
void iterate_words_rec(const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const WERD_CHOICE *> *cb) const
Definition: dawg.cpp:126
virtual bool end_of_word(EDGE_REF edge_ref) const =0
inT64 NODE_REF
Definition: dawg.h:56
virtual void Run(A1)=0
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
virtual void unichar_ids_of(NODE_REF node, NodeChildVector *vec, bool word_end) const =0
GenericVector< NodeChild > NodeChildVector
Definition: dawg.h:68

◆ lang()

const STRING& tesseract::Dawg::lang ( ) const
inline

Definition at line 129 of file dawg.h.

129 { return lang_; }
STRING lang_
Definition: dawg.h:302

◆ marker_flag_from_edge_rec()

bool tesseract::Dawg::marker_flag_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns the marker flag of this edge.

Definition at line 217 of file dawg.h.

217  {
218  return (edge_rec & (MARKER_FLAG << flag_start_bit_)) != 0;
219  }
#define MARKER_FLAG
Definition: dawg.h:88
int flag_start_bit_
Definition: dawg.h:310

◆ match_words()

bool tesseract::Dawg::match_words ( WERD_CHOICE word,
inT32  index,
NODE_REF  node,
UNICHAR_ID  wildcard 
) const
protected

Matches all of the words that are represented by this string. If wilcard is set to something other than INVALID_UNICHAR_ID, the *'s in this string are interpreted as wildcards. WERD_CHOICE param is not passed by const so that wildcard searches can modify it and work without having to copy WERD_CHOICEs.

Definition at line 144 of file dawg.cpp.

145  {
146  EDGE_REF edge;
147  inT32 word_end;
148 
149  if (wildcard != INVALID_UNICHAR_ID && word->unichar_id(index) == wildcard) {
150  bool any_matched = false;
151  NodeChildVector vec;
152  this->unichar_ids_of(node, &vec, false);
153  for (int i = 0; i < vec.size(); ++i) {
154  word->set_unichar_id(vec[i].unichar_id, index);
155  if (match_words(word, index, node, wildcard))
156  any_matched = true;
157  }
158  word->set_unichar_id(wildcard, index);
159  return any_matched;
160  } else {
161  word_end = index == word->length() - 1;
162  edge = edge_char_of(node, word->unichar_id(index), word_end);
163  if (edge != NO_EDGE) { // normal edge in DAWG
164  node = next_node(edge);
165  if (word_end) {
166  if (debug_level_ > 1) word->print("match_words() found: ");
167  return true;
168  } else if (node != 0) {
169  return match_words(word, index+1, node, wildcard);
170  }
171  }
172  }
173  return false;
174 }
void set_unichar_id(UNICHAR_ID unichar_id, int index)
Definition: ratngs.h:355
inT64 EDGE_REF
Definition: dawg.h:55
UNICHAR_ID unichar_id(int index) const
Definition: ratngs.h:311
void print() const
Definition: ratngs.h:576
int32_t inT32
Definition: host.h:38
virtual EDGE_REF edge_char_of(NODE_REF node, UNICHAR_ID unichar_id, bool word_end) const =0
Returns the edge that corresponds to the letter out of this node.
int debug_level_
Definition: dawg.h:316
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0
int length() const
Definition: ratngs.h:299
virtual void unichar_ids_of(NODE_REF node, NodeChildVector *vec, bool word_end) const =0
bool match_words(WERD_CHOICE *word, inT32 index, NODE_REF node, UNICHAR_ID wildcard) const
Definition: dawg.cpp:144
GenericVector< NodeChild > NodeChildVector
Definition: dawg.h:68

◆ next_node()

virtual NODE_REF tesseract::Dawg::next_node ( EDGE_REF  edge_ref) const
pure virtual

Returns the next node visited by following the edge indicated by the given EDGE_REF.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

◆ next_node_from_edge_rec()

NODE_REF tesseract::Dawg::next_node_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns the next node visited by following this edge.

Definition at line 213 of file dawg.h.

213  {
214  return ((edge_rec & next_node_mask_) >> next_node_start_bit_);
215  }
int next_node_start_bit_
Definition: dawg.h:311
uinT64 next_node_mask_
Definition: dawg.h:312

◆ pattern_loop_edge()

virtual EDGE_REF tesseract::Dawg::pattern_loop_edge ( EDGE_REF  edge_ref,
UNICHAR_ID  unichar_id,
bool  word_end 
) const
inlinevirtual

Returns the given EDGE_REF if the EDGE_RECORD that it points to has a self loop and the given unichar_id matches the unichar_id stored in the EDGE_RECORD, returns NO_EDGE otherwise.

Reimplemented in tesseract::Trie.

Definition at line 196 of file dawg.h.

197  {
198  (void)edge_ref;
199  (void)unichar_id;
200  (void)word_end;
201  return false;
202  }

◆ permuter()

PermuterType tesseract::Dawg::permuter ( ) const
inline

Definition at line 130 of file dawg.h.

130 { return perm_; }
PermuterType perm_
Permuter code that should be used if the word is found in this Dawg.
Definition: dawg.h:304

◆ prefix_in_dawg()

bool tesseract::Dawg::prefix_in_dawg ( const WERD_CHOICE prefix,
bool  requires_complete 
) const

Definition at line 48 of file dawg.cpp.

49  {
50  if (word.length() == 0) return !requires_complete;
51  NODE_REF node = 0;
52  int end_index = word.length() - 1;
53  for (int i = 0; i < end_index; i++) {
54  EDGE_REF edge = edge_char_of(node, word.unichar_id(i), false);
55  if (edge == NO_EDGE) {
56  return false;
57  }
58  if ((node = next_node(edge)) == 0) {
59  // This only happens if all words following this edge terminate --
60  // there are no larger words. See Trie::add_word_to_dawg()
61  return false;
62  }
63  }
64  // Now check the last character.
65  return edge_char_of(node, word.unichar_id(end_index), requires_complete) !=
66  NO_EDGE;
67 }
inT64 NODE_REF
Definition: dawg.h:56
inT64 EDGE_REF
Definition: dawg.h:55
virtual EDGE_REF edge_char_of(NODE_REF node, UNICHAR_ID unichar_id, bool word_end) const =0
Returns the edge that corresponds to the letter out of this node.
virtual NODE_REF next_node(EDGE_REF edge_ref) const =0

◆ print_node()

virtual void tesseract::Dawg::print_node ( NODE_REF  node,
int  max_num_edges 
) const
pure virtual

Prints the contents of the node indicated by the given NODE_REF. At most max_num_edges will be printed.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

◆ set_marker_flag_in_edge_rec()

void tesseract::Dawg::set_marker_flag_in_edge_rec ( EDGE_RECORD edge_rec)
inlineprotected

Sets this edge record to be the last one in a sequence of edges.

Definition at line 241 of file dawg.h.

241  {
242  *edge_rec |= (MARKER_FLAG << flag_start_bit_);
243  }
#define MARKER_FLAG
Definition: dawg.h:88
int flag_start_bit_
Definition: dawg.h:310

◆ set_next_node_in_edge_rec()

void tesseract::Dawg::set_next_node_in_edge_rec ( EDGE_RECORD edge_rec,
EDGE_REF  value 
)
inlineprotected

Sets the next node link for this edge in the Dawg.

Definition at line 235 of file dawg.h.

236  {
237  *edge_rec &= (~next_node_mask_);
238  *edge_rec |= ((value << next_node_start_bit_) & next_node_mask_);
239  }
int next_node_start_bit_
Definition: dawg.h:311
uinT64 next_node_mask_
Definition: dawg.h:312

◆ type()

DawgType tesseract::Dawg::type ( ) const
inline

Definition at line 128 of file dawg.h.

128 { return type_; }
DawgType type_
Definition: dawg.h:301

◆ unichar_id_from_edge_rec()

UNICHAR_ID tesseract::Dawg::unichar_id_from_edge_rec ( const EDGE_RECORD edge_rec) const
inlineprotected

Returns UNICHAR_ID recorded in this edge.

Definition at line 230 of file dawg.h.

231  {
232  return ((edge_rec & letter_mask_) >> LETTER_START_BIT);
233  }
uinT64 letter_mask_
Definition: dawg.h:314
#define LETTER_START_BIT
Definition: dawg.h:91

◆ unichar_id_to_patterns()

virtual void tesseract::Dawg::unichar_id_to_patterns ( UNICHAR_ID  unichar_id,
const UNICHARSET unicharset,
GenericVector< UNICHAR_ID > *  vec 
) const
inlinevirtual

Fills vec with unichar ids that represent the character classes of the given unichar_id.

Reimplemented in tesseract::Trie.

Definition at line 185 of file dawg.h.

187  {
188  (void)unichar_id;
189  (void)unicharset;
190  (void)vec;
191  }

◆ unichar_ids_of()

virtual void tesseract::Dawg::unichar_ids_of ( NODE_REF  node,
NodeChildVector vec,
bool  word_end 
) const
pure virtual

Fills the given NodeChildVector with all the unichar ids (and the corresponding EDGE_REFs) for which there is an edge out of this node.

Implemented in tesseract::SquishedDawg, and tesseract::Trie.

◆ word_in_dawg()

bool tesseract::Dawg::word_in_dawg ( const WERD_CHOICE word) const

Returns true if the given word is in the Dawg.

Definition at line 69 of file dawg.cpp.

69  {
70  return prefix_in_dawg(word, true);
71 }
bool prefix_in_dawg(const WERD_CHOICE &prefix, bool requires_complete) const
Definition: dawg.cpp:48

Member Data Documentation

◆ debug_level_

int tesseract::Dawg::debug_level_
protected

Definition at line 316 of file dawg.h.

◆ flag_start_bit_

int tesseract::Dawg::flag_start_bit_
protected

Definition at line 310 of file dawg.h.

◆ flags_mask_

uinT64 tesseract::Dawg::flags_mask_
protected

Definition at line 313 of file dawg.h.

◆ kDawgMagicNumber

const inT16 tesseract::Dawg::kDawgMagicNumber = 42
static

Magic number to determine endianness when reading the Dawg from file.

Definition at line 122 of file dawg.h.

◆ kPatternUnicharID

const UNICHAR_ID tesseract::Dawg::kPatternUnicharID = 0
static

A special unichar id that indicates that any appropriate pattern (e.g.dicitonary word, 0-9 digit, etc) can be inserted instead Used for expressing patterns in punctuation and number Dawgs.

Definition at line 126 of file dawg.h.

◆ lang_

STRING tesseract::Dawg::lang_
protected

Definition at line 302 of file dawg.h.

◆ letter_mask_

uinT64 tesseract::Dawg::letter_mask_
protected

Definition at line 314 of file dawg.h.

◆ next_node_mask_

uinT64 tesseract::Dawg::next_node_mask_
protected

Definition at line 312 of file dawg.h.

◆ next_node_start_bit_

int tesseract::Dawg::next_node_start_bit_
protected

Definition at line 311 of file dawg.h.

◆ perm_

PermuterType tesseract::Dawg::perm_
protected

Permuter code that should be used if the word is found in this Dawg.

Definition at line 304 of file dawg.h.

◆ type_

DawgType tesseract::Dawg::type_
protected

Definition at line 301 of file dawg.h.

◆ unicharset_size_

int tesseract::Dawg::unicharset_size_
protected

Definition at line 309 of file dawg.h.


The documentation for this class was generated from the following files: