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

12 3 4

  /external/icu4c/test/cintltst/
sprpdata.c 154 UTrie trie = data->sprepTrie; local
160 UTRIE_GET16(&trie, codepoint, result);
234 UTrie trie = data->sprepTrie; local
254 UTRIE_GET16(&trie,start, result);
  /external/icu4c/tools/gennorm/
gennorm.h 54 UGENNORM_STORE_AUX, /* (a) auxiliary trie and associated data */
store.c 222 * get or create the intermediate trie entries for it as well
    [all...]
  /packages/inputmethods/PinyinIME/jni/include/
dicttrie.h 43 // trie to speed up further potential extending.
124 // Extend in the trie from level 0.
129 // Extend in the trie from level 1.
134 // Extend in the trie from level 2.
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/icu4c/common/
ucnvsel.cpp 23 * a trie is built when you call ucnvsel_open() that
47 UTrie2 *trie; // 16 bit trie containing offsets into pv member in struct:UConverterSelector
137 result->trie = upvec_compactToUTrie2WithRowIndexes(upvec, status);
239 utrie2_close(sel->trie);
259 UCNVSEL_INDEX_TRIE_SIZE, // trie size in bytes
296 int32_t serializedTrieSize = utrie2_serialize(sel->trie, NULL, 0, status);
337 utrie2_serialize(sel->trie, p, serializedTrieSize, status);
566 // trie
567 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.
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
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 */
ucase.c 38 UTrie2 trie; member in struct:UCaseProps
102 /* unserialize the trie, after indexes[] */
104 utrie_unserialize(&cspProto->trie, bin, size, pErrorCode);
302 utrie_unserializeDummy(&csp->trie, indexes+UCASE_IX_TOP, UTRIE_DUMMY_SIZE, 0, 0, TRUE, pErrorCode);
343 /* add the start code point of each same-value range of the trie */
344 utrie2_enum(&csp->trie, NULL, _enumPropertyStartsRange, sa);
408 uint16_t props=UTRIE2_GET16(&csp->trie, c);
425 uint16_t props=UTRIE2_GET16(&csp->trie, c);
442 uint16_t props=UTRIE2_GET16(&csp->trie, c);
503 props=UTRIE2_GET16(&csp->trie, c)
    [all...]
uchar.c 132 /* unserialize the trie; it is directly after the int32_t indexes[UPROPS_INDEX_COUNT] */
139 /* unserialize the properties vectors trie */
147 * Allow the properties vectors trie to be missing -
149 * to be zero so that this trie is never accessed.
907 /* add the start code point of each same-value range of the main trie */
974 /* add the start code point of each same-value range of the properties vectors trie */
976 /* if propsVectorsColumns==0 then the properties vectors trie may not be there at all */
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...]
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/icu4c/test/intltest/
testidna.h 115 // test the TRIE data structure
  /external/icu4c/tools/genprops/
props2.c 509 fprintf(stderr, "genprops error: unable to build trie for additional properties: %s\n",
714 fprintf(stderr, "genprops error: unable to serialize trie for additional properties: %s\n", u_errorName(errorCode));
719 printf("size in bytes of additional props trie:%5u\n", (int)length);
722 UTrie trie={ NULL }; local
725 utrie_unserialize(&trie, p, length, &errorCode);
729 "genprops error: failed to utrie_unserialize(trie for additional properties) - %s\n",
735 trie2=utrie2_fromUTrie(&trie, trie.initialValue, &errorCode);
  /external/icu4c/tools/gencase/
store.c 60 i2 trieSize; -- size in bytes of the case mapping properties trie
69 Serialized trie, see utrie.h;
76 Trie data word:
103 trie word.
113 13..12 same as non-exception trie data bits 5..4
828 /* excIndex will be returned for storing in the trie word */
1090 UTrie trie={ NULL }; local
    [all...]
gencase.h 112 getFoldedPropsValue(UNewTrie *trie, UChar32 start, int32_t offset);
  /dalvik/libcore/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...]
  /packages/apps/IM/src/com/android/im/app/
Markup.java 64 // Search the trie until we stop matching
  /external/icu4c/i18n/
uspoof_impl.h 360 int32_t fAnyCaseTrie; // byte offset to the serialized Any Case Trie
361 int32_t fAnyCaseTrieLength; // Length (bytes) of the serialized Any Case Trie
363 int32_t fLowerCaseTrie; // byte offset to the serialized Lower Case Trie
364 int32_t fLowerCaseTrieLength; // Length (bytes) of the serialized Lower Case Trie
392 // by the offsets obtained from the Trie.
  /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

Completed in 81 milliseconds

12 3 4