Searched refs:trie (Results 1 - 2 of 2) sorted by relevance
/frameworks/minikin/libs/minikin/ |
H A D | Hyphenator.cpp | 192 const Trie* trie = header->trieTable(); local 194 uint32_t char_mask = trie->char_mask; 195 uint32_t link_shift = trie->link_shift; 196 uint32_t link_mask = trie->link_mask; 197 uint32_t pattern_shift = trie->pattern_shift; 203 uint32_t entry = trie->data[node + c]; 209 uint32_t pat_ix = trie->data[node] >> pattern_shift;
|
/frameworks/minikin/tools/ |
H A D | mk_hyb_file.py | 242 # suffix compression - convert the trie into an acyclic digraph, merging nodes when 302 def generate_header(alphabet, trie, pattern): 305 pattern_off = trie_off + len(trie) 407 trie = generate_trie(hyph, ch_map, n_trie, dedup_ix, dedup_nodes, patmap) 408 header = generate_header(alphabet, trie, pattern) 413 f.write(trie) 538 # reconstruct trie
|
Completed in 66 milliseconds