|
tesseract
4.00.00dev
|
This is the complete list of members for tesseract::Trie, including all inherited members.
| add_edge_linkage(NODE_REF node1, NODE_REF node2, bool repeats, int direction, bool word_end, UNICHAR_ID unichar_id) | tesseract::Trie | protected |
| add_new_edge(NODE_REF node1, NODE_REF node2, bool repeats, bool word_end, UNICHAR_ID unichar_id) | tesseract::Trie | inlineprotected |
| add_word_ending(EDGE_RECORD *edge, NODE_REF the_next_node, bool repeats, UNICHAR_ID unichar_id) | tesseract::Trie | protected |
| add_word_list(const GenericVector< STRING > &words, const UNICHARSET &unicharset) | tesseract::Trie | |
| add_word_to_dawg(const WERD_CHOICE &word, const GenericVector< bool > *repetitions) | tesseract::Trie | |
| add_word_to_dawg(const WERD_CHOICE &word) | tesseract::Trie | inline |
| alpha_pattern_ | tesseract::Trie | protected |
| alphanum_pattern_ | tesseract::Trie | protected |
| can_be_eliminated(const EDGE_RECORD &edge_rec) | tesseract::Trie | inlineprotected |
| character_class_to_pattern(char ch) | tesseract::Trie | protected |
| check_for_words(const char *filename, const UNICHARSET &unicharset, bool enable_wildcard) const | tesseract::Dawg | |
| clear() | tesseract::Trie | |
| Dawg(DawgType type, const STRING &lang, PermuterType perm, int debug_level) | tesseract::Dawg | inlineprotected |
| DeadEdge(const EDGE_RECORD &edge_rec) const | tesseract::Trie | inline |
| debug_level_ | tesseract::Dawg | protected |
| deref_direction_mask_ | tesseract::Trie | protected |
| deref_edge_ref(EDGE_REF edge_ref) const | tesseract::Trie | inlineprotected |
| deref_node_index_mask_ | tesseract::Trie | protected |
| digit_pattern_ | tesseract::Trie | protected |
| direction_from_edge_rec(const EDGE_RECORD &edge_rec) const | tesseract::Dawg | inlineprotected |
| edge_char_of(NODE_REF node_ref, UNICHAR_ID unichar_id, bool word_end) const | tesseract::Trie | inlinevirtual |
| edge_char_of(NODE_REF node_ref, NODE_REF next_node, int direction, bool word_end, UNICHAR_ID unichar_id, EDGE_RECORD **edge_ptr, EDGE_INDEX *edge_index) const | tesseract::Trie | protected |
| edge_letter(EDGE_REF edge_ref) const | tesseract::Trie | inlinevirtual |
| 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 | tesseract::Dawg | inlineprotected |
| eliminate_redundant_edges(NODE_REF node, const EDGE_RECORD &edge1, const EDGE_RECORD &edge2) | tesseract::Trie | protected |
| end_of_word(EDGE_REF edge_ref) const | tesseract::Trie | inlinevirtual |
| end_of_word_from_edge_rec(const EDGE_RECORD &edge_rec) const | tesseract::Dawg | inlineprotected |
| flag_start_bit_ | tesseract::Dawg | protected |
| flags_mask_ | tesseract::Dawg | protected |
| get_reverse_policy_name(RTLReversePolicy reverse_policy) | tesseract::Trie | static |
| given_greater_than_edge_rec(NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, const EDGE_RECORD &edge_rec) const | tesseract::Dawg | inlineprotected |
| init(int unicharset_size) | tesseract::Dawg | protected |
| initialize_patterns(UNICHARSET *unicharset) | tesseract::Trie | |
| initialized_patterns_ | tesseract::Trie | protected |
| iterate_words(const UNICHARSET &unicharset, TessCallback1< const WERD_CHOICE *> *cb) const | tesseract::Dawg | |
| iterate_words(const UNICHARSET &unicharset, TessCallback1< const char *> *cb) const | tesseract::Dawg | |
| iterate_words_rec(const WERD_CHOICE &word_so_far, NODE_REF to_explore, TessCallback1< const WERD_CHOICE *> *cb) const | tesseract::Dawg | protected |
| kAlphanumPatternUnicode | tesseract::Trie | static |
| kAlphaPatternUnicode | tesseract::Trie | static |
| kDawgMagicNumber | tesseract::Dawg | static |
| kDigitPatternUnicode | tesseract::Trie | static |
| KillEdge(EDGE_RECORD *edge_rec) const | tesseract::Trie | inline |
| kLowerPatternUnicode | tesseract::Trie | static |
| kPatternUnicharID | tesseract::Dawg | static |
| kPuncPatternUnicode | tesseract::Trie | static |
| kSaneNumConcreteChars | tesseract::Trie | static |
| kUpperPatternUnicode | tesseract::Trie | static |
| lang() const | tesseract::Dawg | inline |
| lang_ | tesseract::Dawg | protected |
| letter_mask_ | tesseract::Dawg | protected |
| link_edge(EDGE_RECORD *edge, NODE_REF nxt, bool repeats, int direction, bool word_end, UNICHAR_ID unichar_id) | tesseract::Trie | inlineprotected |
| lower_pattern_ | tesseract::Trie | protected |
| make_edge_ref(NODE_REF node_index, EDGE_INDEX edge_index) const | tesseract::Trie | inlineprotected |
| marker_flag_from_edge_rec(const EDGE_RECORD &edge_rec) const | tesseract::Dawg | inlineprotected |
| match_words(WERD_CHOICE *word, inT32 index, NODE_REF node, UNICHAR_ID wildcard) const | tesseract::Dawg | protected |
| new_dawg_node() | tesseract::Trie | protected |
| next_node(EDGE_REF edge_ref) const | tesseract::Trie | inlinevirtual |
| next_node_from_edge_rec(const EDGE_RECORD &edge_rec) const | tesseract::Dawg | inlineprotected |
| next_node_mask_ | tesseract::Dawg | protected |
| next_node_start_bit_ | tesseract::Dawg | protected |
| nodes_ | tesseract::Trie | protected |
| num_edges_ | tesseract::Trie | protected |
| pattern_loop_edge(EDGE_REF edge_ref, UNICHAR_ID unichar_id, bool word_end) const | tesseract::Trie | inlinevirtual |
| perm_ | tesseract::Dawg | protected |
| permuter() const | tesseract::Dawg | inline |
| prefix_in_dawg(const WERD_CHOICE &prefix, bool requires_complete) const | tesseract::Dawg | |
| print_all(const char *msg, int max_num_edges) | tesseract::Trie | inlineprotected |
| print_edge_rec(const EDGE_RECORD &edge_rec) const | tesseract::Trie | inlineprotected |
| print_node(NODE_REF node, int max_num_edges) const | tesseract::Trie | virtual |
| punc_pattern_ | tesseract::Trie | protected |
| read_and_add_word_list(const char *filename, const UNICHARSET &unicharset, Trie::RTLReversePolicy reverse) | tesseract::Trie | |
| read_pattern_list(const char *filename, const UNICHARSET &unicharset) | tesseract::Trie | |
| read_word_list(const char *filename, const UNICHARSET &unicharset, Trie::RTLReversePolicy reverse_policy, GenericVector< STRING > *words) | tesseract::Trie | |
| reduce_lettered_edges(EDGE_INDEX edge_index, UNICHAR_ID unichar_id, NODE_REF node, EDGE_VECTOR *backward_edges, NODE_MARKER reduced_nodes) | tesseract::Trie | protected |
| reduce_node_input(NODE_REF node, NODE_MARKER reduced_nodes) | tesseract::Trie | protected |
| remove_edge(NODE_REF node1, NODE_REF node2, bool word_end, UNICHAR_ID unichar_id) | tesseract::Trie | inlineprotected |
| remove_edge_linkage(NODE_REF node1, NODE_REF node2, int direction, bool word_end, UNICHAR_ID unichar_id) | tesseract::Trie | protected |
| root_back_freelist_ | tesseract::Trie | protected |
| RRP_DO_NO_REVERSE enum value | tesseract::Trie | |
| RRP_FORCE_REVERSE enum value | tesseract::Trie | |
| RRP_REVERSE_IF_HAS_RTL enum value | tesseract::Trie | |
| RTLReversePolicy enum name | tesseract::Trie | |
| set_marker_flag_in_edge_rec(EDGE_RECORD *edge_rec) | tesseract::Dawg | inlineprotected |
| set_next_node_in_edge_rec(EDGE_RECORD *edge_rec, EDGE_REF value) | tesseract::Dawg | inlineprotected |
| sort_edges(EDGE_VECTOR *edges) | tesseract::Trie | protected |
| Trie(DawgType type, const STRING &lang, PermuterType perm, int unicharset_size, int debug_level) | tesseract::Trie | inline |
| trie_to_dawg() | tesseract::Trie | |
| type() const | tesseract::Dawg | inline |
| type_ | tesseract::Dawg | protected |
| unichar_id_from_edge_rec(const EDGE_RECORD &edge_rec) const | tesseract::Dawg | inlineprotected |
| unichar_id_to_patterns(UNICHAR_ID unichar_id, const UNICHARSET &unicharset, GenericVector< UNICHAR_ID > *vec) const | tesseract::Trie | virtual |
| unichar_ids_of(NODE_REF node, NodeChildVector *vec, bool word_end) const | tesseract::Trie | inlinevirtual |
| unicharset_size_ | tesseract::Dawg | protected |
| upper_pattern_ | tesseract::Trie | protected |
| word_in_dawg(const WERD_CHOICE &word) const | tesseract::Dawg | |
| ~Dawg() | tesseract::Dawg | inlinevirtual |
| ~Trie() | tesseract::Trie | inlinevirtual |