Searched refs:trie (Results 1 – 5 of 5) 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
90 dump(trie, 0)
|
| /frameworks/minikin/libs/minikin/ |
| D | Hyphenator.cpp | 412 const Trie* trie = header->trieTable(); in hyphenateFromCodes() local
414 uint32_t char_mask = trie->char_mask; in hyphenateFromCodes()
415 uint32_t link_shift = trie->link_shift; in hyphenateFromCodes()
416 uint32_t link_mask = trie->link_mask; in hyphenateFromCodes()
417 uint32_t pattern_shift = trie->pattern_shift; in hyphenateFromCodes()
423 uint32_t entry = trie->data[node + c]; in hyphenateFromCodes()
429 uint32_t pat_ix = trie->data[node] >> pattern_shift; in hyphenateFromCodes()
|
| /frameworks/minikin/rust/ |
| D | hyphenator.rs | 719 let trie = header.trie_table(); localVariable
721 let char_mask = trie.char_mask();
722 let link_shift = trie.link_shift();
723 let link_mask = trie.link_mask();
724 let pattern_shift = trie.pattern_shift();
731 let entry = trie.get_at(node + c);
737 let pat_ix = trie.get_at(node) >> pattern_shift;
|
| /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 | 311 def generate_header(alphabet, trie, pattern): argument
314 pattern_off = trie_off + len(trie)
416 trie = generate_trie(hyph, ch_map, n_trie, dedup_ix, dedup_nodes, patmap)
417 header = generate_header(alphabet, trie, pattern)
422 f.write(trie)
|