tesseract  3.05.02
tesseract::SquishedDawg Class Reference

#include <dawg.h>

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

Public Member Functions

 SquishedDawg (FILE *file, DawgType type, const STRING &lang, PermuterType perm, int debug_level)
 
 SquishedDawg (const char *filename, DawgType type, const STRING &lang, PermuterType perm, int debug_level)
 
 SquishedDawg (EDGE_ARRAY edges, int num_edges, DawgType type, const STRING &lang, PermuterType perm, int unicharset_size, int debug_level)
 
 ~SquishedDawg ()
 
int NumEdges ()
 
EDGE_REF edge_char_of (NODE_REF node, UNICHAR_ID unichar_id, bool word_end) const
 Returns the edge that corresponds to the letter out of this node. More...
 
void unichar_ids_of (NODE_REF node, NodeChildVector *vec, bool word_end) const
 
NODE_REF next_node (EDGE_REF edge) const
 
bool end_of_word (EDGE_REF edge_ref) const
 
UNICHAR_ID edge_letter (EDGE_REF edge_ref) const
 Returns UNICHAR_ID stored in the edge indicated by the given EDGE_REF. More...
 
void print_node (NODE_REF node, int max_num_edges) const
 
void write_squished_dawg (FILE *file)
 Writes the squished/reduced Dawg to a file. More...
 
void write_squished_dawg (const char *filename)
 
- Public Member Functions inherited from tesseract::Dawg
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 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
 

Additional Inherited Members

- Static Public Attributes inherited from tesseract::Dawg
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 inherited from tesseract::Dawg
 Dawg ()
 
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 (DawgType type, const STRING &lang, PermuterType perm, int unicharset_size, int debug_level)
 
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 inherited from tesseract::Dawg
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

Concrete class that can operate on a compacted (squished) Dawg (read, search and write to file). This class is read-only in the sense that new words can not be added to an instance of SquishedDawg. The underlying representation of the nodes and edges in SquishedDawg is stored as a contiguous EDGE_ARRAY (read from file or given as an argument to the constructor).

Definition at line 408 of file dawg.h.

Constructor & Destructor Documentation

◆ SquishedDawg() [1/3]

tesseract::SquishedDawg::SquishedDawg ( FILE *  file,
DawgType  type,
const STRING lang,
PermuterType  perm,
int  debug_level 
)
inline

Definition at line 410 of file dawg.h.

411  {
412  read_squished_dawg(file, type, lang, perm, debug_level);
413  num_forward_edges_in_node0 = num_forward_edges(0);
414  }
DawgType type() const
Definition: dawg.h:127
const STRING & lang() const
Definition: dawg.h:128

◆ SquishedDawg() [2/3]

tesseract::SquishedDawg::SquishedDawg ( const char *  filename,
DawgType  type,
const STRING lang,
PermuterType  perm,
int  debug_level 
)
inline

Definition at line 415 of file dawg.h.

416  {
417  FILE *file = fopen(filename, "rb");
418  if (file == NULL) {
419  tprintf("Failed to open dawg file %s\n", filename);
420  exit(1);
421  }
422  read_squished_dawg(file, type, lang, perm, debug_level);
423  num_forward_edges_in_node0 = num_forward_edges(0);
424  fclose(file);
425  }
DawgType type() const
Definition: dawg.h:127
#define tprintf(...)
Definition: tprintf.h:31
const STRING & lang() const
Definition: dawg.h:128

◆ SquishedDawg() [3/3]

tesseract::SquishedDawg::SquishedDawg ( EDGE_ARRAY  edges,
int  num_edges,
DawgType  type,
const STRING lang,
PermuterType  perm,
int  unicharset_size,
int  debug_level 
)
inline

Definition at line 426 of file dawg.h.

428  :
429  edges_(edges), num_edges_(num_edges) {
430  init(type, lang, perm, unicharset_size, debug_level);
431  num_forward_edges_in_node0 = num_forward_edges(0);
432  if (debug_level > 3) print_all("SquishedDawg:");
433  }
DawgType type() const
Definition: dawg.h:127
void init(DawgType type, const STRING &lang, PermuterType perm, int unicharset_size, int debug_level)
Definition: dawg.cpp:176
const STRING & lang() const
Definition: dawg.h:128

◆ ~SquishedDawg()

tesseract::SquishedDawg::~SquishedDawg ( )

Definition at line 199 of file dawg.cpp.

199 { delete[] edges_; }

Member Function Documentation

◆ edge_char_of()

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

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

Implements tesseract::Dawg.

Definition at line 201 of file dawg.cpp.

