Searched refs:trie (Results 1 - 25 of 90) sorted by relevance

1234

/external/icu/icu4c/source/common/
H A Dutrie2.cpp16 * This is a common implementation of a Unicode trie.
19 * This is the second common version of a Unicode trie (hence the name UTrie2).
41 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { argument
44 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) {
45 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY];
52 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
55 block=trie->index2[i2];
56 return trie->data[block+(c&UTRIE2_DATA_MASK)];
60 utrie2_get32(const UTrie2 *trie, UChar3 argument
73 utrie2_get32FromLeadSurrogateCodeUnit(const UTrie2 *trie, UChar32 c) argument
87 u8Index(const UTrie2 *trie, UChar32 c, int32_t i) argument
97 utrie2_internalU8NextIndex(const UTrie2 *trie, UChar32 c, const uint8_t *src, const uint8_t *limit) argument
112 utrie2_internalU8PrevIndex(const UTrie2 *trie, UChar32 c, const uint8_t *start, const uint8_t *src) argument
136 UTrie2 *trie; local
238 UTrie2 *trie; local
367 utrie2_close(UTrie2 *trie) argument
403 utrie2_isFrozen(const UTrie2 *trie) argument
408 utrie2_serialize(const UTrie2 *trie, void *data, int32_t capacity, UErrorCode *pErrorCode) argument
436 UTrie2Header trie; local
545 enumEitherTrie(const UTrie2 *trie, UChar32 start, UChar32 limit, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
723 utrie2_enum(const UTrie2 *trie, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
729 utrie2_enumForLeadSurrogate(const UTrie2 *trie, UChar32 lead, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
[all...]
H A Dutrie.h29 * This is a common implementation of a "folded" trie.
115 * Number of bytes for a dummy trie.
116 * A dummy trie is an empty runtime trie, used when a real data trie cannot
136 * @param data data value for a surrogate from the trie, including the folding offset
176 /** Internal trie getter from an offset (0 if c16 is a BMP/lead units) and a 16-bit unit */
177 #define _UTRIE_GET_RAW(trie, data, offset, c16) \
178 (trie)->data[ \
179 ((int32_t)((trie)
[all...]
H A Dutrie.cpp16 * 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
115 UNewTrie *trie; local
151 utrie_close(UNewTrie *trie) argument
164 utrie_getData(UNewTrie *trie, int32_t *pLength) argument
174 utrie_allocDataBlock(UNewTrie *trie) argument
194 utrie_getDataBlock(UNewTrie *trie, UChar32 c) argument
220 utrie_set32(UNewTrie *trie, UChar32 c, uint32_t value) argument
238 utrie_get32(UNewTrie *trie, UChar32 c, UBool *pInBlockZero) argument
282 utrie_setRange32(UNewTrie *trie, UChar32 start, UChar32 limit, uint32_t value, UBool overwrite) argument
403 utrie_fold(UNewTrie *trie, UNewTrieGetFoldedValue *getFoldedValue, UErrorCode *pErrorCode) argument
544 _findUnusedBlocks(UNewTrie *trie) argument
588 utrie_compact(UNewTrie *trie, UBool overlap, UErrorCode *pErrorCode) argument
719 defaultGetFoldedValue(UNewTrie *trie, UChar32 start, int32_t offset) argument
740 utrie_serialize(UNewTrie *trie, void *dt, int32_t capacity, UNewTrieGetFoldedValue *getFoldedValue, UBool reduceTo16Bits, UErrorCode *pErrorCode) argument
855 utrie_unserialize(UTrie *trie, const void *data, int32_t length, UErrorCode *pErrorCode) argument
930 utrie_unserializeDummy(UTrie *trie, void *data, int32_t length, uint32_t initialValue, uint32_t leadUnitValue, UBool make16BitTrie, UErrorCode *pErrorCode) argument
1057 utrie_enum(const UTrie *trie, UTrieEnumValue *enumValue, UTrieEnumRange *enumRange, const void *context) argument
[all...]
H A Dutrie2.h34 * This is a common implementation of a Unicode trie.
38 * This is the second common version of a Unicode trie (hence the name UTrie2).
80 * Open a frozen trie from its serialized from, stored in 32-bit-aligned memory.
82 * The memory must remain valid and unchanged as long as the trie is used.
83 * You must utrie2_close() the trie once you are done using it.
90 * @param pActualLength receives the actual number of bytes at data taken up by the trie data;
93 * @return the unserialized trie
104 * Open a frozen, empty "dummy" trie.
105 * A dummy trie is an empty trie, use
635 const UTrie2 *trie; member in class:UTrie2StringIterator
[all...]
H A Dutrie2_builder.cpp16 * 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,
237 UNewTrie2 *trie; local
279 UTrie2 *trie; local
322 UTrie2 *trie; member in struct:NewTrieAndStatus
347 utrie_printLengths(const UTrie *trie) argument
356 utrie2_printLengths(const UTrie2 *trie, const char *which) argument
459 isInNullBlock(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
474 allocIndex2Block(UNewTrie2 *trie) argument
493 getIndex2Block(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
513 allocDataBlock(UNewTrie2 *trie, int32_t copyBlock) argument
559 releaseDataBlock(UNewTrie2 *trie, int32_t block) argument
566 isWritableBlock(UNewTrie2 *trie, int32_t block) argument
571 setIndex2Entry(UNewTrie2 *trie, int32_t i2, int32_t block) argument
588 getDataBlock(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
616 set32(UNewTrie2 *trie, UChar32 c, UBool forLSCP, uint32_t value, UErrorCode *pErrorCode) argument
636 utrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode) argument
648 utrie2_set32ForLeadSurrogateCodeUnit(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode) argument
695 utrie2_setRange32(UTrie2 *trie, UChar32 start, UChar32 end, uint32_t value, UBool overwrite, UErrorCode *pErrorCode) argument
899 findHighStart(UNewTrie2 *trie, uint32_t highValue) argument
985 compactData(UNewTrie2 *trie) argument
1092 compactIndex2(UNewTrie2 *trie) argument
1174 compactTrie(UTrie2 *trie, UErrorCode *pErrorCode) argument
1251 utrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode) argument
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dutrie.h29 * This is a common implementation of a "folded" trie.
115 * Number of bytes for a dummy trie.
116 * A dummy trie is an empty runtime trie, used when a real data trie cannot
136 * @param data data value for a surrogate from the trie, including the folding offset
176 /** Internal trie getter from an offset (0 if c16 is a BMP/lead units) and a 16-bit unit */
177 #define _UTRIE_GET_RAW(trie, data, offset, c16) \
178 (trie)->data[ \
179 ((int32_t)((trie)
[all...]
H A Dutrie.cpp16 * 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
115 UNewTrie *trie; local
151 utrie_close(UNewTrie *trie) argument
164 utrie_getData(UNewTrie *trie, int32_t *pLength) argument
174 utrie_allocDataBlock(UNewTrie *trie) argument
194 utrie_getDataBlock(UNewTrie *trie, UChar32 c) argument
220 utrie_set32(UNewTrie *trie, UChar32 c, uint32_t value) argument
238 utrie_get32(UNewTrie *trie, UChar32 c, UBool *pInBlockZero) argument
282 utrie_setRange32(UNewTrie *trie, UChar32 start, UChar32 limit, uint32_t value, UBool overwrite) argument
403 utrie_fold(UNewTrie *trie, UNewTrieGetFoldedValue *getFoldedValue, UErrorCode *pErrorCode) argument
544 _findUnusedBlocks(UNewTrie *trie) argument
588 utrie_compact(UNewTrie *trie, UBool overlap, UErrorCode *pErrorCode) argument
719 defaultGetFoldedValue(UNewTrie *trie, UChar32 start, int32_t offset) argument
740 utrie_serialize(UNewTrie *trie, void *dt, int32_t capacity, UNewTrieGetFoldedValue *getFoldedValue, UBool reduceTo16Bits, UErrorCode *pErrorCode) argument
855 utrie_unserialize(UTrie *trie, const void *data, int32_t length, UErrorCode *pErrorCode) argument
930 utrie_unserializeDummy(UTrie *trie, void *data, int32_t length, uint32_t initialValue, uint32_t leadUnitValue, UBool make16BitTrie, UErrorCode *pErrorCode) argument
1057 utrie_enum(const UTrie *trie, UTrieEnumValue *enumValue, UTrieEnumRange *enumRange, const void *context) argument
[all...]
H A Dutrie2.cpp16 * This is a common implementation of a Unicode trie.
19 * This is the second common version of a Unicode trie (hence the name UTrie2).
41 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { argument
44 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) {
45 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY];
52 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
55 block=trie->index2[i2];
56 return trie->data[block+(c&UTRIE2_DATA_MASK)];
60 utrie2_get32(const UTrie2 *trie, UChar3 argument
73 utrie2_get32FromLeadSurrogateCodeUnit(const UTrie2 *trie, UChar32 c) argument
87 u8Index(const UTrie2 *trie, UChar32 c, int32_t i) argument
97 utrie2_internalU8NextIndex(const UTrie2 *trie, UChar32 c, const uint8_t *src, const uint8_t *limit) argument
112 utrie2_internalU8PrevIndex(const UTrie2 *trie, UChar32 c, const uint8_t *start, const uint8_t *src) argument
136 UTrie2 *trie; local
238 UTrie2 *trie; local
367 utrie2_close(UTrie2 *trie) argument
407 UTrie2Header trie; local
516 enumEitherTrie(const UTrie2 *trie, UChar32 start, UChar32 limit, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
694 utrie2_enum(const UTrie2 *trie, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
700 utrie2_enumForLeadSurrogate(const UTrie2 *trie, UChar32 lead, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
[all...]
H A Dutrie2_builder.cpp16 * 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,
237 UNewTrie2 *trie; local
279 UTrie2 *trie; local
322 UTrie2 *trie; member in struct:NewTrieAndStatus
347 utrie_printLengths(const UTrie *trie) argument
356 utrie2_printLengths(const UTrie2 *trie, const char *which) argument
459 isInNullBlock(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
474 allocIndex2Block(UNewTrie2 *trie) argument
493 getIndex2Block(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
513 allocDataBlock(UNewTrie2 *trie, int32_t copyBlock) argument
559 releaseDataBlock(UNewTrie2 *trie, int32_t block) argument
566 isWritableBlock(UNewTrie2 *trie, int32_t block) argument
571 setIndex2Entry(UNewTrie2 *trie, int32_t i2, int32_t block) argument
588 getDataBlock(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
616 set32(UNewTrie2 *trie, UChar32 c, UBool forLSCP, uint32_t value, UErrorCode *pErrorCode) argument
636 utrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode) argument
648 utrie2_set32ForLeadSurrogateCodeUnit(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode) argument
695 utrie2_setRange32(UTrie2 *trie, UChar32 start, UChar32 end, uint32_t value, UBool overwrite, UErrorCode *pErrorCode) argument
899 findHighStart(UNewTrie2 *trie, uint32_t highValue) argument
985 compactData(UNewTrie2 *trie) argument
1092 compactIndex2(UNewTrie2 *trie) argument
1174 compactTrie(UTrie2 *trie, UErrorCode *pErrorCode) argument
1251 utrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode) argument
1421 utrie2_isFrozen(const UTrie2 *trie) argument
1426 utrie2_serialize(UTrie2 *trie, void *data, int32_t capacity, UErrorCode *pErrorCode) argument
[all...]
H A Dutrie2.h34 * This is a common implementation of a Unicode trie.
38 * This is the second common version of a Unicode trie (hence the name UTrie2).
80 * Open a frozen trie from its serialized from, stored in 32-bit-aligned memory.
82 * The memory must remain valid and unchanged as long as the trie is used.
83 * You must utrie2_close() the trie once you are done using it.
90 * @param pActualLength receives the actual number of bytes at data taken up by the trie data;
93 * @return the unserialized trie
104 * Open a frozen, empty "dummy" trie.
105 * A dummy trie is an empty trie, use
635 const UTrie2 *trie; member in class:UTrie2StringIterator
[all...]
H A Ducol_swp.cpp29 * 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
[all...]
/external/chromium_org/third_party/icu/source/test/intltest/
H A Ducharstrietest.cpp69 void checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
70 void checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
71 void checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
72 void checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
73 void checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
296 LocalPointer<UCharsTrie> trie(buildTrie(data, LENGTHOF(data), USTRINGTRIE_BUILD_FAST));
297 if(trie.isNull()) {
301 if( (result=trie->nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() ||
302 (result=trie
818 checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
856 checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
930 checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
990 checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
1008 checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
[all...]
H A Dbytestrietest.cpp62 void checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
63 void checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
64 void checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
65 void checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
66 void checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
307 LocalPointer<BytesTrie> trie(buildMonthsTrie(USTRINGTRIE_BUILD_FAST));
308 if(trie.isNull()) {
312 if(trie->hasUniqueValue(uniqueValue)) {
315 trie->next('j');
316 trie
656 checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
678 checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
758 checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
818 checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
835 checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
[all...]
/external/icu/icu4c/source/test/intltest/
H A Ducharstrietest.cpp69 void checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
70 void checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
71 void checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
72 void checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
73 void checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
296 LocalPointer<UCharsTrie> trie(buildTrie(data, LENGTHOF(data), USTRINGTRIE_BUILD_FAST));
297 if(trie.isNull()) {
301 if( (result=trie->nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() ||
302 (result=trie
818 checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
856 checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
930 checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
990 checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
1008 checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
[all...]
H A Dbytestrietest.cpp62 void checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
63 void checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
64 void checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
65 void checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
66 void checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
307 LocalPointer<BytesTrie> trie(buildMonthsTrie(USTRINGTRIE_BUILD_FAST));
308 if(trie.isNull()) {
312 if(trie->hasUniqueValue(uniqueValue)) {
315 trie->next('j');
316 trie
656 checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
678 checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
758 checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
818 checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
835 checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
[all...]
/external/chromium_org/third_party/libaddressinput/chromium/
H A Dtrie_unittest.cc5 #include "third_party/libaddressinput/chromium/trie.h"
26 Trie<std::string> trie; local
28 trie.FindDataForKeyPrefix(ToByteArray("key"), &result);
33 Trie<std::string> trie; local
34 trie.AddDataForKey(ToByteArray("hello"), "world");
36 trie.FindDataForKeyPrefix(ToByteArray("hello"), &result);
43 Trie<std::string> trie; local
44 trie.AddDataForKey(ToByteArray("hello"), "world");
46 trie.FindDataForKeyPrefix(ToByteArray("he"), &result);
53 Trie<std::string> trie; local
61 Trie<std::string> trie; local
74 Trie<std::string> trie; local
87 Trie<std::string> trie; local
99 Trie<std::string> trie; local
[all...]
/external/chromium_org/third_party/icu/source/test/perf/unisetperf/draft/
H A Dtrieset.cpp16 * 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
109 UTrie trie; member in class:TrieSet
[all...]
/external/icu/icu4c/source/test/perf/unisetperf/draft/
H A Dtrieset.cpp16 * 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
109 UTrie trie; member in class:TrieSet
[all...]
/external/chromium_org/third_party/icu/source/test/cintltst/
H A Dtrie2test.c98 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, star
97 testTrieEnum(const char *testName, const UTrie2 *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
110 testTrieGetters(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
269 testTrieUTF16(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
349 testTrieUTF8(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
485 testFrozenTrie(const char *testName, UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
534 testNewTrie(const char *testName, const UTrie2 *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
542 testTrieSerialize(const char *testName, UTrie2 *trie, UTrie2ValueBits valueBits, UBool withSwap, const CheckRange checkRanges[], int32_t countCheckRanges) argument
751 testTrieSerializeAllValueBits(const char *testName, UTrie2 *trie, UBool withClone, const CheckRange checkRanges[], int32_t countCheckRanges) argument
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...]
H A Dtrietest.c56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { argument
65 value=utrie_get32(trie, start, &inBlockZero);
87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { argument
96 value=utrie_get32(trie, start, &inBlockZero);
142 const UTrie *trie,
171 if(trie->data32!=NULL) {
172 UTRIE_NEXT32(trie, p, limit, c, c2, value);
174 UTRIE_NEXT16(trie, p, limit, c, c2, value);
192 if(trie->data32==NULL) {
193 value=UTRIE_GET16_FROM_LEAD(trie,
141 testTrieIteration(const char *testName, const UTrie *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
263 UTrie trie={ 0 }; local
457 UTrie trie={ 0 }; local
825 UTrie trie; local
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dtrie2test.c98 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, star
97 testTrieEnum(const char *testName, const UTrie2 *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
110 testTrieGetters(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
269 testTrieUTF16(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
349 testTrieUTF8(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
485 testFrozenTrie(const char *testName, UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
534 testNewTrie(const char *testName, const UTrie2 *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
542 testTrieSerialize(const char *testName, UTrie2 *trie, UTrie2ValueBits valueBits, UBool withSwap, const CheckRange checkRanges[], int32_t countCheckRanges) argument
751 testTrieSerializeAllValueBits(const char *testName, UTrie2 *trie, UBool withClone, const CheckRange checkRanges[], int32_t countCheckRanges) argument
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...]
H A Dtrietest.c56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { argument
65 value=utrie_get32(trie, start, &inBlockZero);
87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { argument
96 value=utrie_get32(trie, start, &inBlockZero);
142 const UTrie *trie,
171 if(trie->data32!=NULL) {
172 UTRIE_NEXT32(trie, p, limit, c, c2, value);
174 UTRIE_NEXT16(trie, p, limit, c, c2, value);
192 if(trie->data32==NULL) {
193 value=UTRIE_GET16_FROM_LEAD(trie,
141 testTrieIteration(const char *testName, const UTrie *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
263 UTrie trie={ 0 }; local
457 UTrie trie={ 0 }; local
825 UTrie trie; local
[all...]
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/layout_package/
H A Djson_results_generator.py63 def convert_trie_to_flat_paths(trie, prefix=None):
64 """Converts the directory structure in the given trie to flat paths, prepending a prefix to each."""
66 for name, data in trie.iteritems():
78 def add_path_to_trie(path, value, trie):
79 """Inserts a single flat directory path and associated value into a directory trie structure."""
81 trie[path] = value
85 if not directory in trie:
86 trie[directory] = {}
87 add_path_to_trie(rest, value, trie[directory])
103 trie
[all...]
H A Djson_results_generator_unittest.py59 def _find_test_in_trie(self, path, trie):
61 sub_trie = trie
71 trie = json_results_generator.test_timings_trie(individual_test_timings)
82 self.assertEqual(json.dumps(trie), json.dumps(expected_trie))
/external/chromium_org/third_party/icu/source/i18n/
H A Duspoof_wsconf.h44 UTrie2 *trie; // Any-case or Lower-case Trie. member in class:BuilderScriptSet

Completed in 1823 milliseconds

1234