| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| UCaseProps.java | 62 // read the trie
63 trie=Trie2_16.createFromSerialized(bytes);
65 int trieLength=trie.getSerializedLength();
67 throw new IOException(DATA_FILE_NAME+": not enough bytes for the trie");
69 // skip padding after trie bytes
96 /* add the start code point of each same-value range of the trie */
97 Iterator<Trie2.Range> trieIterator=trie.iterator();
188 int props=trie.get(c);
204 int props=trie.get(c);
220 int props=trie.get(c)
1336 private Trie2_16 trie; field in class:UCaseProps
[all...] |
| TZDBTimeZoneNames.java | 350 // loading all names into trie
351 TextTrieMap<TZDBNameInfo> trie = new TextTrieMap<TZDBNameInfo>(true); local
375 trie.put(std, stdInf);
382 trie.put(dst, dstInf);
385 TZDB_NAMES_TRIE = trie;
|
| TrieIterator.java | 19 * <p>Class enabling iteration of the values in a Trie.</p>
62 * public TrieIteratorImpl(Trie data){
86 * @see com.ibm.icu.impl.Trie
96 * @param trie to be used
99 public TrieIterator(Trie trie)
101 if (trie == null) {
103 "Argument trie cannot be null");
105 m_trie_ = trie;
146 m_nextBlock_ = m_trie_.m_index_[0] << Trie.INDEX_STAGE_2_SHIFT_
[all...] |
| /frameworks/minikin/libs/minikin/ |
| Hyphenator.cpp | 59 struct Trie {
103 const Trie* trieTable() const {
104 return reinterpret_cast<const Trie*>(bytes() + trie_offset);
391 const Trie* trie = header->trieTable(); local
393 uint32_t char_mask = trie->char_mask;
394 uint32_t link_shift = trie->link_shift;
395 uint32_t link_mask = trie->link_mask;
396 uint32_t pattern_shift = trie->pattern_shift;
399 uint32_t node = 0; // index into Trie tabl
[all...] |
| /external/icu/icu4c/source/common/ |
| ucase.cpp | 41 UTrie2 trie; member in struct:UCaseProps
72 /* add the start code point of each same-value range of the trie */
73 utrie2_enum(&csp->trie, NULL, _enumPropertyStartsRange, sa);
137 uint16_t props=UTRIE2_GET16(&csp->trie, c);
154 uint16_t props=UTRIE2_GET16(&csp->trie, c);
171 uint16_t props=UTRIE2_GET16(&csp->trie, c);
232 props=UTRIE2_GET16(&csp->trie, c);
434 uint16_t props=UTRIE2_GET16(&csp->trie, c);
441 uint16_t props=UTRIE2_GET16(&csp->trie, c);
448 uint16_t props=UTRIE2_GET16(&csp->trie, c)
[all...] |
| propsvec.c | 484 utrie2_freeze(toUTrie2.trie, UTRIE2_16_VALUE_BITS, pErrorCode);
486 utrie2_close(toUTrie2.trie);
487 toUTrie2.trie=NULL;
489 return toUTrie2.trie;
504 utrie2_setRange32(toUTrie2->trie, start, end, (uint32_t)rowIndex, TRUE, pErrorCode);
516 /* too many rows for a 16-bit trie */
519 toUTrie2->trie=utrie2_open(toUTrie2->initialValue,
|
| propsvec.h | 156 * vectors array, and freeze the trie.
162 UTrie2 *trie; member in struct:UPVecToUTrie2Context
169 /* context=UPVecToUTrie2Context, creates the trie and stores the rowIndex values */
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| TZDBTimeZoneNames.java | 352 // loading all names into trie
353 TextTrieMap<TZDBNameInfo> trie = new TextTrieMap<TZDBNameInfo>(true); local
377 trie.put(std, stdInf);
384 trie.put(dst, dstInf);
387 TZDB_NAMES_TRIE = trie;
|
| TrieIterator.java | 20 * <p>Class enabling iteration of the values in a Trie.</p>
63 * public TrieIteratorImpl(Trie data){
87 * @see android.icu.impl.Trie
97 * @param trie to be used
100 public TrieIterator(Trie trie)
102 if (trie == null) {
104 "Argument trie cannot be null");
106 m_trie_ = trie;
147 m_nextBlock_ = m_trie_.m_index_[0] << Trie.INDEX_STAGE_2_SHIFT_
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationiterator.h | 88 : trie(d->trie),
250 * Returns the CE32 from the data trie.
261 // Main lookup trie of the data object.
262 const UTrie2 *trie; member in class:CollationIterator
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/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/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/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/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/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/go/darwin-x86/src/vendor/golang_org/x/text/width/ |
| transform.go | 25 v, size := trie.lookup(src[n:])
65 v, size := trie.lookup(src[nSrc:])
107 v, size := trie.lookup(src[n:])
148 v, size := trie.lookup(src[nSrc:])
187 v, size := trie.lookup(src[n:])
211 v, size := trie.lookup(src[nSrc:])
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/width/ |
| transform.go | 25 v, size := trie.lookup(src[n:])
65 v, size := trie.lookup(src[nSrc:])
107 v, size := trie.lookup(src[n:])
148 v, size := trie.lookup(src[nSrc:])
187 v, size := trie.lookup(src[n:])
211 v, size := trie.lookup(src[nSrc:])
|
| /prebuilts/ndk/r10/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...] |
| /prebuilts/ndk/r11/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...] |
| /prebuilts/ndk/r13/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...] |
| /bionic/libc/bionic/ |
| system_properties.cpp | 78 * Properties are stored in a hybrid trie/binary tree structure.
80 * into a trie structure. Siblings at each level of the trie are stored in a
94 // Represents a node in the trie.
98 // The property trie is updated only by the init process (single threaded) which provides
100 // As the property trie is not protected by locks, we use atomic_uint_least32_t types for the
101 // left, right, children "pointers" in the trie node. To make sure readers who see the
105 // prop "points" to prop_info structure if there is a propery associated with the trie node.
168 const prop_info* find_property(prop_bt* const trie, const char* name, uint32_t namelen,
171 bool foreach_property(prop_bt* const trie, void (*propfn)(const prop_info* pi, void* cookie)
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationTailoring.java | 119 Trie2_32 trie; field in class:CollationTailoring
125 * It is immutable, and the data trie cannot be copied either.
|
| UTF16CollationIterator.java | 110 return makeCodePointAndCE32Pair(c, trie.getFromU16SingleLead(c));
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationTailoring.java | 117 Trie2_32 trie; field in class:CollationTailoring
123 * It is immutable, and the data trie cannot be copied either.
|
| UTF16CollationIterator.java | 108 return makeCodePointAndCE32Pair(c, trie.getFromU16SingleLead(c));
|
| /prebuilts/go/darwin-x86/src/strings/ |
| replace.go | 78 // trieNode is a node in a lookup trie for prioritized key/value pairs. Keys
79 // and values may be empty. For example, the trie containing keys "ax", "ay",
96 // value is the value of the trie node's key/value pair. It is empty if
99 // priority is the priority (higher is more important) of the trie node's
106 // A trie node may have zero, one or more child nodes:
114 // prefix is the difference in keys between this trie node and the next.
194 // Iterate down the trie to the end, and grab the value and keylen with
233 // tableSize is the size of a trie node's lookup table. It is the number
|
| /prebuilts/go/linux-x86/src/strings/ |
| replace.go | 78 // trieNode is a node in a lookup trie for prioritized key/value pairs. Keys
79 // and values may be empty. For example, the trie containing keys "ax", "ay",
96 // value is the value of the trie node's key/value pair. It is empty if
99 // priority is the priority (higher is more important) of the trie node's
106 // A trie node may have zero, one or more child nodes:
114 // prefix is the difference in keys between this trie node and the next.
194 // Iterate down the trie to the end, and grab the value and keylen with
233 // tableSize is the size of a trie node's lookup table. It is the number
|
