HomeSort by relevance Sort by last modified time
    Searched refs:trie (Results 1 - 25 of 57) sorted by null

1 2 3

  /external/chromium/third_party/icu/source/common/
utrie.h 28 * This is a common implementation of a "folded" trie.
49 * Trie constants, defining shift widths, index array lengths, etc.
114 * Number of bytes for a dummy trie.
115 * A dummy trie is an empty runtime trie, used when a real data trie cannot
135 * @param data data value for a surrogate from the trie, including the folding offset
142 * Run-time Trie structure.
175 /** Internal trie getter from an offset (0 if c16 is a BMP/lead units) and a 16-bit unit */
176 #define _UTRIE_GET_RAW(trie, data, offset, c16)
    [all...]
utrie.c 16 * This is a common implementation of a "folded" trie.
44 /* Building a trie ----------------------------------------------------------*/
51 UNewTrie *trie; local
61 trie=fillIn;
63 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie));
64 if(trie==NULL) {
68 uprv_memset(trie, 0, sizeof(UNewTrie));
69 trie->isAllocated= (UBool)(fillIn==NULL);
72 trie->data=aliasData;
73 trie->isDataAllocated=FALSE
115 UNewTrie *trie; local
    [all...]
utrie2.c 16 * This is a common implementation of a Unicode trie.
19 * This is the second common version of a Unicode trie (hence the name UTrie2).
37 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) {
40 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) {
41 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY];
48 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
51 block=trie->index2[i2];
52 return trie->data[block+(c&UTRIE2_DATA_MASK)];
56 utrie2_get32(const UTrie2 *trie, UChar32 c)
132 UTrie2 *trie; local
233 UTrie2 *trie; local
402 UTrie2Header trie; local
    [all...]
