Lines Matching full:trie
48 // Node structure for the ternary, uncompressed trie
81 // Start the trie off with something. Having the root node already present
84 // 4x a balanced trie to 2x a balanced trie. It's best to choose something
548 const CompactTrieHeader *fHeader; // Trie data
671 // Below here is all code related to converting a ternary trie to a compact trie
675 // Helper classes to construct the compact trie
833 status = U_ILLEGAL_ARGUMENT_ERROR; // Corrupt input trie
998 fprintf(stderr, "Trie node dupe removal, pass %d: %d nodes tagged\n", passCount, dupes);
1003 fprintf(stderr, "Trie node dupe removal complete: %d tagged in %d passes\n", totalDupes, passCount);
1045 // This call does all the work of building the new trie structure. The root
1050 fprintf(stderr, "Compact trie built, %d nodes, time user %f system %f\n",
1066 // Next, build the output trie.
1137 fprintf(stderr, "Trie built, time user %f system %f\n",
1209 // Convert one compact trie node into a ternary subtrie
1335 udata_printError(ds, "triedict_swap(): too few bytes (%d after ICU Data header) for trie data.\n",
