| /external/antlr/antlr-3.4/runtime/C/doxygen/ |
| mainpage.dox | 70 /// Hashtable, Vector and Trie, implemented by pointers to structures. These are freely available for your own programming needs.
|
| /external/icu4c/common/ |
| propname.h | 109 static UBool containsName(BytesTrie &trie, const char *name);
|
| normalizer2.cpp | 863 const UTrie2 *trie=Normalizer2Factory::getFCDTrie(*pErrorCode);
865 fcdHighStart=trie->highStart;
866 return trie->index;
|
| rbbidata.cpp | 26 // Trie access folding function. Copied as-is from properties code in uchar.c
32 /* if bit 15 is set, then the folding offset is in bits 14..0 of the 16-bit trie result */
423 // Trie table for character categories
|
| uchar.c | 637 /* add the start code point of each same-value range of the main trie */
697 /* add the start code point of each same-value range of the properties vectors trie */
699 /* if propsVectorsColumns==0 then the properties vectors trie may not be there at all */
|
| rbbirb.cpp | 250 // Generate the mapping tables (TRIE) from input 32-bit characters to
|
| ucnvmbcs.c | 297 * The lookup is done with a 3-stage trie, using 11/6/4 bits for stage 1/2/3
299 * The beginning of the trie is at offsetFromUTable, the beginning of stage 3
303 * trie compared to other codepages.
320 * becomes a 2-stage (single-index) trie lookup with 6 bits for stage 3.
346 * becomes a 2-stage (single-index) trie lookup with 6 bits for stage 3.
723 /* enumerate the from-Unicode trie table */
[all...] |
| dictbe.cpp | 341 // but it's not clear it's faster than checking the trie.
|
| /external/valgrind/main/callgrind/ |
| clo.c | 74 * We build a trie from patterns, and for a given function, we
81 /* node of compressed trie search structure */
95 /* root of trie */
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3baserecognizer.c | [all...] |
| /external/icu4c/i18n/ |
| uspoof_impl.cpp | 577 // This function is used both during the Trie building process (multiple
942 // Any Case Trie
947 // Lower Case Trie
|
| ucol_cnt.cpp | 212 // tailorings that have constructions in a bad way. At least, one should enumerate the trie. Also,
|
| /external/icu4c/tools/gennorm2/ |
| n2builder.cpp | 207 * get or create the intermediate trie entries for it as well
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_.hpp | 109 * class description = PATRICIA trie implementation.">
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_.hpp | 109 * class description = PATRICIA trie implementation.">
|
| /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/pat_trie_/ |
| pat_trie_.hpp | 109 * class description = PATRICIA trie implementation.">
|
| /prebuilts/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_.hpp | 109 * class description = PATRICIA trie implementation.">
|
| /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_.hpp | 109 * class description = PATRICIA trie implementation.">
|
| /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_.hpp | 109 * class description = PATRICIA trie implementation.">
|
| /external/icu4c/tools/toolutil/ |
| swapimpl.cpp | 242 * PT serialized properties trie, see utrie.h (byte size: 4*(i0-16))
273 * i3 additionalTrieIndex; -- 32-bit unit index to the additional trie for more properties
|
| /external/icu4c/test/intltest/ |
| testidn.cpp | 319 test.logln("Number of code points that have no value in Trie: %i \n",noValueInTrie);
|
| /external/icu4c/tools/makeconv/ |
| genmbcs.c | 574 * Walk down the triple-stage compact array ("trie") and
704 * Walk down the triple-stage compact array ("trie") and
819 * The stage 3 block has been assigned for the regular trie.
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| ExpandableDictionary.java | 516 * Adds bigrams to the in-memory trie structure that is being used to retrieve any word
665 * @param children the node of the trie to search under.
[all...] |
| UserHistoryDictionary.java | 358 * the in-memory trie.
|
| /external/chromium/app/sql/ |
| connection.h | 158 // Returns trie if the database has been successfully opened.
|