utrie2_builder.c 16 * This is a common implementation of a Unicode trie.
19 * This is the second common version of a Unicode trie (hence the name UTrie2).
42 * have been chosen to minimize trie sizes overall.
71 /* Building a trie ----------------------------------------------------------*/
106 allocIndex2Block(UNewTrie2 *trie);
110 UTrie2 *trie; local
119 trie=(UTrie2 *)uprv_malloc(sizeof(UTrie2));
122 if(trie==NULL || newTrie==NULL || data==NULL) {
123 uprv_free(trie);
130 uprv_memset(trie, 0, sizeof(UTrie2))
237 UNewTrie2 *trie; local
279 UTrie2 *trie; local
322 UTrie2 *trie; member in struct:NewTrieAndStatus
    [all...]
utrie2.h 33 * This is a common implementation of a Unicode trie.
37 * This is the second common version of a Unicode trie (hence the name UTrie2).
57 * Trie structure.
79 * Open a frozen trie from its serialized from, stored in 32-bit-aligned memory.
81 * The memory must remain valid and unchanged as long as the trie is used.
82 * You must utrie2_close() the trie once you are done using it.
89 * @param pActualLength receives the actual number of bytes at data taken up by the trie data;
92 * @return the unserialized trie
103 * Open a frozen, empty "dummy" trie.
104 * A dummy trie is an empty trie, used when a real data trie canno
    [all...]
ucol_swp.c 29 * This performs data swapping for a folded trie (see utrie.c for details).
37 UTrieHeader trie; local
56 trie.signature=ds->readUInt32(inTrie->signature);
57 trie.options=ds->readUInt32(inTrie->options);
58 trie.indexLength=udata_readInt32(ds, inTrie->indexLength);
59 trie.dataLength=udata_readInt32(ds, inTrie->dataLength);
61 if( trie.signature!=0x54726965 ||
62 (trie.options&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_SHIFT ||
63 ((trie.options>>UTRIE_OPTIONS_INDEX_SHIFT)&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_INDEX_SHIFT ||
64 trie.indexLength<UTRIE_BMP_INDEX_LENGTH |
    [all...]
ubidi_props.c 37 UTrie2 trie; member in struct:UBiDiProps
101 /* unserialize the trie, after indexes[] */
103 utrie_unserialize(&bdpProto->trie, bin, size, pErrorCode);
296 utrie_unserializeDummy(&bdp->trie, indexes+UBIDI_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(&bdp->trie, NULL, _enumPropertyStartsRange, sa);
401 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
407 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
413 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
446 uint16_t props=UTRIE2_GET16(&bdp->trie, c)
    [all...]
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...]
  /external/icu4c/common/
utrie.h 28 * This is a common implementation of a "folded" trie.
49 * Trie constants, defining shift widths, index array lengths, etc.
114 * Number of bytes for a dummy trie.
115 * A dummy trie is an empty runtime trie, used when a real data trie cannot
135 * @param data data value for a surrogate from the trie, including the folding offset
142 * Run-time Trie structure.
175 /** Internal trie getter from an offset (0 if c16 is a BMP/lead units) and a 16-bit unit */
176 #define _UTRIE_GET_RAW(trie, data, offset, c16)
    [all...]
utrie.c 16 * This is a common implementation of a "folded" trie.
44 /* Building a trie ----------------------------------------------------------*/
51 UNewTrie *trie; local
61 trie=fillIn;
63 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie));
64 if(trie==NULL) {
68 uprv_memset(trie, 0, sizeof(UNewTrie));
69 trie->isAllocated= (UBool)(fillIn==NULL);
72 trie->data=aliasData;
73 trie->isDataAllocated=FALSE
115 UNewTrie *trie; local
    [all...]
utrie2.cpp 16 * This is a common implementation of a Unicode trie.
19 * This is the second common version of a Unicode trie (hence the name UTrie2).
37 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) {
40 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) {
41 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY];
48 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
51 block=trie->index2[i2];
52 return trie->data[block+(c&UTRIE2_DATA_MASK)];
56 utrie2_get32(const UTrie2 *trie, UChar32 c)
132 UTrie2 *trie; local
233 UTrie2 *trie; local
402 UTrie2Header trie; local
    [all...]
utrie2_builder.c 16 * This is a common implementation of a Unicode trie.
19 * This is the second common version of a Unicode trie (hence the name UTrie2).
42 * have been chosen to minimize trie sizes overall.
71 /* Building a trie ----------------------------------------------------------*/
106 allocIndex2Block(UNewTrie2 *trie);
110 UTrie2 *trie; local
119 trie=(UTrie2 *)uprv_malloc(sizeof(UTrie2));
122 if(trie==NULL || newTrie==NULL || data==NULL) {
123 uprv_free(trie);
130 uprv_memset(trie, 0, sizeof(UTrie2))
237 UNewTrie2 *trie; local
279 UTrie2 *trie; local
322 UTrie2 *trie; member in struct:NewTrieAndStatus
    [all...]
utrie2.h 33 * This is a common implementation of a Unicode trie.
37 * This is the second common version of a Unicode trie (hence the name UTrie2).
57 * Trie structure.
79 * Open a frozen trie from its serialized from, stored in 32-bit-aligned memory.
81 * The memory must remain valid and unchanged as long as the trie is used.
82 * You must utrie2_close() the trie once you are done using it.
89 * @param pActualLength receives the actual number of bytes at data taken up by the trie data;
92 * @return the unserialized trie
103 * Open a frozen, empty "dummy" trie.
104 * A dummy trie is an empty trie, used when a real data trie canno
624 const UTrie2 *trie; member in class:UTrie2StringIterator
    [all...]
ucol_swp.cpp 29 * This performs data swapping for a folded trie (see utrie.c for details).
37 UTrieHeader trie; local
56 trie.signature=ds->readUInt32(inTrie->signature);
57 trie.options=ds->readUInt32(inTrie->options);
58 trie.indexLength=udata_readInt32(ds, inTrie->indexLength);
59 trie.dataLength=udata_readInt32(ds, inTrie->dataLength);
61 if( trie.signature!=0x54726965 ||
62 (trie.options&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_SHIFT ||
63 ((trie.options>>UTRIE_OPTIONS_INDEX_SHIFT)&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_INDEX_SHIFT ||
64 trie.indexLength<UTRIE_BMP_INDEX_LENGTH |
    [all...]
ubidi_props.c 37 UTrie2 trie; member in struct:UBiDiProps
101 /* unserialize the trie, after indexes[] */
103 utrie_unserialize(&bdpProto->trie, bin, size, pErrorCode);
296 utrie_unserializeDummy(&bdp->trie, indexes+UBIDI_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(&bdp->trie, NULL, _enumPropertyStartsRange, sa);
401 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
407 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
413 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
446 uint16_t props=UTRIE2_GET16(&bdp->trie, c)
    [all...]
  /external/chromium/third_party/icu/source/test/perf/unisetperf/draft/
trieset.cpp 16 * Modifies the trie index to make the BMP linear, and uses the original set
23 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH)
25 #define UTRIE_GET8_FROM_LEAD(trie, c16) \
26 ((const uint8_t *)(trie)->data32)[ \
27 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
63 // Preflight the trie length.
77 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie!
82 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT),
83 trie.index+UTRIE_BMP_INDEX_LENGTH
109 UTrie trie; member in class:TrieSet
    [all...]
  /external/icu4c/test/perf/unisetperf/draft/
trieset.cpp 16 * Modifies the trie index to make the BMP linear, and uses the original set
23 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH)
25 #define UTRIE_GET8_FROM_LEAD(trie, c16) \
26 ((const uint8_t *)(trie)->data32)[ \
27 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
63 // Preflight the trie length.
77 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie!
82 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT),
83 trie.index+UTRIE_BMP_INDEX_LENGTH
109 UTrie trie; member in class:TrieSet
    [all...]
  /external/chromium/third_party/icu/source/test/cintltst/
trie2test.c 98 const UTrie2 *trie,
105 utrie2_enum(trie, testEnumValue, testEnumRange, &checkRanges);
111 const UTrie2 *trie, UTrie2ValueBits valueBits,
118 UBool isFrozen=utrie2_isFrozen(trie);
119 const char *const typeName= isFrozen ? "frozen trie" : "newTrie";
133 value2=UTRIE2_GET16_FROM_U16_SINGLE_LEAD(trie, start);
135 value2=UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, start);
144 value2=UTRIE2_GET16_FROM_SUPP(trie, start);
146 value2=UTRIE2_GET32_FROM_SUPP(trie, start);
154 value2=UTRIE2_GET16(trie, start)
800 UTrie2 *trie; local
860 UTrie2 *trie=makeTrieWithRanges(testName, withClone, local
1060 UTrie2 *trie=makeTrieWithRanges(testName, FALSE, local
1108 UTrie2 *trie; local
1157 UTrie2 *trie; local
1210 UTrie2 *trie; local
    [all...]
trietest.c 55 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) {
64 value=utrie_get32(trie, start, &inBlockZero);
86 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) {
95 value=utrie_get32(trie, start, &inBlockZero);
141 const UTrie *trie,
170 if(trie->data32!=NULL) {
171 UTRIE_NEXT32(trie, p, limit, c, c2, value);
173 UTRIE_NEXT16(trie, p, limit, c, c2, value);
191 if(trie->data32==NULL) {
192 value=UTRIE_GET16_FROM_LEAD(trie, c)
262 UTrie trie={ 0 }; local
456 UTrie trie={ 0 }; local
824 UTrie trie; local
    [all...]
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/test/cintltst/
trie2test.c 98 const UTrie2 *trie,
105 utrie2_enum(trie, testEnumValue, testEnumRange, &checkRanges);
111 const UTrie2 *trie, UTrie2ValueBits valueBits,
118 UBool isFrozen=utrie2_isFrozen(trie);
119 const char *const typeName= isFrozen ? "frozen trie" : "newTrie";
133 value2=UTRIE2_GET16_FROM_U16_SINGLE_LEAD(trie, start);
135 value2=UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, start);
144 value2=UTRIE2_GET16_FROM_SUPP(trie, start);
146 value2=UTRIE2_GET32_FROM_SUPP(trie, start);
154 value2=UTRIE2_GET16(trie, start)
800 UTrie2 *trie; local
860 UTrie2 *trie=makeTrieWithRanges(testName, withClone, local
1060 UTrie2 *trie=makeTrieWithRanges(testName, FALSE, local
1108 UTrie2 *trie; local
1157 UTrie2 *trie; local
1210 UTrie2 *trie; local
    [all...]
trietest.c 55 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) {
64 value=utrie_get32(trie, start, &inBlockZero);
86 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) {
95 value=utrie_get32(trie, start, &inBlockZero);
141 const UTrie *trie,
170 if(trie->data32!=NULL) {
171 UTRIE_NEXT32(trie, p, limit, c, c2, value);
173 UTRIE_NEXT16(trie, p, limit, c, c2, value);
191 if(trie->data32==NULL) {
192 value=UTRIE_GET16_FROM_LEAD(trie, c)
262 UTrie trie={ 0 }; local
456 UTrie trie={ 0 }; local
824 UTrie trie; local
    [all...]
  /external/chromium/third_party/icu/source/i18n/
uspoof_buildwsconf.h 40 UTrie2 *trie; // Any-case or Lower-case Trie. member in class:BuilderScriptSet
41 // These Trie tables are the final result of the
  /external/icu4c/i18n/
uspoof_wsconf.h 44 UTrie2 *trie; // Any-case or Lower-case Trie. member in class:BuilderScriptSet
45 // These Trie tables are the final result of the
  /external/chromium/third_party/icu/source/tools/gencase/
gencase.h 112 getFoldedPropsValue(UNewTrie *trie, UChar32 start, int32_t offset);

Completed in 238 milliseconds

1 2 3