66 int direction,
bool word_end,
UNICHAR_ID unichar_id,
70 " direction %d word_end %d unichar_id %d, exploring node:\n",
71 node_ref,
next_node, direction, word_end, unichar_id);
72 if (node_ref != NO_EDGE) {
76 if (node_ref == NO_EDGE)
return false;
79 nodes_[node_ref]->forward_edges :
nodes_[node_ref]->backward_edges;
80 int vec_size = vec.
size();
86 while (start <= end) {
87 k = (start + end) >> 1;
91 *edge_ptr = &(vec[k]);
94 }
else if (compare == 1) {
101 for (
int i = 0; i < vec_size; ++i) {
107 *edge_ptr = &(edge_rec);
117 int direction,
bool word_end,
120 &(
nodes_[node1]->forward_edges) : &(
nodes_[node1]->backward_edges);
124 while (search_index < vec->size() &&
126 (*vec)[search_index]) == 1) {
130 search_index = vec->
size();
133 link_edge(&edge_rec, node2, marker_flag, direction, word_end, unichar_id);
137 (*vec)[edge_index] = edge_rec;
138 }
else if (search_index < vec->size()) {
139 vec->
insert(edge_rec, search_index);
159 unichar_id, &back_edge_ptr, &back_edge_index));
171 if (word.
length() <= 0)
return false;
174 for (
int i = 0; i < word.
length(); ++i) {
182 bool marker_flag =
false;
185 int32_t still_finding_chars =
true;
186 int32_t word_end =
false;
187 bool add_failed =
false;
193 for (i = 0; i < word.
length() - 1; ++i) {
195 marker_flag = (repetitions !=
nullptr) ? (*repetitions)[i] :
false;
197 if (still_finding_chars) {
199 unichar_id, &edge_ptr, &edge_index);
202 edge_index, last_node);
205 still_finding_chars =
false;
215 still_finding_chars =
false;
223 if (!still_finding_chars) {
227 if (the_next_node == 0) {
232 marker_flag, word_end, unichar_id)) {
237 last_node = the_next_node;
242 marker_flag = (repetitions !=
nullptr) ? (*repetitions)[i] :
false;
244 if (still_finding_chars &&
246 unichar_id, &edge_ptr, &edge_index)) {
250 marker_flag, unichar_id);
256 !
add_new_edge(last_node, the_next_node, marker_flag,
true, unichar_id))
260 tprintf(
"Re-initializing document dictionary...\n");
275 static int sort_strings_by_dec_length(
const void* v1,
const void* v2) {
276 const auto *s1 =
static_cast<const STRING *
>(v1);
277 const auto *s2 =
static_cast<const STRING *
>(v2);
278 return s2->
length() - s1->length();
286 word_list.
sort(sort_strings_by_dec_length);
296 word_file = fopen(filename,
"rb");
297 if (word_file ==
nullptr)
return false;
299 while (fgets(line_str,
sizeof(line_str), word_file) !=
nullptr) {
301 STRING word_str(line_str);
304 tprintf(
"Read %d words so far\n", word_count);
308 tprintf(
"Read %d words total.\n", word_count);
316 for (
int i = 0; i < words.
size(); ++i) {
328 tprintf(
"Error: word '%s' not in DAWG after adding it\n",
357 bool is_alpha = unicharset.
get_isalpha(unichar_id);
379 }
else if (ch ==
'd') {
381 }
else if (ch ==
'n') {
383 }
else if (ch ==
'p') {
385 }
else if (ch ==
'a') {
387 }
else if (ch ==
'A') {
390 return INVALID_UNICHAR_ID;
397 tprintf(
"please call initialize_patterns() before read_pattern_list()\n");
401 FILE *pattern_file = fopen(filename,
"rb");
402 if (pattern_file ==
nullptr) {
403 tprintf(
"Error opening pattern file %s\n", filename);
407 int pattern_count = 0;
415 const char *str_ptr = string;
416 int step = unicharset.
step(str_ptr);
419 UNICHAR_ID curr_unichar_id = INVALID_UNICHAR_ID;
420 if (step == 1 && *str_ptr ==
'\\') {
422 if (*str_ptr ==
'\\') {
426 tprintf(
"Please provide at least %d concrete characters at the"
437 if (curr_unichar_id == INVALID_UNICHAR_ID) {
444 step = unicharset.
step(str_ptr);
446 if (step == 1 && *str_ptr ==
'\\' && *(str_ptr+1) ==
'*') {
447 repetitions_vec[repetitions_vec.
size()-1] =
true;
449 step = unicharset.
step(str_ptr);
453 tprintf(
"Invalid user pattern %s\n",
string);
458 tprintf(
"Inserting expanded user pattern %s\n",
464 tprintf(
"Error: failed to insert pattern '%s'\n",
string);
470 tprintf(
"Read %d valid patterns from %s\n", pattern_count, filename);
472 fclose(pattern_file);
481 unichar_id, &edge_ptr, &edge_index));
489 }
else if (node1 == 0) {
517 for (
int i = 0; i <
nodes_.
size(); i++) reduced_nodes[i] =
false;
519 delete[] reduced_nodes;
530 node_ref_map[i+1] = node_ref_map[i] +
nodes_[i]->forward_edges.
size();
532 int num_forward_edges = node_ref_map[i];
536 auto edge_array =
new EDGE_RECORD[num_forward_edges];
541 for (j = 0; j < end; ++j) {
552 delete[] node_ref_map;
562 tprintf(
"\nCollapsing node %" PRIi64
":\n", node);
586 curr_word_end, curr_unichar_id);
589 curr_word_end, curr_unichar_id,
590 &edge_ptr, &edge_index));
597 next_node2_num_edges, next_node2);
613 bool did_something =
false;
614 for (
int i = edge_index; i < backward_edges->
size() - 1; ++i) {
616 UNICHAR_ID curr_unichar_id = INVALID_UNICHAR_ID;
617 while (i < backward_edges->size()) {
618 if (!
DeadEdge((*backward_edges)[i])) {
620 if (curr_unichar_id != unichar_id)
return did_something;
625 if (i == backward_edges->
size())
break;
626 const EDGE_RECORD &edge_rec = (*backward_edges)[i];
628 for (
int j = i + 1; j < backward_edges->
size(); ++j) {
629 const EDGE_RECORD &next_edge_rec = (*backward_edges)[j];
630 if (
DeadEdge(next_edge_rec))
continue;
632 if (next_id != unichar_id)
break;
638 did_something =
true;
643 return did_something;
647 int num_edges = edges->
size();
648 if (num_edges <= 1)
return;
651 for (
int i = 0; i < num_edges; ++i) {
656 for (
int i = 0; i < num_edges; ++i)
657 (*edges)[i] = sort_vec[i].data;
670 while (edge_index < backward_edges.
size()) {
671 if (
DeadEdge(backward_edges[edge_index]))
continue;
675 &backward_edges, reduced_nodes));
676 while (++edge_index < backward_edges.
size()) {
678 if (!
DeadEdge(backward_edges[edge_index]) &&
id != unichar_id)
break;
681 reduced_nodes[node] =
true;
688 for (
int i = 0; i < backward_edges.
size(); ++i) {
689 if (
DeadEdge(backward_edges[i]))
continue;
698 if (node == NO_EDGE)
return;
703 for (
int dir = 0; dir < 2; ++dir) {
712 for (i = 0; (dir == 0 ? i < num_fwd : i < num_bkw) &&
713 i < max_num_edges; ++i) {
718 if (dir == 0 ? i < num_fwd : i < num_bkw)
tprintf(
"...");
void chomp_string(char *str)
DLLSYM void tprintf(const char *format,...)
#define MAX_NODE_EDGES_DISPLAY
const char kDoNotReverse[]
const char kReverseIfHasRTL[]
const char kForceReverse[]
const char *const RTLReversePolicyNames[]
void insert(const T &t, int index)
void delete_data_pointers()
const STRING debug_string() const
UNICHAR_ID unichar_id(int index) const
bool contains_unichar_id(UNICHAR_ID unichar_id) const
bool has_rtl_unichar_id() const
void reverse_and_mirror_unichar_ids()
void append_unichar_id(UNICHAR_ID unichar_id, int blob_count, float rating, float certainty)
const char * string() const
bool get_ispunctuation(UNICHAR_ID unichar_id) const
void unichar_insert(const char *const unichar_repr, OldUncleanUnichars old_style)
bool get_isupper(UNICHAR_ID unichar_id) const
bool get_isalpha(UNICHAR_ID unichar_id) const
int step(const char *str) const
bool get_isdigit(UNICHAR_ID unichar_id) const
UNICHAR_ID unichar_to_id(const char *const unichar_repr) const
bool get_islower(UNICHAR_ID unichar_id) 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
NODE_REF next_node_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns the next node visited by following this edge.
int given_greater_than_edge_rec(NODE_REF next_node, bool word_end, UNICHAR_ID unichar_id, const EDGE_RECORD &edge_rec) const
bool word_in_dawg(const WERD_CHOICE &word) const
Returns true if the given word is in the Dawg.
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.
bool end_of_word_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns true if this edge marks the end of a word.
bool marker_flag_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns the marker flag of this edge.
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.
UNICHAR_ID unichar_id_from_edge_rec(const EDGE_RECORD &edge_rec) const
Returns UNICHAR_ID recorded in this edge.
PermuterType perm_
Permuter code that should be used if the word is found in this Dawg.
EDGE_VECTOR backward_edges
EDGE_VECTOR forward_edges
UNICHAR_ID alpha_pattern_
void link_edge(EDGE_RECORD *edge, NODE_REF nxt, bool repeats, int direction, bool word_end, UNICHAR_ID unichar_id)
void KillEdge(EDGE_RECORD *edge_rec) const
bool initialized_patterns_
static const char kLowerPatternUnicode[]
bool read_and_add_word_list(const char *filename, const UNICHARSET &unicharset, Trie::RTLReversePolicy reverse)
static const char kAlphanumPatternUnicode[]
void remove_edge(NODE_REF node1, NODE_REF node2, bool word_end, UNICHAR_ID unichar_id)
bool add_new_edge(NODE_REF node1, NODE_REF node2, bool repeats, bool word_end, UNICHAR_ID unichar_id)
NODE_REF next_node(EDGE_REF edge_ref) const override
void initialize_patterns(UNICHARSET *unicharset)
bool eliminate_redundant_edges(NODE_REF node, const EDGE_RECORD &edge1, const EDGE_RECORD &edge2)
void print_all(const char *msg, int max_num_edges)
static const char kUpperPatternUnicode[]
UNICHAR_ID digit_pattern_
GenericVector< EDGE_INDEX > root_back_freelist_
SquishedDawg * trie_to_dawg()
bool add_edge_linkage(NODE_REF node1, NODE_REF node2, bool repeats, int direction, bool word_end, UNICHAR_ID unichar_id)
EDGE_REF edge_char_of(NODE_REF node_ref, UNICHAR_ID unichar_id, bool word_end) const override
UNICHAR_ID lower_pattern_
static const char kDigitPatternUnicode[]
bool read_pattern_list(const char *filename, const UNICHARSET &unicharset)
void reduce_node_input(NODE_REF node, NODE_MARKER reduced_nodes)
UNICHAR_ID upper_pattern_
bool add_word_list(const GenericVector< STRING > &words, const UNICHARSET &unicharset, Trie::RTLReversePolicy reverse_policy)
void remove_edge_linkage(NODE_REF node1, NODE_REF node2, int direction, bool word_end, UNICHAR_ID unichar_id)
void sort_edges(EDGE_VECTOR *edges)
UNICHAR_ID alphanum_pattern_
static const char kPuncPatternUnicode[]
void unichar_id_to_patterns(UNICHAR_ID unichar_id, const UNICHARSET &unicharset, GenericVector< UNICHAR_ID > *vec) const override
bool read_word_list(const char *filename, GenericVector< STRING > *words)
UNICHAR_ID character_class_to_pattern(char ch)
void print_node(NODE_REF node, int max_num_edges) const override
bool add_word_to_dawg(const WERD_CHOICE &word, const GenericVector< bool > *repetitions)
static const char * get_reverse_policy_name(RTLReversePolicy reverse_policy)
static const char kAlphaPatternUnicode[]
bool reduce_lettered_edges(EDGE_INDEX edge_index, UNICHAR_ID unichar_id, NODE_REF node, EDGE_VECTOR *backward_edges, NODE_MARKER reduced_nodes)
bool DeadEdge(const EDGE_RECORD &edge_rec) const
bool can_be_eliminated(const EDGE_RECORD &edge_rec)
static const int kSaneNumConcreteChars
void print_edge_rec(const EDGE_RECORD &edge_rec) const
void add_word_ending(EDGE_RECORD *edge, NODE_REF the_next_node, bool repeats, UNICHAR_ID unichar_id)