| /external/marisa-trie/v0_1_5/tools/ |
| 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-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-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(
|
| /external/marisa-trie/tools/ |
| 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-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(
|
| /external/marisa-trie/lib/marisa/ |
| progress.h | 41 int trie() const { function in class:marisa::Progress
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| progress.h | 41 int trie() const { function in class:marisa_alpha::Progress
|
| /external/icu4c/test/perf/dicttrieperf/ |
| dicttrieperf.cpp | 263 BytesTrie trie(nameTrieBytes);
264 if(USTRINGTRIE_HAS_VALUE(trie.next(s, -1))) {
265 return trie.getValue();
340 // Note: CompactTrieDictionary::matches() is part of its trie implementation,
343 // check the trie state each time and load/store state in the object.
346 ucharsTrieMatches(UCharsTrie &trie,
358 UStringTrieResult result=trie.first(c);
387 result=trie.next(c);
406 : DictLookup(perfTest), trie(NULL) {
421 trie=builder->build(USTRINGTRIE_BUILD_SMALL, errorCode)
431 UCharsTrie *trie; member in class:UCharsTrieDictLookup
540 BytesTrie *trie; member in class:BytesTrieDictLookup
[all...] |
| /external/icu4c/common/ |
| 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);
|
| bytestrieiterator.cpp | 45 BytesTrie::Iterator::Iterator(const BytesTrie &trie, int32_t maxStringLength,
47 : bytes_(trie.bytes_), pos_(trie.pos_), initialPos_(trie.pos_),
48 remainingMatchLength_(trie.remainingMatchLength_),
49 initialRemainingMatchLength_(trie.remainingMatchLength_),
|
| ucharstrieiterator.cpp | 44 UCharsTrie::Iterator::Iterator(const UCharsTrie &trie, int32_t maxStringLength,
46 : uchars_(trie.uchars_), pos_(trie.pos_), initialPos_(trie.pos_),
47 remainingMatchLength_(trie.remainingMatchLength_),
48 initialRemainingMatchLength_(trie.remainingMatchLength_),
|
| propname.cpp | 218 UBool PropNameData::containsName(BytesTrie &trie, const char *name) {
233 result=trie.next((uint8_t)c);
259 BytesTrie trie(bytesTries+bytesTrieOffset);
260 if(containsName(trie, alias)) {
261 return trie.getValue();
|
| propname.h | 109 static UBool containsName(BytesTrie &trie, const char *name);
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 106 // Interface functions for int TRIE
108 static pANTLR3_TRIE_ENTRY intTrieGet (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key);
109 static ANTLR3_BOOLEAN intTrieDel (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key);
110 static ANTLR3_BOOLEAN intTrieAdd (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key, ANTLR3_UINT32 type, ANTLR3_INTKEY intType, void * data, void (ANTLR3_CDECL *freeptr)(void *));
111 static void intTrieFree (pANTLR3_INT_TRIE trie);
1770 pANTLR3_INT_TRIE trie; local
[all...] |
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/command/ |
| CtsConsole.java | 65 protected void setCustomCommands(RegexTrie<Runnable> trie, List<String> genericHelp,
67 trie.put(new Runnable() {
76 trie.put(new Runnable() {
85 trie.put(new Runnable() {
121 trie.put(addDerivedCommand, ADD_PATTERN, "d(?:erivedplan?)", null);
|
| /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());
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/ |
| assoc_container.hpp | 458 // An abstract basic tree-like (tree, trie) associative container.
559 // A concrete basic trie-based associative container.
570 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
579 trie() { } function in class:__gnu_pbds::trie
584 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
591 trie(It first, It last) function in class:__gnu_pbds::trie
598 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
602 trie(const trie& other) function in class:__gnu_pbds::trie
606 ~trie() { }
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/ |
| assoc_container.hpp | 474 /// An abstract basic tree-like (tree, trie) associative container.
575 /// A concrete basic trie-based associative container.
586 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
595 trie() { } function in class:__gnu_pbds::trie
600 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
607 trie(It first, It last) function in class:__gnu_pbds::trie
614 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
618 trie(const trie& other) function in class:__gnu_pbds::trie
622 ~trie() { }
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/ |
| assoc_container.hpp | 474 /// An abstract basic tree-like (tree, trie) associative container.
575 /// A concrete basic trie-based associative container.
586 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
595 trie() { } function in class:__gnu_pbds::trie
600 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
607 trie(It first, It last) function in class:__gnu_pbds::trie
614 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
618 trie(const trie& other) function in class:__gnu_pbds::trie
622 ~trie() { }
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| assoc_container.hpp | 458 // An abstract basic tree-like (tree, trie) associative container.
559 // A concrete basic trie-based associative container.
570 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
579 trie() { } function in class:__gnu_pbds::trie
584 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
591 trie(It first, It last) function in class:__gnu_pbds::trie
598 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
602 trie(const trie& other) function in class:__gnu_pbds::trie
606 ~trie() { }
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| assoc_container.hpp | 458 // An abstract basic tree-like (tree, trie) associative container.
559 // A concrete basic trie-based associative container.
570 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
579 trie() { } function in class:__gnu_pbds::trie
584 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
591 trie(It first, It last) function in class:__gnu_pbds::trie
598 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
602 trie(const trie& other) function in class:__gnu_pbds::trie
606 ~trie() { }
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| assoc_container.hpp | 458 // An abstract basic tree-like (tree, trie) associative container.
559 // A concrete basic trie-based associative container.
570 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
579 trie() { } function in class:__gnu_pbds::trie
584 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
591 trie(It first, It last) function in class:__gnu_pbds::trie
598 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
602 trie(const trie& other) function in class:__gnu_pbds::trie
606 ~trie() { }
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/ |
| assoc_container.hpp | 458 // An abstract basic tree-like (tree, trie) associative container.
559 // A concrete basic trie-based associative container.
570 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
579 trie() { } function in class:__gnu_pbds::trie
584 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
591 trie(It first, It last) function in class:__gnu_pbds::trie
598 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
602 trie(const trie& other) function in class:__gnu_pbds::trie
606 ~trie() { }
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
| assoc_container.hpp | 474 /// An abstract basic tree-like (tree, trie) associative container.
575 /// A concrete basic trie-based associative container.
586 class trie : public PB_DS_BASE_C_DEC class in namespace:__gnu_pbds
595 trie() { } function in class:__gnu_pbds::trie
600 trie(const e_access_traits& t) function in class:__gnu_pbds::trie
607 trie(It first, It last) function in class:__gnu_pbds::trie
614 trie(It first, It last, const e_access_traits& t) function in class:__gnu_pbds::trie
618 trie(const trie& other) function in class:__gnu_pbds::trie
622 ~trie() { }
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 327 /* -------------- TRIE Interfaces ---------------- */
362 * and potentially a huge trie. This is the algorithm for a Patricia Trie.
363 * Note also that this trie [can] accept multiple entries for the same key and is
364 * therefore a kind of elastic bucket patricia trie.
377 pANTLR3_INT_TRIE_NODE root; /* Root node of this integer trie */
378 pANTLR3_INT_TRIE_NODE current; /* Used to traverse the TRIE with the next() method */
380 ANTLR3_BOOLEAN allowDups; /* Whether this trie accepts duplicate keys */
383 pANTLR3_TRIE_ENTRY (*get) (struct ANTLR3_INT_TRIE_struct * trie, ANTLR3_INTKEY key);
384 ANTLR3_BOOLEAN (*del) (struct ANTLR3_INT_TRIE_struct * trie, ANTLR3_INTKEY key)
[all...] |
