| /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.
|
| dictbuilder.h | 97 // Build dictionary trie from the file fn_raw. File fn_validhzs provides
|
| /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...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| collection.h | 40 struct Node { // Trie node
|
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTreeImpl.java | 373 * Display the Trie on console.
375 * WARNING! Do not use this for a large Trie, it's for testing purpose only.
389 * WARNING! Do not use this for a large Trie, it's for testing purpose only.
415 * WARNING! Do not use this for a large Trie, it's for testing purpose only.
|
| /external/icu4c/common/ |
| rbbisetb.cpp | 26 // - construct the trie table that maps input characters
48 // getFoldedRBBIValue Call-back function used during building of Trie table.
51 // (It'd really be nice if the Trie builder would provide a
58 getFoldedRBBIValue(UNewTrie *trie, UChar32 start, int32_t offset) {
65 value=utrie_get32(trie, start, &inBlockZero);
259 // they doesn't affect the computation of ranges or TRIE.
285 // Build the Trie table for mapping UChar32 values to the corresponding
288 fTrie = utrie_open(NULL, // Pre-existing trie to be filled in
305 // getTrieSize() Return the size that will be required to serialize the Trie.
315 // RBBIDebugPrintf("Trie table size is %d\n", trieSize)
[all...] |
| bytestriebuilder.cpp | 30 * It might(!) take less memory if we collected the data in a temporary, dynamic trie.
197 bytes=NULL; // The new trie now owns the array.
246 // Create and byte-serialize the trie for the elements.
|
| ucnv_ext.c | 116 * - no trie is used
538 /* trie lookup of firstCP */
541 return 0; /* the first code point is outside the trie */
642 } else /* result from firstCP trie lookup */ {
[all...] |
| rbbidata.h | 84 uint32_t fTrie; /* Offset to Trie data for character categories */
|
| /external/antlr/antlr-3.4/runtime/C/doxygen/ |
| doxygengroups.dox | 137 /// \defgroup ANTLR3_INT_TRIE ANTLR3_INT_TRIE - Trie Class Definition
237 /// \defgroup pANTLR3_INT_TRIE pANTLR3_INT_TRIE - Trie Implementation
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/ |
| tag_and_trait.hpp | 128 /// trie.
131 /// PATRICIA trie.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/ |
| tag_and_trait.hpp | 129 /// trie.
132 /// PATRICIA trie.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/ |
| tag_and_trait.hpp | 129 /// trie.
132 /// PATRICIA trie.
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tag_and_trait.hpp | 128 /// trie.
131 /// PATRICIA trie.
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tag_and_trait.hpp | 128 /// trie.
131 /// PATRICIA trie.
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tag_and_trait.hpp | 128 /// trie.
131 /// PATRICIA trie.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tag_and_trait.hpp | 128 /// trie.
131 /// PATRICIA trie.
|
| /external/icu4c/i18n/ |
| tznames_impl.cpp | 138 // Trie is built, while fNodes and fLazyContents change with the lazy init
285 // Mutex for protecting the lazy creation of the Trie node structure on the first call to search().
288 // buildTrie() - The Trie node structure is needed. Create it from the data that was
289 // saved at the time the ZoneStringFormatter was created. The Trie is only
291 // and the Trie is big, which is why its creation is deferred until first use.
734 * ZNameInfo stores zone name information in the trie
[all...] |
| uspoof_impl.h | 355 int32_t fAnyCaseTrie; // byte offset to the serialized Any Case Trie
356 int32_t fAnyCaseTrieLength; // Length (bytes) of the serialized Any Case Trie
358 int32_t fLowerCaseTrie; // byte offset to the serialized Lower Case Trie
359 int32_t fLowerCaseTrieLength; // Length (bytes) of the serialized Lower Case Trie
387 // by the offsets obtained from the Trie.
|
| tznames_impl.h | 125 * TextTrieMap is a trie implementation for supporting
|
| /external/icu4c/tools/genctd/ |
| genctd.cpp | 63 printf("\tRead in word list and write out compact trie dictionary\n"
112 { 0x54, 0x72, 0x44, 0x63 }, // "TrDc" Trie Dictionary
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| com.ibm.icu_4.2.1.v20100412.jar | |
| /external/clang/test/Analysis/ |
| misc-ps.m | 834 struct trie {
835 struct trie* next;
839 struct trie *trie;
841 struct trie* next[10];
845 typedef struct trie trie_t;
849 struct trie const *trie;
850 struct trie * const *next = kws->next;
858 trie = next[c]
[all...] |
| /external/icu4c/tools/makeconv/ |
| gencnvex.c | 569 * write an entry in the 3-stage trie
815 * add entries to the fromUnicode trie,
817 * and use that to build the trie in precompacted form
945 * enter the initial code point into the trie,
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/ |
| FusionDictionary.java | 88 * be seen as a traditional "trie node", except it can hold several characters at the
90 * of the trie trie; as such, it can be a terminal, and it can have children.
595 * Recursively count the number of character groups in a given branch of the trie.
612 * Recursively count the number of nodes in a given branch of the trie.
[all...] |
