| /external/icu4c/i18n/ |
| uspoof_impl.h | 293 int32_t fAnyCaseTrie; // byte offset to the serialized Any Case Trie
294 int32_t fAnyCaseTrieLength; // Length (bytes) of the serialized Any Case Trie
296 int32_t fLowerCaseTrie; // byte offset to the serialized Lower Case Trie
297 int32_t fLowerCaseTrieLength; // Length (bytes) of the serialized Lower Case Trie
325 // by the offsets obtained from the Trie.
|
| /external/chromium_org/third_party/icu/source/common/ |
| normalizer2impl.cpp | 250 UTrie2 *trie; member in struct:CanonIterData
356 /* add the start code point of each same-value range of each trie */
369 /* add the start code point of each same-value range of the canonical iterator data trie */
372 utrie2_enum(((CanonIterData *)canonIterDataSingleton.fInstance)->trie,
593 // at the cost of building the FCD trie for a decomposition normalizer.
1538 const UTrie2 *trie=fcdTrie(); local
[all...] |
| triedict.cpp | 59 // Node structure for the ternary, uncompressed trie
93 // Start the trie off with something. Having the root node already present
96 // 4x a balanced trie to 2x a balanced trie. It's best to choose something
378 // minimise size of trie with logprobs by storing values
762 const CompactTrieInfo *fInfo; // Trie data
895 // Below here is all code related to converting a ternary trie to a compact trie
907 * construct the compact trie by storing information for each node and later
[all...] |
| normalizer2impl.h | 549 * Get access to the internal FCD trie table to be able to perform
551 * One pointer is sufficient because the trie index values are offset
552 * by the index size, so that the same pointer is used to access the trie data.
677 * The next four indexes are thresholds of 16-bit trie values for ranges of
687 * The trie holds the main normalization data. Each code point is mapped to a 16-bit value.
706 * The trie has a value for each lead surrogate code unit representing the "worst case"
709 * then their lead surrogate code unit has the trie value 0.
|
| triedict.h | 57 * dictionary based on a trie. The base protocol is read-only.
123 * The root node of the trie
149 * @param median A UChar around which to balance the trie. Ideally, it should
|
| rbbisetb.cpp | 26 // - construct the trie table that maps input characters
48 // getFoldedRBBIValue Call-back function used during building of Trie table.
51 // (It'd really be nice if the Trie builder would provide a
58 getFoldedRBBIValue(UNewTrie *trie, UChar32 start, int32_t offset) {
65 value=utrie_get32(trie, start, &inBlockZero);
259 // they doesn't affect the computation of ranges or TRIE.
285 // Build the Trie table for mapping UChar32 values to the corresponding
288 fTrie = utrie_open(NULL, // Pre-existing trie to be filled in
305 // getTrieSize() Return the size that will be required to serialize the Trie.
315 // RBBIDebugPrintf("Trie table size is %d\n", trieSize)
[all...] |
| /external/marisa-trie/tests/ |
| Makefile.in | 36 tail-test$(EXEEXT) trie-test$(EXEEXT) c-test$(EXEEXT)
49 vector-test$(EXEEXT) tail-test$(EXEEXT) trie-test$(EXEEXT) \
60 am_trie_test_OBJECTS = trie-test.$(OBJEXT)
197 trie_test_SOURCES = trie-test.cc
247 trie-test$(EXEEXT): $(trie_test_OBJECTS) $(trie_test_DEPENDENCIES)
248 @rm -f trie-test$(EXEEXT)
266 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/trie-test.Po@am__quote@
|
| /external/icu4c/common/ |
| ucharstriebuilder.cpp | 31 * It might(!) take less memory if we collected the data in a temporary, dynamic trie.
152 uchars=NULL; // The new trie now owns the array.
205 // Create and UChar-serialize the trie for the elements.
|
| normalizer2impl.cpp | 251 UTrie2 *trie; member in struct:CanonIterData
379 /* add the start code point of each same-value range of each trie */
392 /* add the start code point of each same-value range of the canonical iterator data trie */
395 utrie2_enum(((CanonIterData *)canonIterDataSingleton.fInstance)->trie,
668 // at the cost of building the FCD trie for a decomposition normalizer.
[all...] |
| ucol_data.h | 47 /*int32_t latinOneMapping;*/ /* this is now handled in the trie itself *//* fast track to latin1 chars */
|
| rbbisetb.cpp | 26 // - construct the trie table that maps input characters
48 // getFoldedRBBIValue Call-back function used during building of Trie table.
51 // (It'd really be nice if the Trie builder would provide a
58 getFoldedRBBIValue(UNewTrie *trie, UChar32 start, int32_t offset) {
65 value=utrie_get32(trie, start, &inBlockZero);
259 // they doesn't affect the computation of ranges or TRIE.
285 // Build the Trie table for mapping UChar32 values to the corresponding
288 fTrie = utrie_open(NULL, // Pre-existing trie to be filled in
305 // getTrieSize() Return the size that will be required to serialize the Trie.
315 // RBBIDebugPrintf("Trie table size is %d\n", trieSize)
[all...] |
| /packages/inputmethods/PinyinIME/jni/include/ |
| spellingtrie.h | 28 // Node used for the trie of spellings
118 // How many node used to build the trie.
146 // Yunmu ids. This functin is called after the spelling trie is built.
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
| tag_and_trait.hpp | 162 /// Basic trie structure.
165 /// PATRICIA trie.
303 /// Specialization, pat trie.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
| tag_and_trait.hpp | 162 /// Basic trie structure.
165 /// PATRICIA trie.
303 /// Specialization, pat trie.
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/ |
| tag_and_trait.hpp | 161 /// Basic trie structure.
164 /// PATRICIA trie.
302 /// Specialization, pat trie.
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| ToHTMLStream.java | 61 /** A digital search trie for fast, case insensitive lookup of ElemDesc objects. */
62 static final Trie m_elementFlags = new Trie();
67 static void initTagReference(Trie m_elementFlags) {
639 * A Trie that is just a copy of the "static" one.
641 * method Trie.get2(name)
643 private Trie m_htmlInfo = new Trie(m_elementFlags);
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
| flakiness_dashboard_unittests.js | 326 var trie = new TestTrie(builders, resultsByBuilder);
327 deepEqual(trie._trie, expectedTrie);
331 trie.forEach(function(triePath) {
338 trie.forEach(function(triePath) {
|
| flakiness_dashboard.js | 267 function traverse(trie, triePath) {
268 if (trie == true)
271 for (var member in trie)
272 traverse(trie[member], triePath ? triePath + '/' + member : member);
278 TestTrie.prototype._addTest = function(test, trie)
282 if (!trie[rootComponent])
283 trie[rootComponent] = true;
287 if (!trie[rootComponent] || trie[rootComponent] == true)
288 trie[rootComponent] = {}
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| collection.h | 40 struct Node { // Trie node
|
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTreeImpl.java | 373 * Display the Trie on console.
375 * WARNING! Do not use this for a large Trie, it's for testing purpose only.
389 * WARNING! Do not use this for a large Trie, it's for testing purpose only.
415 * WARNING! Do not use this for a large Trie, it's for testing purpose only.
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_nodes_cache.h | 30 * Class for controlling dicNode search priority queue and lexicon trie traversal.
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/ |
| dynamic_patricia_trie_node_reader.h | 33 * This class is used for helping to read nodes of dynamic patricia trie. This class handles moved
|
| /external/antlr/antlr-3.4/runtime/C/doxygen/ |
| doxygengroups.dox | 137 /// \defgroup ANTLR3_INT_TRIE ANTLR3_INT_TRIE - Trie Class Definition
237 /// \defgroup pANTLR3_INT_TRIE pANTLR3_INT_TRIE - Trie Implementation
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| bot_test_expectations.py | 83 def _walk_trie(self, trie, parent_path):
84 for name, value in trie.items():
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/ |
| tag_and_trait.hpp | 128 /// trie.
131 /// PATRICIA trie.
|
