| /external/icu4c/test/cintltst/ |
| 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...] |
| 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/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/marisa-trie/lib/ |
| Makefile.am | 15 marisa/trie.cc \
16 marisa/trie-build.cc \
17 marisa/trie-search.cc \
18 marisa/trie-c.cc
43 marisa/trie.h \
44 marisa/trie-inline.h
|
| Makefile.in | 77 trie.$(OBJEXT) trie-build.$(OBJEXT) trie-search.$(OBJEXT) \
78 trie-c.$(OBJEXT)
199 marisa/trie.cc \
200 marisa/trie-build.cc \
201 marisa/trie-search.cc \
202 marisa/trie-c.cc
226 marisa/trie.h \
227 marisa/trie-inline.
[all...] |
| /external/marisa-trie/v0_1_5/lib/ |
| Makefile.am | 16 marisa_alpha/trie.cc \
17 marisa_alpha/trie-build.cc \
18 marisa_alpha/trie-search.cc \
19 marisa_alpha/trie-c.cc
44 marisa_alpha/trie.h \
45 marisa_alpha/trie-inline.h
|
| /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...] |
| README.android | 1 URL: http://marisa-trie.googlecode.com/files/marisa-0.1.4.tar.gz
9 space-efficient trie data structure.
12 Homepage: http://code.google.com/p/marisa-trie/
|
| android_diff.txt | 22 LOCAL_MODULE := libmarisa-trie
56 + __android_log_write(ANDROID_LOG_ERROR, "marisa-trie", tmpbuf);
84 diff --git a/lib/marisa/trie-build.cc b/lib/marisa/trie-build.cc
86 --- a/lib/marisa/trie-build.cc
87 +++ b/lib/marisa/trie-build.cc
88 @@ -63,15 +63,9 @@ void Trie::build_trie(Vector<Key<String> > &keys,
106 void Trie::build_trie(Vector<Key<String> > &keys,
107 @@ -168,7 +162,7 @@ void Trie::build_trie(Vector<Key<T> > &keys,
110 void Trie::build_cur(Vector<Key<T> > &keys
[all...] |
| /external/marisa-trie/lib/marisa/ |
| trie-inline.h | 10 inline std::string Trie::operator[](UInt32 key_id) const {
16 inline UInt32 Trie::operator[](const char *str) const {
20 inline UInt32 Trie::operator[](const std::string &str) const {
24 inline UInt32 Trie::lookup(const std::string &str) const {
28 inline std::size_t Trie::find(const std::string &str,
35 inline std::size_t Trie::find(const std::string &str,
42 inline UInt32 Trie::find_first(const std::string &str,
47 inline UInt32 Trie::find_last(const std::string &str,
53 inline std::size_t Trie::find_callback(const char *str,
61 inline std::size_t Trie::find_callback(const char *ptr, std::size_t length
[all...] |
| trie-search.cc | 4 #include "trie.h"
42 std::string Trie::restore(UInt32 key_id) const {
50 void Trie::restore(UInt32 key_id, std::string *key) const {
57 std::size_t Trie::restore(UInt32 key_id, char *key_buf,
66 UInt32 Trie::lookup(const char *str) const {
72 UInt32 Trie::lookup(const char *ptr, std::size_t length) const {
78 std::size_t Trie::find(const char *str,
87 std::size_t Trie::find(const char *ptr, std::size_t length,
96 std::size_t Trie::find(const char *str,
105 std::size_t Trie::find(const char *ptr, std::size_t length
[all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| trie-inline.h | 10 inline std::string Trie::operator[](UInt32 key_id) const {
16 inline UInt32 Trie::operator[](const char *str) const {
20 inline UInt32 Trie::operator[](const std::string &str) const {
24 inline UInt32 Trie::lookup(const std::string &str) const {
28 inline std::size_t Trie::find(const std::string &str,
35 inline std::size_t Trie::find(const std::string &str,
42 inline UInt32 Trie::find_first(const std::string &str,
47 inline UInt32 Trie::find_last(const std::string &str,
53 inline std::size_t Trie::find_callback(const char *str,
61 inline std::size_t Trie::find_callback(const char *ptr, std::size_t length
[all...] |
| 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...] |
| trie-search.cc | 4 #include "trie.h"
42 std::string Trie::restore(UInt32 key_id) const {
50 void Trie::restore(UInt32 key_id, std::string *key) const {
57 std::size_t Trie::restore(UInt32 key_id, char *key_buf,
66 UInt32 Trie::lookup(const char *str) const {
72 UInt32 Trie::lookup(const char *ptr, std::size_t length) const {
79 std::size_t Trie::find(const char *str,
88 std::size_t Trie::find(const char *ptr, std::size_t length,
98 std::size_t Trie::find(const char *str,
107 std::size_t Trie::find(const char *ptr, std::size_t length
[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...] |
| marisa-benchmark.cc | 50 " -P, --patricia-trie build patricia tries (default)\n"
51 " -p, --prefix-trie build prefix tries\n"
71 std::cout << "trie: patricia" << std::endl;
75 std::cout << "trie: prefix" << std::endl;
174 marisa::Trie *trie, std::vector<marisa::UInt32> *key_ids) {
176 trie->build(keys, key_ids, num_tries
178 std::printf(" %9lu", (unsigned long)trie->num_nodes());
179 std::printf(" %9lu", (unsigned long)trie->total_size());
183 void benchmark_restore(const marisa::Trie &trie
273 marisa::Trie trie; local
[all...] |
| marisa-lookup.cc | 33 marisa::Trie trie; local
37 trie.mmap(&mapper, args[0]);
45 trie.load(args[0]);
55 const marisa::UInt32 key_id = trie.lookup(str);
56 if (key_id != trie.notfound()) {
|
| marisa-build.cc | 28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
77 marisa::Trie trie; local
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
90 std::cerr << "size: " << trie.total_size() << std::endl;
94 trie.save(output_filename)
[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...] |
| marisa_alpha-benchmark.cc | 50 " -P, --patricia-trie build patricia tries (default)\n"
51 " -p, --prefix-trie build prefix tries\n"
71 std::cout << "trie: patricia" << std::endl;
75 std::cout << "trie: prefix" << std::endl;
174 marisa_alpha::Trie *trie, std::vector<marisa_alpha::UInt32> *key_ids) {
176 trie->build(keys, key_ids, num_tries
178 std::printf(" %9lu", (unsigned long)trie->num_nodes());
179 std::printf(" %9lu", (unsigned long)trie->total_size());
183 void benchmark_restore(const marisa_alpha::Trie &trie
273 marisa_alpha::Trie trie; local
[all...] |
| marisa_alpha-lookup.cc | 33 marisa_alpha::Trie trie; local
37 trie.mmap(&mapper, args[0]);
45 trie.load(args[0]);
55 const marisa_alpha::UInt32 key_id = trie.lookup(str);
56 if (key_id != trie.notfound()) {
|
| marisa_alpha-build.cc | 28 " -P, --patricia-trie build patricia tries (default)\n"
29 " -p, --prefix-trie build prefix tries\n"
77 marisa_alpha::Trie trie; local
79 trie.build(keys, NULL, param_num_tries
87 std::cerr << "#keys: " << trie.num_keys() << std::endl;
88 std::cerr << "#tries: " << trie.num_tries() << std::endl;
89 std::cerr << "#nodes: " << trie.num_nodes() << std::endl;
90 std::cerr << "size: " << trie.total_size() << std::endl;
94 trie.save(output_filename)
[all...] |
| /external/marisa-trie/tests/ |
| Makefile.am | 9 trie-test \
28 trie_test_SOURCES = trie-test.cc
|
| /external/marisa-trie/v0_1_5/tests/ |
| Makefile.am | 9 trie-test \
28 trie_test_SOURCES = trie-test.cc
|
| /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
|
