Searched refs:trie (Results 1 – 4 of 4) sorted by relevance
| /frameworks/native/cmds/installd/ |
| D | matchgen.py | 63 trie = collections.defaultdict(lambda: collections.defaultdict(lambda: collections.defaultdict(lamb… variable
68 target = trie
88 dump(trie, 0)
|
| /frameworks/minikin/libs/minikin/ |
| D | Hyphenator.cpp | 357 const Trie* trie = header->trieTable(); in hyphenateFromCodes() local
359 uint32_t char_mask = trie->char_mask; in hyphenateFromCodes()
360 uint32_t link_shift = trie->link_shift; in hyphenateFromCodes()
361 uint32_t link_mask = trie->link_mask; in hyphenateFromCodes()
362 uint32_t pattern_shift = trie->pattern_shift; in hyphenateFromCodes()
368 uint32_t entry = trie->data[node + c]; in hyphenateFromCodes()
374 uint32_t pat_ix = trie->data[node] >> pattern_shift; in hyphenateFromCodes()
|
| /frameworks/minikin/doc/ |
| D | hyb_file_format.md | 26 The second section contains the trie in packed form. It is an array of 3-tuples, packed
27 into a 32 bit integer. Each (suffix-compressed) trie node has a unique index within this
29 in the trie has an entry in the array, and the character and link fields in the tuple
34 The trie representation is similar but not identical to the "double-array trie".
|
| /frameworks/minikin/tools/ |
| D | mk_hyb_file.py | 310 def generate_header(alphabet, trie, pattern): argument
313 pattern_off = trie_off + len(trie)
415 trie = generate_trie(hyph, ch_map, n_trie, dedup_ix, dedup_nodes, patmap)
416 header = generate_header(alphabet, trie, pattern)
421 f.write(trie)
|