| /frameworks/native/cmds/installd/ |
| matchgen.py | 63 trie = collections.defaultdict(lambda: collections.defaultdict(lambda: collections.defaultdict(lambda: collections.defaultdict(lambda: collections.defaultdict(lambda: collections.defaultdict(lambda: "")))))) variable
68 target = trie
88 dump(trie, 0)
|
| /external/icu/icu4c/source/common/ |
| 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 */
|
| ubidi_props.c | 39 UTrie2 trie; member in struct:UBiDiProps
76 /* add the start code point of each same-value range of the trie */
77 utrie2_enum(&bdp->trie, NULL, _enumPropertyStartsRange, sa);
146 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
152 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
190 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
196 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
202 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
208 uint16_t props=UTRIE2_GET16(&bdp->trie, c);
231 uint16_t props=UTRIE2_GET16(&bdp->trie, c)
[all...] |
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| trieset.cpp | 20 * Modifies the trie index to make the BMP linear, and uses the original set
27 #define UTRIE_GET8_LATIN1(trie) ((const uint8_t *)(trie)->data32+UTRIE_DATA_BLOCK_LENGTH)
29 #define UTRIE_GET8_FROM_LEAD(trie, c16) \
30 ((const uint8_t *)(trie)->data32)[ \
31 ((int32_t)((trie)->index[(c16)>>UTRIE_SHIFT])<<UTRIE_INDEX_SHIFT)+ \
67 // Preflight the trie length.
81 utrie_unserialize(&trie, trieData, length, &errorCode); // TODO: Implement for 8-bit UTrie!
86 uprv_memcpy((uint16_t *)trie.index+(0xd800>>UTRIE_SHIFT),
87 trie.index+UTRIE_BMP_INDEX_LENGTH
113 UTrie trie; member in class:TrieSet
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
| BytesTrieTest.java | 263 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
265 if((uniqueValue=trie.getUniqueValue())!=0) {
268 trie.next('j');
269 trie.next('a');
270 trie.next('n');
272 if((uniqueValue=trie.getUniqueValue())!=((1<<1)|1)) {
275 trie.first('j');
276 trie.next('u');
277 if((uniqueValue=trie.getUniqueValue())!=0) {
280 if(trie.next('n')!=BytesTrie.Result.INTERMEDIATE_VALUE || 6!=trie.getValue())
297 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
344 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
387 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
409 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
454 BytesTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
476 BytesTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
523 BytesTrie trie=buildTrie(data, dataLength, buildOption); local
552 BytesTrie trie=builder_.build(buildOption); local
[all...] |
| CharsTrieTest.java | 242 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
244 if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
245 (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
246 (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
247 (result=trie.nextForCodePoint(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
248 (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() |
323 CharsTrie trie=buildLargeTrie(1111); local
392 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
426 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
473 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
516 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
538 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
583 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
605 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
650 CharsTrie trie=buildTrie(data, dataLength, buildOption); local
679 CharsTrie trie=builder_.build(buildOption); local
[all...] |
| Trie2Test.java | 52 Trie2Writable trie = new Trie2Writable(0,0); local
54 trie.toTrie2_16().serialize(os);
86 Trie2Writable trie = new Trie2Writable(17,0); local
88 it = trie.iterator();
104 for (Trie2.Range rr: trie) {
128 Trie2Writable trie = new Trie2Writable(0xbadfeed, 0); local
129 trie.set(0x10123, 42);
139 Iterator<Trie2.Range> it = trie.iterator(vm);
151 Trie2Writable trie = new Trie2Writable(0xdefa17, 0); local
152 trie.set(0x2f810, 10)
178 Trie2Writable trie = new Trie2Writable(0xdefa17, 0); local
202 Trie2Writable trie = new Trie2Writable(101, 0); local
589 Trie2Writable trie = new Trie2Writable(initialValue, errorValue); local
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationtailoring.h | 82 UTrie2 *trie; member in struct:CollationTailoring
90 * It is immutable, and the data trie cannot be copied either.
|
| collationdatabuilder.h | 239 UTrie2 *trie; member in class:CollationDataBuilder
|
| collationdata.h | 56 : trie(NULL),
69 return UTRIE2_GET32(trie, c);
73 return UTRIE2_GET32_FROM_SUPP(trie, c);
174 /** Main lookup trie. */
175 const UTrie2 *trie; member in struct:CollationData
|
| 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
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| BytesTrieTest.java | 262 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
264 if((uniqueValue=trie.getUniqueValue())!=0) {
267 trie.next('j');
268 trie.next('a');
269 trie.next('n');
271 if((uniqueValue=trie.getUniqueValue())!=((1<<1)|1)) {
274 trie.first('j');
275 trie.next('u');
276 if((uniqueValue=trie.getUniqueValue())!=0) {
279 if(trie.next('n')!=BytesTrie.Result.INTERMEDIATE_VALUE || 6!=trie.getValue())
296 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
343 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
386 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
408 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
453 BytesTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
475 BytesTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
522 BytesTrie trie=buildTrie(data, dataLength, buildOption); local
551 BytesTrie trie=builder_.build(buildOption); local
[all...] |
| CharsTrieTest.java | 241 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
243 if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
244 (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
245 (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
246 (result=trie.nextForCodePoint(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() ||
247 (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() |
322 CharsTrie trie=buildLargeTrie(1111); local
391 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
425 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
472 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
515 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.SMALL); local
537 CharsTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); local
582 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
604 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); local
649 CharsTrie trie=buildTrie(data, dataLength, buildOption); local
678 CharsTrie trie=builder_.build(buildOption); local
[all...] |
| Trie2Test.java | 51 Trie2Writable trie = new Trie2Writable(0,0); local
53 trie.toTrie2_16().serialize(os);
85 Trie2Writable trie = new Trie2Writable(17,0); local
87 it = trie.iterator();
103 for (Trie2.Range rr: trie) {
127 Trie2Writable trie = new Trie2Writable(0xbadfeed, 0); local
128 trie.set(0x10123, 42);
138 Iterator<Trie2.Range> it = trie.iterator(vm);
150 Trie2Writable trie = new Trie2Writable(0xdefa17, 0); local
151 trie.set(0x2f810, 10)
177 Trie2Writable trie = new Trie2Writable(0xdefa17, 0); local
201 Trie2Writable trie = new Trie2Writable(101, 0); local
588 Trie2Writable trie = new Trie2Writable(initialValue, errorValue); local
[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.
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/text/width/ |
| width.go | 70 var trie = newWidthTrie(0) var
75 v, sz := trie.lookup(b)
82 v, sz := trie.lookupString(s)
90 v, _ := trie.lookup(buf[:n])
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/width/ |
| width.go | 70 var trie = newWidthTrie(0) var
75 v, sz := trie.lookup(b)
82 v, sz := trie.lookupString(s)
90 v, _ := trie.lookup(buf[:n])
|
| /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;
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| 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;
|
| /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/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...] |
