Home
last modified time | relevance | path

Searched refs:trie (Results 1 – 25 of 109) sorted by relevance

12345

/external/marisa-trie/tests/
Dtrie-test.cc56 marisa::Trie trie; in TestTrie() local
58 ASSERT(trie.num_tries() == 0); in TestTrie()
59 ASSERT(trie.num_keys() == 0); in TestTrie()
60 ASSERT(trie.num_nodes() == 0); in TestTrie()
61 ASSERT(trie.total_size() == (sizeof(marisa::UInt32) * 23)); in TestTrie()
64 trie.build(keys); in TestTrie()
65 ASSERT(trie.num_tries() == 1); in TestTrie()
66 ASSERT(trie.num_keys() == 0); in TestTrie()
67 ASSERT(trie.num_nodes() == 1); in TestTrie()
76 trie.build(keys, &key_ids, 1 | MARISA_WITHOUT_TAIL | MARISA_LABEL_ORDER); in TestTrie()
[all …]
Dc-test.c8 marisa_trie *trie = NULL; in TestHandle() local
12 ASSERT(marisa_init(&trie) == MARISA_OK); in TestHandle()
13 ASSERT(marisa_init(&trie) == MARISA_HANDLE_ERROR); in TestHandle()
14 ASSERT(marisa_end(trie) == MARISA_OK); in TestHandle()
91 marisa_trie *trie = NULL; in TestTrie() local
104 ASSERT(marisa_init(&trie) == MARISA_OK); in TestTrie()
106 ASSERT(marisa_get_num_tries(trie) == 0); in TestTrie()
107 ASSERT(marisa_get_num_keys(trie) == 0); in TestTrie()
108 ASSERT(marisa_get_num_nodes(trie) == 0); in TestTrie()
109 ASSERT(marisa_get_total_size(trie) == (sizeof(marisa_uint32) * 23)); in TestTrie()
[all …]
/external/marisa-trie/v0_1_5/tests/
Dtrie-test.cc56 marisa_alpha::Trie trie; in TestTrie() local
58 ASSERT(trie.num_tries() == 0); in TestTrie()
59 ASSERT(trie.num_keys() == 0); in TestTrie()
60 ASSERT(trie.num_nodes() == 0); in TestTrie()
61 ASSERT(trie.total_size() == (sizeof(marisa_alpha::UInt32) * 23)); in TestTrie()
64 trie.build(keys); in TestTrie()
65 ASSERT(trie.num_tries() == 1); in TestTrie()
66 ASSERT(trie.num_keys() == 0); in TestTrie()
67 ASSERT(trie.num_nodes() == 1); in TestTrie()
76 trie.build(keys, &key_ids, in TestTrie()
[all …]
Dc-test.c8 marisa_alpha_trie *trie = NULL; in TestHandle() local
12 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_OK); in TestHandle()
13 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_HANDLE_ERROR); in TestHandle()
14 ASSERT(marisa_alpha_end(trie) == MARISA_ALPHA_OK); in TestHandle()
96 marisa_alpha_trie *trie = NULL; in TestTrie() local
109 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_OK); in TestTrie()
111 ASSERT(marisa_alpha_get_num_tries(trie) == 0); in TestTrie()
112 ASSERT(marisa_alpha_get_num_keys(trie) == 0); in TestTrie()
113 ASSERT(marisa_alpha_get_num_nodes(trie) == 0); in TestTrie()
114 ASSERT(marisa_alpha_get_total_size(trie) == in TestTrie()
[all …]
/external/chromium_org/third_party/icu/source/common/
Dutrie2_builder.c106 allocIndex2Block(UNewTrie2 *trie);
110 UTrie2 *trie; in utrie2_open() local
119 trie=(UTrie2 *)uprv_malloc(sizeof(UTrie2)); in utrie2_open()
122 if(trie==NULL || newTrie==NULL || data==NULL) { in utrie2_open()
123 uprv_free(trie); in utrie2_open()
130 uprv_memset(trie, 0, sizeof(UTrie2)); in utrie2_open()
131 trie->initialValue=initialValue; in utrie2_open()
132 trie->errorValue=errorValue; in utrie2_open()
133 trie->highStart=0x110000; in utrie2_open()
134 trie->newTrie=newTrie; in utrie2_open()
[all …]
Dutrie.c51 UNewTrie *trie; in utrie_open() local
61 trie=fillIn; in utrie_open()
63 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie)); in utrie_open()
64 if(trie==NULL) { in utrie_open()
68 uprv_memset(trie, 0, sizeof(UNewTrie)); in utrie_open()
69 trie->isAllocated= (UBool)(fillIn==NULL); in utrie_open()
72 trie->data=aliasData; in utrie_open()
73 trie->isDataAllocated=FALSE; in utrie_open()
75 trie->data=(uint32_t *)uprv_malloc(maxDataLength*4); in utrie_open()
76 if(trie->data==NULL) { in utrie_open()
[all …]
Dutrie2.cpp37 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { in get32() argument
40 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) { in get32()
41 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY]; in get32()
48 i2=trie->index1[c>>UTRIE2_SHIFT_1]+ in get32()
51 block=trie->index2[i2]; in get32()
52 return trie->data[block+(c&UTRIE2_DATA_MASK)]; in get32()
56 utrie2_get32(const UTrie2 *trie, UChar32 c) { in utrie2_get32() argument
57 if(trie->data16!=NULL) { in utrie2_get32()
58 return UTRIE2_GET16(trie, c); in utrie2_get32()
59 } else if(trie->data32!=NULL) { in utrie2_get32()
[all …]
Dutrie.h176 #define _UTRIE_GET_RAW(trie, data, offset, c16) \ argument
177 (trie)->data[ \
178 ((int32_t)((trie)->index[(offset)+((c16)>>UTRIE_SHIFT)])<<UTRIE_INDEX_SHIFT)+ \
183 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) { \ argument
187 (result)=_UTRIE_GET_RAW((trie), data, 0, (c)); \
188 __offset=(trie)->getFoldingOffset(result); \
192 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
194 (result)=(resultType)((trie)->initialValue); \
199 #define _UTRIE_GET_FROM_BMP(trie, data, c16) \ argument
200 _UTRIE_GET_RAW(trie, data, 0xd800<=(c16) && (c16)<=0xdbff ? UTRIE_LEAD_INDEX_DISP : 0, c16);
[all …]
Dutrie2.h139 utrie2_get32(const UTrie2 *trie, UChar32 c);
189 utrie2_enum(const UTrie2 *trie,
237 utrie2_close(UTrie2 *trie);
249 utrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode);
265 utrie2_setRange32(UTrie2 *trie,
290 utrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode);
300 utrie2_isFrozen(const UTrie2 *trie);
321 utrie2_serialize(UTrie2 *trie,
389 #define UTRIE2_GET16(trie, c) _UTRIE2_GET((trie), index, (trie)->indexLength, (c)) argument
399 #define UTRIE2_GET32(trie, c) _UTRIE2_GET((trie), data32, 0, (c)) argument
[all …]
/external/icu4c/common/
Dutrie2_builder.cpp106 allocIndex2Block(UNewTrie2 *trie);
110 UTrie2 *trie; in utrie2_open() local
119 trie=(UTrie2 *)uprv_malloc(sizeof(UTrie2)); in utrie2_open()
122 if(trie==NULL || newTrie==NULL || data==NULL) { in utrie2_open()
123 uprv_free(trie); in utrie2_open()
130 uprv_memset(trie, 0, sizeof(UTrie2)); in utrie2_open()
131 trie->initialValue=initialValue; in utrie2_open()
132 trie->errorValue=errorValue; in utrie2_open()
133 trie->highStart=0x110000; in utrie2_open()
134 trie->newTrie=newTrie; in utrie2_open()
[all …]
Dutrie.cpp51 UNewTrie *trie; in utrie_open() local
61 trie=fillIn; in utrie_open()
63 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie)); in utrie_open()
64 if(trie==NULL) { in utrie_open()
68 uprv_memset(trie, 0, sizeof(UNewTrie)); in utrie_open()
69 trie->isAllocated= (UBool)(fillIn==NULL); in utrie_open()
72 trie->data=aliasData; in utrie_open()
73 trie->isDataAllocated=FALSE; in utrie_open()
75 trie->data=(uint32_t *)uprv_malloc(maxDataLength*4); in utrie_open()
76 if(trie->data==NULL) { in utrie_open()
[all …]
Dutrie2.cpp41 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { in get32() argument
44 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) { in get32()
45 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY]; in get32()
52 i2=trie->index1[c>>UTRIE2_SHIFT_1]+ in get32()
55 block=trie->index2[i2]; in get32()
56 return trie->data[block+(c&UTRIE2_DATA_MASK)]; in get32()
60 utrie2_get32(const UTrie2 *trie, UChar32 c) { in utrie2_get32() argument
61 if(trie->data16!=NULL) { in utrie2_get32()
62 return UTRIE2_GET16(trie, c); in utrie2_get32()
63 } else if(trie->data32!=NULL) { in utrie2_get32()
[all …]
Dutrie.h177 #define _UTRIE_GET_RAW(trie, data, offset, c16) \ argument
178 (trie)->data[ \
179 ((int32_t)((trie)->index[(offset)+((c16)>>UTRIE_SHIFT)])<<UTRIE_INDEX_SHIFT)+ \
184 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) { \ argument
188 (result)=_UTRIE_GET_RAW((trie), data, 0, (c)); \
189 __offset=(trie)->getFoldingOffset(result); \
193 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
195 (result)=(resultType)((trie)->initialValue); \
200 #define _UTRIE_GET_FROM_BMP(trie, data, c16) \ argument
201 _UTRIE_GET_RAW(trie, data, 0xd800<=(c16) && (c16)<=0xdbff ? UTRIE_LEAD_INDEX_DISP : 0, c16);
[all …]
Dutrie2.h140 utrie2_get32(const UTrie2 *trie, UChar32 c);
190 utrie2_enum(const UTrie2 *trie,
238 utrie2_close(UTrie2 *trie);
250 utrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode);
266 utrie2_setRange32(UTrie2 *trie,
291 utrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode);
301 utrie2_isFrozen(const UTrie2 *trie);
322 utrie2_serialize(UTrie2 *trie,
390 #define UTRIE2_GET16(trie, c) _UTRIE2_GET((trie), index, (trie)->indexLength, (c)) argument
400 #define UTRIE2_GET32(trie, c) _UTRIE2_GET((trie), data32, 0, (c)) argument
[all …]
/external/icu4c/test/intltest/
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)); in TestNextForCodePoint() local
297 if(trie.isNull()) { in TestNextForCodePoint()
301 if( (result=trie->nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()
302 (result=trie->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()
303 (result=trie->nextForCodePoint(0x9999))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint()
[all …]
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)); in TestHasUniqueValue() local
308 if(trie.isNull()) { in TestHasUniqueValue()
312 if(trie->hasUniqueValue(uniqueValue)) { in TestHasUniqueValue()
315 trie->next('j'); in TestHasUniqueValue()
316 trie->next('a'); in TestHasUniqueValue()
[all …]
/external/chromium_org/third_party/icu/source/test/cintltst/
Dtrie2test.c98 const UTrie2 *trie, in testTrieEnum() argument
105 utrie2_enum(trie, testEnumValue, testEnumRange, &checkRanges); in testTrieEnum()
111 const UTrie2 *trie, UTrie2ValueBits valueBits, in testTrieGetters() argument
118 UBool isFrozen=utrie2_isFrozen(trie); in testTrieGetters()
133 value2=UTRIE2_GET16_FROM_U16_SINGLE_LEAD(trie, start); in testTrieGetters()
135 value2=UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, start); in testTrieGetters()
144 value2=UTRIE2_GET16_FROM_SUPP(trie, start); in testTrieGetters()
146 value2=UTRIE2_GET32_FROM_SUPP(trie, start); in testTrieGetters()
154 value2=UTRIE2_GET16(trie, start); in testTrieGetters()
156 value2=UTRIE2_GET32(trie, start); in testTrieGetters()
[all …]
Dtrietest.c55 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { in _testFoldedValue32() argument
64 value=utrie_get32(trie, start, &inBlockZero); in _testFoldedValue32()
86 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { in _testFoldedValue16() argument
95 value=utrie_get32(trie, start, &inBlockZero); in _testFoldedValue16()
141 const UTrie *trie, in testTrieIteration() argument
170 if(trie->data32!=NULL) { in testTrieIteration()
171 UTRIE_NEXT32(trie, p, limit, c, c2, value); in testTrieIteration()
173 UTRIE_NEXT16(trie, p, limit, c, c2, value); in testTrieIteration()
191 if(trie->data32==NULL) { in testTrieIteration()
192 value=UTRIE_GET16_FROM_LEAD(trie, c); in testTrieIteration()
[all …]
/external/icu4c/test/cintltst/
Dtrie2test.c98 const UTrie2 *trie, in testTrieEnum() argument
105 utrie2_enum(trie, testEnumValue, testEnumRange, &checkRanges); in testTrieEnum()
111 const UTrie2 *trie, UTrie2ValueBits valueBits, in testTrieGetters() argument
118 UBool isFrozen=utrie2_isFrozen(trie); in testTrieGetters()
133 value2=UTRIE2_GET16_FROM_U16_SINGLE_LEAD(trie, start); in testTrieGetters()
135 value2=UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, start); in testTrieGetters()
144 value2=UTRIE2_GET16_FROM_SUPP(trie, start); in testTrieGetters()
146 value2=UTRIE2_GET32_FROM_SUPP(trie, start); in testTrieGetters()
154 value2=UTRIE2_GET16(trie, start); in testTrieGetters()
156 value2=UTRIE2_GET32(trie, start); in testTrieGetters()
[all …]
Dtrietest.c56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { in _testFoldedValue32() argument
65 value=utrie_get32(trie, start, &inBlockZero); in _testFoldedValue32()
87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { in _testFoldedValue16() argument
96 value=utrie_get32(trie, start, &inBlockZero); in _testFoldedValue16()
142 const UTrie *trie, in testTrieIteration() argument
171 if(trie->data32!=NULL) { in testTrieIteration()
172 UTRIE_NEXT32(trie, p, limit, c, c2, value); in testTrieIteration()
174 UTRIE_NEXT16(trie, p, limit, c, c2, value); in testTrieIteration()
192 if(trie->data32==NULL) { in testTrieIteration()
193 value=UTRIE_GET16_FROM_LEAD(trie, c); in testTrieIteration()
[all …]
/external/marisa-trie/lib/marisa/
Dtrie-c.cc53 marisa_trie_() : trie(), mapper() {} in marisa_trie_()
55 marisa::Trie trie; member
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags); in marisa_build()
96 h->trie.mmap(&h->mapper, filename, offset, whence); in marisa_mmap()
104 h->trie.map(ptr, size); in marisa_map()
114 h->trie.load(filename, offset, whence); in marisa_load()
123 h->trie.fread(file); in marisa_fread()
132 h->trie.read(fd); in marisa_read()
142 h->trie.save(filename, trunc_flag != 0, offset, whence); in marisa_save()
150 h->trie.fwrite(file); in marisa_fwrite()
[all …]
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
Dtrie-c.cc53 marisa_alpha_trie_() : trie(), mapper() {} in marisa_alpha_trie_()
55 marisa_alpha::Trie trie; member
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags); in marisa_alpha_build()
98 h->trie.mmap(&h->mapper, filename, offset, whence); in marisa_alpha_mmap()
109 h->trie.map(ptr, size); in marisa_alpha_map()
121 h->trie.load(filename, offset, whence); in marisa_alpha_load()
132 h->trie.fread(file); in marisa_alpha_fread()
143 h->trie.read(fd); in marisa_alpha_read()
155 h->trie.save(filename, trunc_flag != 0, offset, whence); in marisa_alpha_save()
166 h->trie.fwrite(file); in marisa_alpha_fwrite()
[all …]
/external/icu4c/test/perf/unisetperf/draft/
Dtrieset.cpp23 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH) argument
25 #define UTRIE_GET8_FROM_LEAD(trie, c16) \ argument
26 ((const uint8_t *)(trie)->data32)[ \
27 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
77 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie! in TrieSet()
82 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT), in TrieSet()
83 trie.index+UTRIE_BMP_INDEX_LENGTH, in TrieSet()
85 latin1=UTRIE_GET8_LATIN1(&trie); in TrieSet()
100 return (UBool)UTRIE_GET8_FROM_LEAD(&trie, c); in contains()
109 UTrie trie; member in TrieSet
/external/chromium_org/third_party/icu/source/test/perf/unisetperf/draft/
Dtrieset.cpp23 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH) argument
25 #define UTRIE_GET8_FROM_LEAD(trie, c16) \ argument
26 ((const uint8_t *)(trie)->data32)[ \
27 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
77 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie! in TrieSet()
82 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT), in TrieSet()
83 trie.index+UTRIE_BMP_INDEX_LENGTH, in TrieSet()
85 latin1=UTRIE_GET8_LATIN1(&trie); in TrieSet()
100 return (UBool)UTRIE_GET8_FROM_LEAD(&trie, c); in contains()
109 UTrie trie; member in TrieSet
/external/marisa-trie/
DREADME3 marisa-trie
4 http://code.google.com/p/marisa-trie/
16 …trie* provides a C++ library *libmarisa* and command line tools *`marisa-*`* for building and oper…
21 …ge of *marisa-trie* is that it can build a considerably compact dictionary. See below for the size…
30 || darts-clone || 316,065,792 || Compacted double-array trie ||
31 || tx-trie || 107,119,864 || LOUDS-based trie ||
32 || *marisa-trie* || *42,688,271* || Nesting patricia trie ||

12345