STATE Struct Reference

#include <states.h>

List of all members.

---

Detailed Description

Holds info on one segmenter search.

Priority states are held in a sorted heap and are related to joints/chunks in a way I don't completely understand, see print_state() for example. This needs FIX:!

Current hypothesis: if one 'count' of word choices found for a word represents a state, and these states are kept in a heap sorted by priority, tesseract can easily iterate and check which 'state' (choice) is best after various 'tests'. Or something like that. See best_first_search()

Definition at line 47 of file states.h.

Public Attributes

• UINT32 part1
• UINT32 part2

---

Member Data Documentation

UINT32 STATE::part1

Definition at line 49 of file states.h.

Referenced by best_first_search(), bin_to_pieces(), compare_states(), evaluate_state(), expand_node(), hash_add(), hash_lookup(), new_state(), ones_in_state(), print_state(), save_best_state(), and set_n_ones().

UINT32 STATE::part2

Definition at line 50 of file states.h.

Referenced by best_first_search(), bin_to_pieces(), compare_states(), evaluate_state(), expand_node(), hash_add(), hash_lookup(), new_hash_table(), new_state(), ones_in_state(), print_state(), save_best_state(), and set_n_ones().

---

The documentation for this struct was generated from the following file:

• dict/states.h

---