| /external/marisa-trie/v0_1_5/tests/ |
| trie-test.cc | 56 marisa_alpha::Trie trie; local
58 ASSERT(trie.num_tries() == 0);
59 ASSERT(trie.num_keys() == 0);
60 ASSERT(trie.num_nodes() == 0);
61 ASSERT(trie.total_size() == (sizeof(marisa_alpha::UInt32) * 23));
64 trie.build(keys);
65 ASSERT(trie.num_tries() == 1);
66 ASSERT(trie.num_keys() == 0);
67 ASSERT(trie.num_nodes() == 1)
192 marisa_alpha::Trie trie; local
434 marisa_alpha::Trie trie; local
532 marisa_alpha::Trie trie; local
596 marisa_alpha::Trie trie; local
[all...] |
| c-test.c | 8 marisa_alpha_trie *trie = NULL; local
12 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_OK);
13 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_HANDLE_ERROR);
14 ASSERT(marisa_alpha_end(trie) == MARISA_ALPHA_OK);
96 marisa_alpha_trie *trie = NULL; local
109 ASSERT(marisa_alpha_init(&trie) == MARISA_ALPHA_OK);
111 ASSERT(marisa_alpha_get_num_tries(trie) == 0);
112 ASSERT(marisa_alpha_get_num_keys(trie) == 0);
113 ASSERT(marisa_alpha_get_num_nodes(trie) == 0);
114 ASSERT(marisa_alpha_get_total_size(trie) =
[all...] |
| /external/marisa-trie/tests/ |
| trie-test.cc | 56 marisa::Trie trie; local
58 ASSERT(trie.num_tries() == 0);
59 ASSERT(trie.num_keys() == 0);
60 ASSERT(trie.num_nodes() == 0);
61 ASSERT(trie.total_size() == (sizeof(marisa::UInt32) * 23));
64 trie.build(keys);
65 ASSERT(trie.num_tries() == 1);
66 ASSERT(trie.num_keys() == 0);
67 ASSERT(trie.num_nodes() == 1)
190 marisa::Trie trie; local
416 marisa::Trie trie; local
514 marisa::Trie trie; local
578 marisa::Trie trie; local
[all...] |
| c-test.c | 8 marisa_trie *trie = NULL; local
12 ASSERT(marisa_init(&trie) == MARISA_OK);
13 ASSERT(marisa_init(&trie) == MARISA_HANDLE_ERROR);
14 ASSERT(marisa_end(trie) == MARISA_OK);
91 marisa_trie *trie = NULL; local
104 ASSERT(marisa_init(&trie) == MARISA_OK);
106 ASSERT(marisa_get_num_tries(trie) == 0);
107 ASSERT(marisa_get_num_keys(trie) == 0);
108 ASSERT(marisa_get_num_nodes(trie) == 0);
109 ASSERT(marisa_get_total_size(trie) == (sizeof(marisa_uint32) * 23))
[all...] |
| /external/chromium_org/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.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
234 UTrie2 *trie; local
403 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
633 const UTrie2 *trie; member in class:UTrie2StringIterator
[all...] |
| /external/icu4c/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/icu4c/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/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_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...] |
| /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...] |
| /external/marisa-trie/lib/marisa/ |
| trie-c.cc | 1 #include "trie.h"
53 marisa_trie_() : trie(), mapper() {}
55 marisa::Trie trie; member in struct:marisa_trie_
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
96 h->trie.mmap(&h->mapper, filename, offset, whence);
104 h->trie.map(ptr, size);
114 h->trie.load(filename, offset, whence);
123 h->trie.fread(file);
132 h->trie.read(fd)
[all...] |
| /external/marisa-trie/tools/ |
| marisa-find.cc | 39 void find_all(const marisa::Trie &trie, const std::string &str) {
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
56 void find_first(const marisa::Trie &trie, const std::string &str) {
58 const marisa::UInt32 key_id = trie.find_first(str, &length);
59 if (key_id != trie.notfound()) {
67 void find_last(const marisa::Trie &trie, const std::string &str) {
69 const marisa::UInt32 key_id = trie.find_last(str, &length)
88 marisa::Trie trie; local
[all...] |
| /external/marisa-trie/v0_1_5/tools/ |
| marisa_alpha-find.cc | 39 void find_all(const marisa_alpha::Trie &trie, const std::string &str) {
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths);
56 void find_first(const marisa_alpha::Trie &trie, const std::string &str) {
58 const marisa_alpha::UInt32 key_id = trie.find_first(str, &length);
59 if (key_id != trie.notfound()) {
67 void find_last(const marisa_alpha::Trie &trie, const std::string &str) {
69 const marisa_alpha::UInt32 key_id = trie.find_last(str, &length)
88 marisa_alpha::Trie trie; local
[all...] |
| /external/marisa-trie/ |
| Android.mk | 27 lib/marisa/trie.cc \
28 lib/marisa/trie-search.cc \
32 lib/marisa/trie-build.cc \
33 lib/marisa/trie-c.cc \
36 LOCAL_MODULE := libmarisa-trie-gnustl-rtti
57 v0_1_5/lib/marisa_alpha/trie-build.cc \
58 v0_1_5/lib/marisa_alpha/trie.cc \
59 v0_1_5/lib/marisa_alpha/trie-c.cc \
60 v0_1_5/lib/marisa_alpha/trie-search.cc \
63 LOCAL_MODULE := libmarisa_alpha-trie-gnustl-rtt
[all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie-c.cc | 1 #include "trie.h"
53 marisa_alpha_trie_() : trie(), mapper() {}
55 marisa_alpha::Trie trie; member in struct:marisa_alpha_trie_
86 h->trie.build(keys, num_keys, key_lengths, key_weights, key_ids, flags);
98 h->trie.mmap(&h->mapper, filename, offset, whence);
109 h->trie.map(ptr, size);
121 h->trie.load(filename, offset, whence);
132 h->trie.fread(file);
143 h->trie.read(fd)
[all...] |
