/external/icu4c/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/icu4c/common/ |
propsvec.h | 154 * vectors array, and freeze the trie. 160 UTrie2 *trie; member in struct:UPVecToUTrie2Context 167 /* context=UPVecToUTrie2Context, creates the trie and stores the rowIndex values */
|
ucol_swp.cpp | 29 * 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.indexLength<UTRIE_BMP_INDEX_LENGTH | [all...] |
ubidi_props.c | 36 UTrie2 trie; member in struct:UBiDiProps 73 /* add the start code point of each same-value range of the trie */ 74 utrie2_enum(&bdp->trie, NULL, _enumPropertyStartsRange, sa); 131 uint16_t props=UTRIE2_GET16(&bdp->trie, c); 137 uint16_t props=UTRIE2_GET16(&bdp->trie, c); 143 uint16_t props=UTRIE2_GET16(&bdp->trie, c); 176 uint16_t props=UTRIE2_GET16(&bdp->trie, c); 182 uint16_t props=UTRIE2_GET16(&bdp->trie, c); 188 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
|
/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/marisa-trie/lib/marisa/ |
progress.h | 41 int trie() const { function in class:marisa::Progress
|
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/tests/ |
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...] |
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...] |
/external/marisa-trie/tools/ |
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-predict.cc | 42 marisa::Trie trie; local 46 trie.mmap(&mapper, args[0]); 54 trie.load(args[0]); 66 std::size_t num_keys = trie.predict(str); 73 num_keys = trie.predict_depth_first( 76 num_keys = trie.predict_breadth_first(
|
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...] |
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/lib/marisa_alpha/ |
progress.h | 41 int trie() const { function in class:marisa_alpha::Progress
|
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...] |
/external/marisa-trie/v0_1_5/tests/ |
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...] |
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...] |
/external/marisa-trie/v0_1_5/tools/ |
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-predict.cc | 42 marisa_alpha::Trie trie; local 46 trie.mmap(&mapper, args[0]); 54 trie.load(args[0]); 66 std::size_t num_keys = trie.predict(str); 73 num_keys = trie.predict_depth_first( 76 num_keys = trie.predict_breadth_first(
|
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...] |
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...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
assoc_container.hpp | 537 * A branched, tree-like (tree, trie) container abstraction. 704 * A trie-based container. 711 * @tparam Node_Update Updates trie nodes, 731 class trie : public PB_DS_TRIE_BASE class in namespace:__gnu_pbds 740 trie() { } function in class:__gnu_pbds::trie 744 trie(const access_traits& t) function in class:__gnu_pbds::trie 751 trie(It first, It last) function in class:__gnu_pbds::trie 758 trie(It first, It last, const access_traits& t) function in class:__gnu_pbds::trie 762 trie(const trie& other function in class:__gnu_pbds::trie [all...] |
/external/icu4c/test/cintltst/ |
sprpdata.c | 155 UTrie trie = data->sprepTrie; local 161 UTRIE_GET16(&trie, codepoint, result); 235 UTrie trie = data->sprepTrie; local 255 UTRIE_GET16(&trie,start, result);
|
/packages/apps/Dialer/src/com/android/dialer/dialpad/ |
SmartDialLoaderTask.java | 95 final SmartDialTrie trie = mContactsCache.getContacts(); local 99 Log.d(LOG_TAG, "Size of cache: " + trie.size()); 103 final ArrayList<ContactNumber> allMatches = trie.getAllWithPrefix(mNameMatcher.getQuery());
|
/packages/apps/Dialer/tests/src/com/android/dialer/dialpad/ |
SmartDialTrieTest.java | 37 final SmartDialTrie trie = new SmartDialTrie(); local 38 trie.put(new ContactNumber(0, "Jason", "0", "0", 1)); 39 assertEquals(1, trie.size()); 40 trie.put(new ContactNumber(1, "Mary", "0", "1", 2)); 41 assertEquals(2, trie.size()); 42 trie.put(new ContactNumber(2, "John", "0", "2", 3)); 43 assertEquals(3, trie.size()); 47 final SmartDialTrie trie = new SmartDialTrie(); local 50 trie.put(jasonsmith); 51 trie.put(jasonsmitt) 61 final SmartDialTrie trie = new SmartDialTrie(); local 85 final SmartDialTrie trie = new SmartDialTrie(); local 98 final SmartDialTrie trie = new SmartDialTrie(); local 131 final SmartDialTrie trie = new SmartDialTrie(); local 163 final SmartDialTrie trie = new SmartDialTrie(); local 184 final SmartDialTrie trie = new SmartDialTrie(); local 221 final SmartDialTrie trie = new SmartDialTrie(); local 231 final SmartDialTrie trie = new SmartDialTrie(); local 244 final SmartDialTrie trie = new SmartDialTrie(); local 262 final SmartDialTrie trie = new SmartDialTrie(); local 297 final SmartDialTrie trie = new SmartDialTrie(true \/* formatNanp *\/); local [all...] |