203  {
204  EDGE_REF edge = node;
205  if (node == 0) { // binary search
206  EDGE_REF start = 0;
207  EDGE_REF end = num_forward_edges_in_node0 - 1;
208  int compare;
209  while (start <= end) {
210  edge = (start + end) >> 1; // (start + end) / 2
211  compare = given_greater_than_edge_rec(NO_EDGE, word_end,
212  unichar_id, edges_[edge]);
213  if (compare == 0) { // given == vec[k]
214  return edge;
215  } else if (compare == 1) { // given > vec[k]
216  start = edge + 1;
217  } else { // given < vec[k]
218  end = edge - 1;
219  }
220  }
221  } else { // linear search
222  if (edge != NO_EDGE && edge_occupied(edge)) {
223  do {
224  if ((unichar_id_from_edge_rec(edges_[edge]) == unichar_id) &&
225  (!word_end || end_of_word_from_edge_rec(edges_[edge])))
226  return (edge);
227  } while (!last_edge(edge++));
228  }
229  }
230  return (NO_EDGE); // not found
231 }
inT64 EDGE_REF
Definition: dawg.h:54
int given_greater_than_edge_rec(NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, const EDGE_RECORD &edge_rec) const
Definition: dawg.h:245
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:220
UNICHAR_ID unichar_id_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns UNICHAR_ID recorded in this edge.
Definition: dawg.h:224

◆ edge_letter()

UNICHAR_ID tesseract::SquishedDawg::edge_letter ( EDGE_REF  edge_ref) const
inlinevirtual

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

Implements tesseract::Dawg.

Definition at line 469 of file dawg.h.

469  {
470  return unichar_id_from_edge_rec((edges_[edge_ref]));
471  }
UNICHAR_ID unichar_id_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns UNICHAR_ID recorded in this edge.
Definition: dawg.h:224

◆ end_of_word()

bool tesseract::SquishedDawg::end_of_word ( EDGE_REF  edge_ref) const
inlinevirtual

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

Implements tesseract::Dawg.

Definition at line 464 of file dawg.h.

464  {
465  return end_of_word_from_edge_rec((edges_[edge_ref]));
466  }
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:220

◆ next_node()

NODE_REF tesseract::SquishedDawg::next_node ( EDGE_REF  edge) const
inlinevirtual

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

Implements tesseract::Dawg.

Definition at line 458 of file dawg.h.

458  {
459  return next_node_from_edge_rec((edges_[edge]));
460  }
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:207

◆ NumEdges()

int tesseract::SquishedDawg::NumEdges ( )
inline

Definition at line 436 of file dawg.h.

436 { return num_edges_; }

◆ print_node()

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

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

Implements tesseract::Dawg.

Definition at line 246 of file dawg.cpp.

246  {
247  if (node == NO_EDGE) return; // nothing to print
248 
249  EDGE_REF edge = node;
250  const char *forward_string = "FORWARD";
251  const char *backward_string = " ";
252 
253  const char *last_string = "LAST";
254  const char *not_last_string = " ";
255 
256  const char *eow_string = "EOW";
257  const char *not_eow_string = " ";
258 
259  const char *direction;
260  const char *is_last;
261  const char *eow;
262 
263  UNICHAR_ID unichar_id;
264 
265  if (edge_occupied(edge)) {
266  do {
267  direction =
268  forward_edge(edge) ? forward_string : backward_string;
269  is_last = last_edge(edge) ? last_string : not_last_string;
270  eow = end_of_word(edge) ? eow_string : not_eow_string;
271 
272  unichar_id = edge_letter(edge);
273  tprintf(REFFORMAT " : next = " REFFORMAT ", unichar_id = %d, %s %s %s\n",
274  edge, next_node(edge), unichar_id,
275  direction, is_last, eow);
276 
277  if (edge - node > max_num_edges) return;
278  } while (!last_edge(edge++));
279 
280  if (edge < num_edges_ &&
281  edge_occupied(edge) && backward_edge(edge)) {
282  do {
283  direction =
284  forward_edge(edge) ? forward_string : backward_string;
285  is_last = last_edge(edge) ? last_string : not_last_string;
286  eow = end_of_word(edge) ? eow_string : not_eow_string;
287 
288  unichar_id = edge_letter(edge);
289  tprintf(REFFORMAT " : next = " REFFORMAT
290  ", unichar_id = %d, %s %s %s\n",
291  edge, next_node(edge), unichar_id,
292  direction, is_last, eow);
293 
294  if (edge - node > MAX_NODE_EDGES_DISPLAY) return;
295  } while (!last_edge(edge++));
296  }
297  }
298  else {
299  tprintf(REFFORMAT " : no edges in this node\n", node);
300  }
301  tprintf("\n");
302 }
#define MAX_NODE_EDGES_DISPLAY
Definition: dawg.h:86
inT64 EDGE_REF
Definition: dawg.h:54
NODE_REF next_node(EDGE_REF edge) const
Definition: dawg.h:458
UNICHAR_ID edge_letter(EDGE_REF edge_ref) const
Returns UNICHAR_ID stored in the edge indicated by the given EDGE_REF.
Definition: dawg.h:469
int direction(EDGEPT *point)
Definition: vecfuncs.cpp:43
#define tprintf(...)
Definition: tprintf.h:31
#define REFFORMAT
Definition: dawg.h:92
bool end_of_word(EDGE_REF edge_ref) const
Definition: dawg.h:464
int UNICHAR_ID
Definition: unichar.h:33

