Home
last modified time | relevance | path

Searched refs:FORWARD_EDGE (Results 1 – 3 of 3) sorted by relevance

/external/tesseract/dict/
Dtrie.h77 if (!edge_char_of(node_ref, NO_EDGE, FORWARD_EDGE, word_end, unichar_id, in edge_char_of()
173 (direction_from_edge_rec(edge_rec) == FORWARD_EDGE) ? "F" : "B", in print_edge_rec()
210 return (add_edge_linkage(node1, node2, FORWARD_EDGE, in add_new_edge()
234 remove_edge_linkage(node1, node2, FORWARD_EDGE, word_end, unichar_id); in remove_edge()
Dtrie.cpp51 EDGE_VECTOR &vec = (direction == FORWARD_EDGE) ? in edge_char_of()
92 EDGE_VECTOR *vec = (direction == FORWARD_EDGE) ? in add_edge_linkage()
153 found = edge_char_of(last_node, NO_EDGE, FORWARD_EDGE, word_end, in add_word_to_dawg()
189 edge_char_of(last_node, NO_EDGE, FORWARD_EDGE, false, in add_word_to_dawg()
258 if (direction == FORWARD_EDGE) { in remove_edge_linkage()
301 link_edge(edge_array_ptr, node_ref_map[node_ref], FORWARD_EDGE, in trie_to_dawg()
346 ASSERT_HOST(edge_char_of(curr_next_node, next_node2, FORWARD_EDGE, in eliminate_redundant_edges()
Ddawg.h90 #define FORWARD_EDGE (inT32) 0 macro
189 BACKWARD_EDGE : FORWARD_EDGE; in direction_from_edge_rec()
431 (FORWARD_EDGE == direction_from_edge_rec(edges_[edge_ref]))); in forward_edge()