| /external/chromium_org/third_party/icu/source/i18n/ |
| uspoof_wsconf.h | 44 UTrie2 *trie; // Any-case or Lower-case Trie. member in class:BuilderScriptSet
45 // These Trie tables are the final result of the
|
| /external/chromium_org/third_party/libaddressinput/chromium/cpp/test/util/ |
| trie_test.cc | 15 #include "util/trie.h"
28 Trie<std::string> trie; local
30 trie.FindDataForKeyPrefix("key", &result);
35 Trie<std::string> trie; local
36 trie.AddDataForKey("hello", "world");
38 trie.FindDataForKeyPrefix("hello", &result);
45 Trie<std::string> trie; local
55 Trie<std::string> trie; local
63 Trie<std::string> trie; local
76 Trie<std::string> trie; local
89 Trie<std::string> trie; local
101 Trie<std::string> trie; local
[all...] |
| /external/icu/icu4c/source/i18n/ |
| uspoof_wsconf.h | 44 UTrie2 *trie; // Any-case or Lower-case Trie. member in class:BuilderScriptSet
45 // These Trie tables are the final result of the
|
| collationtailoring.h | 80 UTrie2 *trie; member in struct:CollationTailoring
88 * It is immutable, and the data trie cannot be copied either.
|
| collationdatabuilder.h | 237 UTrie2 *trie; member in class:CollationDataBuilder
|
| collationdata.h | 37 : trie(NULL),
50 return UTRIE2_GET32(trie, c);
54 return UTRIE2_GET32_FROM_SUPP(trie, c);
145 /** Main lookup trie. */
146 const UTrie2 *trie; member in struct:CollationData
|
| collationiterator.h | 86 : trie(d->trie),
248 * Returns the CE32 from the data trie.
259 // Main lookup trie of the data object.
260 const UTrie2 *trie; member in class:CollationIterator
|
| /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 */
|
| ucol_swp.cpp | 29 * This performs data swapping for a folded trie (see utrie.c for details).
37 UTrieHeader trie; local
56 trie.signature=ds->readUInt32(inTrie->signature);
57 trie.options=ds->readUInt32(inTrie->options);
58 trie.indexLength=udata_readInt32(ds, inTrie->indexLength);
59 trie.dataLength=udata_readInt32(ds, inTrie->dataLength);
61 if( trie.signature!=0x54726965 ||
62 (trie.options&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_SHIFT ||
63 ((trie.options>>UTRIE_OPTIONS_INDEX_SHIFT)&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_INDEX_SHIFT ||
64 trie.indexLength<UTRIE_BMP_INDEX_LENGTH |
[all...] |
| ubidi_props.c | 37 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);
|
| /external/chromium_org/third_party/icu/source/test/perf/unisetperf/draft/ |
| trieset.cpp | 16 * Modifies the trie index to make the BMP linear, and uses the original set
23 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH)
25 #define UTRIE_GET8_FROM_LEAD(trie, c16) \
26 ((const uint8_t *)(trie)->data32)[ \
27 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
63 // Preflight the trie length.
77 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie!
82 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT),
83 trie.index+UTRIE_BMP_INDEX_LENGTH
109 UTrie trie; member in class:TrieSet
[all...] |
| /external/icu/icu4c/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 */
|
| 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);
133 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
139 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
177 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
183 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
189 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
195 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
214 uint16_t props=UTRIE2_GET16(&bdp->trie, c)
[all...] |
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| trieset.cpp | 16 * Modifies the trie index to make the BMP linear, and uses the original set
23 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH)
25 #define UTRIE_GET8_FROM_LEAD(trie, c16) \
26 ((const uint8_t *)(trie)->data32)[ \
27 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
63 // Preflight the trie length.
77 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie!
82 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT),
83 trie.index+UTRIE_BMP_INDEX_LENGTH
109 UTrie trie; member in class:TrieSet
[all...] |
| /external/chromium_org/third_party/libaddressinput/chromium/cpp/src/ |
| ruleset.cc | 52 // Delete the maps and trie objects owned by |tries_| field.
70 Trie<const Ruleset*>* trie = identity_field_it->second; local
71 assert(trie != NULL);
72 delete trie;
143 std::make_pair(Rule::KEY, new Trie<const Ruleset*>));
145 std::make_pair(Rule::NAME, new Trie<const Ruleset*>));
147 std::make_pair(Rule::LATIN_NAME, new Trie<const Ruleset*>));
182 Trie<const Ruleset*>* trie = identity_field_it->second local
[all...] |
| /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-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/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/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/icu/icu4c/source/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);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/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...] |