◆ unichar_ids_of()

void tesseract::SquishedDawg::unichar_ids_of ( NODE_REF  node,
NodeChildVector vec,
bool  word_end 
) const
inlinevirtual

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

Implements tesseract::Dawg.

Definition at line 444 of file dawg.h.

445  {
446  EDGE_REF edge = node;
447  if (!edge_occupied(edge) || edge == NO_EDGE) return;
448  assert(forward_edge(edge)); // we don't expect any backward edges to
449  do { // be present when this function is called
450  if (!word_end || end_of_word_from_edge_rec(edges_[edge])) {
451  vec->push_back(NodeChild(unichar_id_from_edge_rec(edges_[edge]), edge));
452  }
453  } while (!last_edge(edge++));
454  }
inT64 EDGE_REF
Definition: dawg.h:54
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:220
UNICHAR_ID unichar_id_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns UNICHAR_ID recorded in this edge.
Definition: dawg.h:224

◆ write_squished_dawg() [1/2]

void tesseract::SquishedDawg::write_squished_dawg ( FILE *  file)

Writes the squished/reduced Dawg to a file.

Definition at line 387 of file dawg.cpp.

387  {
388  EDGE_REF edge;
389  inT32 num_edges;
390  inT32 node_count = 0;
391  NODE_MAP node_map;
392  EDGE_REF old_index;
393  EDGE_RECORD temp_record;
394 
395  if (debug_level_) tprintf("write_squished_dawg\n");
396 
397  node_map = build_node_map(&node_count);
398 
399  // Write the magic number to help detecting a change in endianness.
400  inT16 magic = kDawgMagicNumber;
401  fwrite(&magic, sizeof(inT16), 1, file);
402  fwrite(&unicharset_size_, sizeof(inT32), 1, file);
403 
404  // Count the number of edges in this Dawg.
405  num_edges = 0;
406  for (edge=0; edge < num_edges_; edge++)
407  if (forward_edge(edge))
408  num_edges++;
409 
410  fwrite(&num_edges, sizeof(inT32), 1, file); // write edge count to file
411 
412  if (debug_level_) {
413  tprintf("%d nodes in DAWG\n", node_count);
414  tprintf("%d edges in DAWG\n", num_edges);
415  }
416 
417  for (edge = 0; edge < num_edges_; edge++) {
418  if (forward_edge(edge)) { // write forward edges
419  do {
420  old_index = next_node_from_edge_rec(edges_[edge]);
421  set_next_node(edge, node_map[old_index]);
422  temp_record = edges_[edge];
423  fwrite(&(temp_record), sizeof(EDGE_RECORD), 1, file);
424  set_next_node(edge, old_index);
425  } while (!last_edge(edge++));
426 
427  if (edge >= num_edges_) break;
428  if (backward_edge(edge)) // skip back links
429  while (!last_edge(edge++));
430 
431  edge--;
432  }
433  }
434  free(node_map);
435 }
inT64 EDGE_REF
Definition: dawg.h:54
short inT16
Definition: host.h:33
static const inT16 kDawgMagicNumber
Magic number to determine endianness when reading the Dawg from file.
Definition: dawg.h:121
EDGE_REF * NODE_MAP
Definition: dawg.h:56
int unicharset_size_
Definition: dawg.h:304
int debug_level_
Definition: dawg.h:311
int inT32
Definition: host.h:35
#define tprintf(...)
Definition: tprintf.h:31
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:207
uinT64 EDGE_RECORD
Definition: dawg.h:50

◆ write_squished_dawg() [2/2]

void tesseract::SquishedDawg::write_squished_dawg ( const char *  filename)
inline

Opens the file with the given filename and writes the squished/reduced Dawg to the file.

Definition at line 482 of file dawg.h.

482  {
483  FILE *file = fopen(filename, "wb");
484  if (file == NULL) {
485  tprintf("Error opening %s\n", filename);
486  exit(1);
487  }
488  this->write_squished_dawg(file);
489  fclose(file);
490  }
void write_squished_dawg(FILE *file)
Writes the squished/reduced Dawg to a file.
Definition: dawg.cpp:387
#define tprintf(...)
Definition: tprintf.h:31

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