Lines Matching refs:trie
19 /* Generator for a compact trie for unicode normalization */
72 * To save space in the generated trie, the unicode version is not
145 * The leaves of the trie are embedded in the trie, and so the same
169 * The decompositions in the trie have been fully expanded.
939 * emitted trie. These values must be pre-computed because relative
1183 * Emit a trie for the given tree into the data array.
1840 printf("This program creates an a data trie used for parsing and\n");
1841 printf("normalization of UTF-8 strings. The trie is derived from\n");
2474 * trie.
2699 * Use trie to scan s, touching at most len bytes.
2709 utf8trie_t *trie;
2720 trie = utf8data + tree->index;
2722 offlen = (*trie & OFFLEN) >> OFFLEN_SHIFT;
2723 if (*trie & NEXTBYTE) {
2728 mask = 1 << (*trie & BITNUM);
2732 /* Right node at offset of trie */
2733 node = (*trie & RIGHTNODE);
2734 offset = trie[offlen];
2737 offset |= trie[offlen];
2739 trie += offset;
2740 } else if (*trie & RIGHTPATH) {
2742 node = (*trie & TRIENODE);
2743 trie++;
2752 node = (*trie & LEFTNODE);
2753 trie += offlen + 1;
2754 } else if (*trie & RIGHTPATH) {
2759 node = (*trie & TRIENODE);
2760 trie++;
2770 if (LEAF_CCC(trie) == DECOMPOSE && LEAF_STR(trie)[0] == HANGUL)
2771 trie = utf8hangul(s - 2, hangul);
2772 return trie;
2776 * Use trie to scan s.
2986 * trie : utf8trie_t to use for normalization.
3021 * trie : utf8trie_t to use for normalization.