| /external/hyphenation/ |
| README.hyphen | 60 Knuth uses a trie to implement this. I.e. he stores each rule in a
61 trie structure. For each position in the word, he searches the trie,
|
| /external/icu4c/common/ |
| propsvec.h | 154 * vectors array, and freeze the trie.
160 UTrie2 *trie; member in struct:UPVecToUTrie2Context
167 /* context=UPVecToUTrie2Context, creates the trie and stores the rowIndex values */
|
| ucnvsel.cpp | 23 * a trie is built when you call ucnvsel_open() that
49 UTrie2 *trie; // 16 bit trie containing offsets into pv member in struct:UConverterSelector
139 result->trie = upvec_compactToUTrie2WithRowIndexes(upvec, status);
238 utrie2_close(sel->trie);
258 UCNVSEL_INDEX_TRIE_SIZE, // trie size in bytes
295 int32_t serializedTrieSize = utrie2_serialize(sel->trie, NULL, 0, status);
336 utrie2_serialize(sel->trie, p, serializedTrieSize, status);
565 // trie
566 sel->trie = utrie2_openFromSerialized(UTRIE2_16_VALUE_BITS
[all...] |
| utrie2_impl.h | 43 * Trie data structure in serialized form:
86 /* Building a trie ---------------------------------------------------------- */
129 * Build-time trie structure.
|
| propsvec.c | 480 utrie2_freeze(toUTrie2.trie, UTRIE2_16_VALUE_BITS, pErrorCode);
482 utrie2_close(toUTrie2.trie);
483 toUTrie2.trie=NULL;
485 return toUTrie2.trie;
500 utrie2_setRange32(toUTrie2->trie, start, end, (uint32_t)rowIndex, TRUE, pErrorCode);
512 /* too many rows for a 16-bit trie */
515 toUTrie2->trie=utrie2_open(toUTrie2->initialValue,
|
| triedict.cpp | 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
[all...] |
| sprpimpl.h | 67 _SPREP_INDEX_TRIE_SIZE = 0, /* number of bytes in StringPrep trie */
|
| triedict.h | 58 * dictionary based on a trie. The base protocol is read-only.
118 * The root node of the trie
138 * @param median A UChar around which to balance the trie. Ideally, it should
238 * The root node of the trie
|
| ucase.c | 38 UTrie2 trie; member in struct:UCaseProps
68 /* add the start code point of each same-value range of the trie */
69 utrie2_enum(&csp->trie, NULL, _enumPropertyStartsRange, sa);
133 uint16_t props=UTRIE2_GET16(&csp->trie, c);
150 uint16_t props=UTRIE2_GET16(&csp->trie, c);
167 uint16_t props=UTRIE2_GET16(&csp->trie, c);
228 props=UTRIE2_GET16(&csp->trie, c);
397 uint16_t props=UTRIE2_GET16(&csp->trie, c);
404 uint16_t props=UTRIE2_GET16(&csp->trie, c);
420 uint16_t props=UTRIE2_GET16(&csp->trie, c)
[all...] |
| ucnv_ext.h | 56 * a 3-stage trie for speed,
122 * // from Unicode trie for initial-code point lookup
255 * If the from Unicode trie is present, then the from Unicode search tables
258 * (reserved, set to 0) because a value of 0 is used in trie results
264 * Stages 1 & 2 of a trie that maps an initial code point.
274 * Stage 3 of the trie. The first array simply contains indexes to the second,
435 /* most trie constants are shared with ucnvmbcs.h */
441 /* trie access, returns the stage 3 value=index to stage 3b; s1Index=c>>10 */
|
| normalizer2impl.cpp | 250 UTrie2 *trie; member in struct:CanonIterData
356 /* add the start code point of each same-value range of each trie */
369 /* add the start code point of each same-value range of the canonical iterator data trie */
372 utrie2_enum(((CanonIterData *)canonIterDataSingleton.fInstance)->trie,
598 // at the cost of building the FCD trie for a decomposition normalizer.
1548 const UTrie2 *trie=fcdTrie(); local
[all...] |
| normalizer2impl.h | 555 * Get access to the internal FCD trie table to be able to perform
557 * One pointer is sufficient because the trie index values are offset
558 * by the index size, so that the same pointer is used to access the trie data.
683 * The next four indexes are thresholds of 16-bit trie values for ranges of
693 * The trie holds the main normalization data. Each code point is mapped to a 16-bit value.
712 * The trie has a value for each lead surrogate code unit representing the "worst case"
715 * then their lead surrogate code unit has the trie value 0.
|
| ucharstriebuilder.cpp | 30 * It might(!) take less memory if we collected the data in a temporary, dynamic trie.
150 uchars=NULL; // The new trie now owns the array.
203 // Create and UChar-serialize the trie for the elements.
|
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/command/ |
| CtsConsole.java | 65 protected void setCustomCommands(RegexTrie<Runnable> trie, List<String> genericHelp,
67 trie.put(new Runnable() {
76 trie.put(new Runnable() {
85 trie.put(new Runnable() {
121 trie.put(addDerivedCommand, ADD_PATTERN, "d(?:erivedplan?)", null);
|
| /external/icu4c/test/intltest/ |
| testidna.h | 115 // test the TRIE data structure
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/trie_policy/ |
| sample_trie_e_access_traits.hpp | 44 // A sample trie element-access traits.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/trie_policy/ |
| sample_trie_e_access_traits.hpp | 44 // A sample trie element-access traits.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/trie_policy/ |
| sample_trie_e_access_traits.hpp | 44 // A sample trie element-access traits.
|
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| sample_trie_e_access_traits.hpp | 44 // A sample trie element-access traits.
|
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| sample_trie_e_access_traits.hpp | 44 // A sample trie element-access traits.
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| sample_trie_e_access_traits.hpp | 44 // A sample trie element-access traits.
|
| /external/icu4c/common/unicode/ |
| stringtriebuilder.h | 31 * Builds a trie quickly.
36 * Builds a trie more slowly, attempting to generate
51 * Base class for string trie builder classes.
186 * Branch nodes in this trie data structure are not symmetric.
190 * (trie units are written backwards), and must write it at that point even if
|
| /external/icu4c/i18n/ |
| tzgnames.cpp | 102 * GNameInfo stores zone name information in the local trie
543 // put the name info into the trie
794 // put the name to the local trie as well
840 // getPartialLocationName formats a name and put it into the trie
925 // Find matches in the local trie
[all...] |
| /packages/inputmethods/PinyinIME/jni/include/ |
| spellingtrie.h | 28 // Node used for the trie of spellings
118 // How many node used to build the trie.
146 // Yunmu ids. This functin is called after the spelling trie is built.
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| ToHTMLStream.java | 61 /** A digital search trie for fast, case insensitive lookup of ElemDesc objects. */
62 static final Trie m_elementFlags = new Trie();
67 static void initTagReference(Trie m_elementFlags) {
639 * A Trie that is just a copy of the "static" one.
641 * method Trie.get2(name)
643 private Trie m_htmlInfo = new Trie(m_elementFlags);
[all...] |
