/external/icu/icu4c/source/common/ |
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). 41 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { 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, UChar32 c) 136 UTrie2 *trie; local 238 UTrie2 *trie; local 436 UTrie2Header trie; local [all...] |
utrie.h | 29 * This is a common implementation of a "folded" trie. 50 * Trie constants, defining shift widths, index array lengths, etc. 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 143 * Run-time Trie structure. 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) [all...] |
utrie.cpp | 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.h | 34 * This is a common implementation of a Unicode trie. 38 * This is the second common version of a Unicode trie (hence the name UTrie2). 58 * Trie structure. 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, used when a real data trie canno 635 const UTrie2 *trie; member in class:UTrie2StringIterator [all...] |
utrie2_builder.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). 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...] |
/external/chromium_org/third_party/icu/source/common/ |
utrie.h | 29 * This is a common implementation of a "folded" trie. 50 * Trie constants, defining shift widths, index array lengths, etc. 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 143 * Run-time Trie structure. 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) [all...] |
utrie.cpp | 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). 41 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { 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, UChar32 c) 136 UTrie2 *trie; local 238 UTrie2 *trie; local 407 UTrie2Header trie; local [all...] |
utrie2_builder.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). 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 | 34 * This is a common implementation of a Unicode trie. 38 * This is the second common version of a Unicode trie (hence the name UTrie2). 58 * Trie structure. 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, used when a real data trie canno 635 const UTrie2 *trie; member in class:UTrie2StringIterator [all...] |
/external/chromium_org/third_party/icu/source/test/intltest/ |
ucharstrietest.cpp | 69 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->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() | [all...] |
bytestrietest.cpp | 62 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->next('a') [all...] |
/external/icu/icu4c/source/test/intltest/ |
ucharstrietest.cpp | 69 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->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() | [all...] |
bytestrietest.cpp | 62 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->next('a') [all...] |
/external/chromium_org/third_party/libaddressinput/chromium/ |
trie_unittest.cc | 5 #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 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/ |
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/icu/icu4c/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/chromium_org/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 | 56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { 65 value=utrie_get32(trie, start, &inBlockZero); 87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { 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, c) 263 UTrie trie={ 0 }; local 457 UTrie trie={ 0 }; local 825 UTrie trie; local [all...] |
/external/icu/icu4c/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 | 56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { 65 value=utrie_get32(trie, start, &inBlockZero); 87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { 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, c) 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/ |
json_results_generator.py | 63 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...] |
json_results_generator_unittest.py | 59 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/ |
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/icu/icu4c/source/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
|