HomeSort by relevance Sort by last modified time
    Searched full:trie (Results 51 - 75 of 86) sorted by null

1 23 4

  /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...]
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...]
  /frameworks/base/core/java/com/google/android/util/
AbstractMessageParser.java 49 * Values are expected to be reversed in the Trie.
287 * loaded from a file into a trie at server start.
    [all...]
  /external/icu4c/i18n/
ucol_elm.cpp     [all...]
zstrfmt.cpp 507 // Put the name into the trie
752 // Create UnicodeString array and put strings to the zone string trie
762 // Add a metazone string to the zone string trie
867 // Add names to the trie
    [all...]
uspoof_impl.cpp 568 // This function is used both during the Trie building process (multiple
933 // Any Case Trie
938 // Lower Case Trie
ucol_cnt.cpp 212 // tailorings that have constructions in a bad way. At least, one should enumerate the trie. Also,
zstrfmt.h 79 * TextTrieMap is a trie implementation for supporting
ucol_imp.h     [all...]
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
AutoDictionary.java 220 * the in-memory trie.
  /external/icu4c/common/
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
dictbe.cpp 341 // but it's not clear it's faster than checking the trie.
rbbirb.cpp 250 // Generate the mapping tables (TRIE) from input 32-bit characters to
uprops.c 484 * - Get ranges per trie, not per individual property.
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.
652 /* enumerate the from-Unicode trie table */
    [all...]
unorm.cpp 458 * It is possible to get the FCD data from the main trie if unorm.icu
459 * was built without the FCD trie, although it is slower.
    [all...]
  /external/icu4c/tools/toolutil/
swapimpl.cpp 146 * PT serialized properties trie, see utrie.h (byte size: 4*(i0-16))
177 * i3 additionalTrieIndex; -- 32-bit unit index to the additional trie for more properties
  /external/icu4c/test/intltest/
testidn.cpp 321 test.logln("Number of code points that have no value in Trie: %i \n",noValueInTrie);
  /packages/inputmethods/PinyinIME/jni/include/
matrixsearch.h 159 // Spelling trie.
  /prebuilt/darwin-x86/toolchain/arm-eabi-4.2.1/info/
bfd.info     [all...]
  /prebuilt/darwin-x86/toolchain/arm-eabi-4.3.1/info/
bfd.info     [all...]
  /prebuilt/darwin-x86/toolchain/arm-eabi-4.4.0/info/
bfd.info     [all...]
  /prebuilt/darwin-x86/toolchain/arm-eabi-4.4.0/share/info/
bfd.info     [all...]
  /prebuilt/linux-x86/toolchain/arm-eabi-4.2.1/info/
bfd.info     [all...]
  /prebuilt/linux-x86/toolchain/arm-eabi-4.3.1/info/
bfd.info     [all...]

Completed in 174 milliseconds

1 23 4