| /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...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/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...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| UTF16CollationIterator.java | 106 return makeCodePointAndCE32Pair(c, trie.getFromU16SingleLead(c));
|
| CollationIterator.java | 152 void saveTrieState(CharsTrie trie) { trie.saveState(state); }
153 void resetToTrieState(CharsTrie trie) { trie.resetToState(state); }
167 // We save the trie state before we attempt to match a character,
183 trie = d.trie;
191 trie = d.trie;
201 // Compare the iterator state but not the collation data (trie & data fields)
651 protected final Trie2_32 trie; field in class:CollationIterator
[all...] |
| CollationData.java | 42 return trie.get(c);
46 return trie.get(c); // TODO: port UTRIE2_GET32_FROM_SUPP(trie, c) to Java?
482 /** Main lookup trie. */
483 Trie2_32 trie; field in class:CollationData
|
| CollationDataReader.java | 67 /** Byte offset to the collation trie. Its length is a multiple of 8 bytes. */
214 data.trie = tailoring.trie = Trie2_32.createFromSerialized(inBytes);
215 int trieLength = data.trie.getSerializedLength();
217 throw new ICUException("Not enough bytes for the mappings trie"); // No mappings.
238 throw new ICUException("Tailored ces without tailored trie");
258 throw new ICUException("Tailored ce32s without tailored trie");
317 throw new ICUException("Tailored contexts without tailored trie");
|
| ContractionsAndExpansions.java | 53 Iterator<Trie2.Range> trieIterator = data.trie.iterator();
65 trieIterator = data.trie.iterator();
|
| /external/icu/icu4c/source/common/ |
| 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...] |
| normalizer2impl.cpp | 251 UTrie2 *trie; member in struct:CanonIterData
392 /* add the start code point of each same-value range of each trie */
399 /* add the start code point of each same-value range of each trie */
413 /* add the start code point of each same-value range of the canonical iterator data trie */
416 utrie2_enum(fCanonIterData->trie, segmentStarterMapper, enumPropertyStartsRange, sa);
720 // at the cost of building the FCD trie for a decomposition normalizer.
[all...] |
| 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/icu/icu4c/source/i18n/ |
| uspoof_wsconf.cpp | 123 // The scriptSets vector provides a mapping from TRIE values to the set of scripts.
125 // Reserved TRIE values:
132 // Because Trie values are indexes into the ScriptSets vector, pre-fill
236 bsset->trie = table;
289 // But this doesn't get all. We need to fix the TRIE.
297 // Update the Trie values to be reflect the run time script indexes (after duplicate merging).
298 // (Trie Values 0 and 1 are reserved, and the corresponding slots in scriptSets
304 utrie2_set32(bSet->trie, bSet->codePoint, bSet->rindex, &status);
331 // printf("Any case Trie size: %d\n", size);
344 // printf("Lower case Trie size: %d\n", size)
[all...] |
| collationiterator.cpp | 124 void saveTrieState(const UCharsTrie &trie) { trie.saveState(state); }
125 void resetToTrieState(UCharsTrie &trie) const { trie.resetToState(state); }
140 // We save the trie state before we attempt to match a character,
147 trie(other.trie),
172 // Compare the iterator state but not the collation data (trie & data fields):
619 // Reset to the trie state before the failed match of c.
[all...] |
| collationsets.cpp | 50 utrie2_enum(data->trie, NULL, enumTailoredRange, this);
398 utrie2_enum(data->trie, NULL, enumCnERange, this);
407 utrie2_enum(data->trie, NULL, enumCnERange, this);
|
| collationdatareader.cpp | 167 data->trie = tailoring.trie = utrie2_openFromSerialized(
184 errorCode = U_INVALID_FORMAT_ERROR; // Tailored ces without tailored trie.
196 errorCode = U_INVALID_FORMAT_ERROR; // Tailored ce32s without tailored trie.
249 errorCode = U_INVALID_FORMAT_ERROR; // Tailored contexts without tailored trie.
|
| collationdatawriter.cpp | 243 length = utrie2_serialize(data.trie, dest + totalSize,
246 length = utrie2_serialize(data.trie, NULL, 0, &errorCode2);
252 // The trie size should be a multiple of 8 bytes due to the way
253 // compactIndex2(UNewTrie2 *trie) currently works.
325 // The trie has already been serialized into the dest buffer.
|
| uitercollationiterator.cpp | 48 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
138 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
|
| utf16collationiterator.cpp | 64 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
235 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
|
| collationdatabuilder.h | 237 UTrie2 *trie; member in class:CollationDataBuilder
|
| /external/marisa-trie/tests/ |
| unit-test.cc | 244 ASSERT(progress.trie() == MARISA_DEFAULT_TRIE);
255 ASSERT(progress.trie() == MARISA_DEFAULT_TRIE);
267 ASSERT(progress.trie() == MARISA_PREFIX_TRIE);
|
| /external/marisa-trie/v0_1_5/tests/ |
| unit-test.cc | 248 ASSERT(progress.trie() == MARISA_ALPHA_DEFAULT_TRIE);
259 ASSERT(progress.trie() == MARISA_ALPHA_DEFAULT_TRIE);
271 ASSERT(progress.trie() == MARISA_ALPHA_PREFIX_TRIE);
|
| /external/icu/icu4c/source/tools/gensprep/ |
| store.c | 38 * The file format prepared and written here contains a 16-bit trie and a mapping table.
53 * the trie-word, if any, for that code point. This means that the input
68 * indexes[_SPREP_INDEX_TRIE_SIZE] -- The size of the StringPrep trie in bytes
78 * StringPrep Trie :
80 * The StringPrep tries is a 16-bit trie that contains data for the profile.
81 * Each code point is associated with a value (trie-word) in the trie.
83 * - structure of data words from the trie
107 * If the type of the code point is USPREP_MAP and value in trie word is an index, the index
155 static int16_t currentIndex = 0; /* the current index into the data trie */
[all...] |
| /external/icu/icu4c/source/common/unicode/ |
| bytestrie.h | 20 * \brief C++ API: Trie for mapping byte sequences to integer values.
40 * This class owns the serialized trie data only if it was constructed by
61 * @param trieBytes The byte array that contains the serialized trie.
75 * Copy constructor, copies the other trie reader object and its state,
85 * Resets this trie to its initial state.
96 * BytesTrie state object, for saving a trie's current state
97 * and resetting the trie back to this state later.
116 * Saves the state of this trie.
117 * @param state The State object to hold the trie's state.
130 * Resets this trie to the saved state
[all...] |
| ucharstrie.h | 20 * \brief C++ API: Trie for mapping Unicode strings (or 16-bit-unit sequences)
40 * This class owns the serialized trie data only if it was constructed by
61 * @param trieUChars The UChar array that contains the serialized trie.
75 * Copy constructor, copies the other trie reader object and its state,
85 * Resets this trie to its initial state.
96 * UCharsTrie state object, for saving a trie's current state
97 * and resetting the trie back to this state later.
116 * Saves the state of this trie.
117 * @param state The State object to hold the trie's state.
130 * Resets this trie to the saved state
[all...] |
