| /external/marisa-trie/v0_1_5/vs2008/trie-test/ |
| trie-test.vcproj | 5 Name="trie-test"
176 RelativePath="..\..\tests\trie-test.cc"
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| json_results_generator_unittest.py | 180 def _find_test_in_trie(self, path, trie):
182 sub_trie = trie
220 trie = json_results_generator.test_timings_trie(test_port, individual_test_timings)
231 self.assertEqual(json.dumps(trie), json.dumps(expected_trie))
|
| json_results_generator.py | 81 def convert_trie_to_flat_paths(trie, prefix=None):
82 """Converts the directory structure in the given trie to flat paths, prepending a prefix to each."""
84 for name, data in trie.iteritems():
96 def add_path_to_trie(path, value, trie):
97 """Inserts a single flat directory path and associated value into a directory trie structure."""
99 trie[path] = value
103 if not directory in trie:
104 trie[directory] = {}
105 add_path_to_trie(rest, value, trie[directory])
120 trie = {
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
| loader.js | 74 // change calling code to understand the trie structure instead if necessary.
75 loader.Loader._flattenTrie = function(trie, prefix)
78 for (var name in trie) {
80 var data = trie[name];
|
| /external/chromium_org/third_party/icu/source/test/cintltst/ |
| sprpdata.c | 154 UTrie trie = data->sprepTrie; local
160 UTRIE_GET16(&trie, codepoint, result);
234 UTrie trie = data->sprepTrie; local
254 UTRIE_GET16(&trie,start, result);
|
| /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/inputmethods/PinyinIME/jni/include/ |
| dicttrie.h | 43 // trie to speed up further potential extending.
124 // Extend in the trie from level 0.
129 // Extend in the trie from level 1.
134 // Extend in the trie from level 2.
|
| /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...] |
| /external/chromium_org/third_party/icu/source/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 */
|
| ucnvsel.cpp | 23 * a trie is built when you call ucnvsel_open() that
47 UTrie2 *trie; // 16 bit trie containing offsets into pv member in struct:UConverterSelector
137 result->trie = upvec_compactToUTrie2WithRowIndexes(upvec, status);
236 utrie2_close(sel->trie);
256 UCNVSEL_INDEX_TRIE_SIZE, // trie size in bytes
293 int32_t serializedTrieSize = utrie2_serialize(sel->trie, NULL, 0, status);
334 utrie2_serialize(sel->trie, p, serializedTrieSize, status);
563 // trie
564 sel->trie = utrie2_openFromSerialized(UTRIE2_16_VALUE_BITS
[all...] |
| utrie2_impl.h | 43 * Trie data structure in serialized form:
86 /* Building a trie ---------------------------------------------------------- */
129 * Build-time trie structure.
|
| propsvec.c | 480 utrie2_freeze(toUTrie2.trie, UTRIE2_16_VALUE_BITS, pErrorCode);
482 utrie2_close(toUTrie2.trie);
483 toUTrie2.trie=NULL;
485 return toUTrie2.trie;
500 utrie2_setRange32(toUTrie2->trie, start, end, (uint32_t)rowIndex, TRUE, pErrorCode);
512 /* too many rows for a 16-bit trie */
515 toUTrie2->trie=utrie2_open(toUTrie2->initialValue,
|
| sprpimpl.h | 67 _SPREP_INDEX_TRIE_SIZE = 0, /* number of bytes in StringPrep trie */
|
| /external/hyphenation/ |
| README.hyphen | 60 Knuth uses a trie to implement this. I.e. he stores each rule in a
61 trie structure. For each position in the word, he searches the trie,
|
| /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 */
|
| ucnvsel.cpp | 23 * a trie is built when you call ucnvsel_open() that
49 UTrie2 *trie; // 16 bit trie containing offsets into pv member in struct:UConverterSelector
139 result->trie = upvec_compactToUTrie2WithRowIndexes(upvec, status);
238 utrie2_close(sel->trie);
258 UCNVSEL_INDEX_TRIE_SIZE, // trie size in bytes
295 int32_t serializedTrieSize = utrie2_serialize(sel->trie, NULL, 0, status);
336 utrie2_serialize(sel->trie, p, serializedTrieSize, status);
565 // trie
566 sel->trie = utrie2_openFromSerialized(UTRIE2_16_VALUE_BITS
[all...] |
| utrie2_impl.h | 43 * Trie data structure in serialized form:
86 /* Building a trie ---------------------------------------------------------- */
129 * Build-time trie structure.
|
| propsvec.c | 482 utrie2_freeze(toUTrie2.trie, UTRIE2_16_VALUE_BITS, pErrorCode);
484 utrie2_close(toUTrie2.trie);
485 toUTrie2.trie=NULL;
487 return toUTrie2.trie;
502 utrie2_setRange32(toUTrie2->trie, start, end, (uint32_t)rowIndex, TRUE, pErrorCode);
514 /* too many rows for a 16-bit trie */
517 toUTrie2->trie=utrie2_open(toUTrie2->initialValue,
|
| /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...] |
| /prebuilts/ndk/9/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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/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 internal-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...] |
| /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);
|
| /external/icu4c/common/unicode/ |
| stringtriebuilder.h | 23 * \brief C++ API: Builder API for trie builders
36 * Builds a trie quickly.
41 * Builds a trie more slowly, attempting to generate
56 * Base class for string trie builder classes.
200 * Branch nodes in this trie data structure are not symmetric.
204 * (trie units are written backwards), and must write it at that point even if
|
| /external/icu4c/tools/gendict/ |
| gendict.cpp | 114 "\tRead in a word list and write out a string trie dictionary\n"
226 // add a word to the trie
317 fprintf(stderr, "you must specify exactly one type of trie to output!\n");
322 fprintf(stderr, "you must provide a transformation for a bytes trie, and must not provide one for a uchars trie!\n");
411 fprintf(stderr, "ICU Error \"%s\": Failed to add word to trie at input line %d in input file\n",
|
| /external/clang/lib/Tooling/ |
| FileMatchTrie.cpp | 35 /// child nodes. The trie starts with an empty root node.
38 /// \brief Inserts 'NewPath' into this trie. \c ConsumedLength denotes
54 // a postfix of another path, violating a core assumption of the trie.
|
