/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/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...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/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...] |
/prebuilts/ndk/6/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...] |
/prebuilts/ndk/7/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...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/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...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/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...] |
/cts/tools/tradefed-host/src/com/android/cts/tradefed/command/ |
CtsConsole.java | 65 protected void setCustomCommands(RegexTrie<Runnable> trie, List<String> genericHelp, 67 trie.put(new Runnable() { 76 trie.put(new Runnable() { 85 trie.put(new Runnable() { 121 trie.put(addDerivedCommand, ADD_PATTERN, "d(?:erivedplan?)", null);
|
/external/icu4c/common/ |
utrie2.cpp | 16 * This is a common implementation of a Unicode trie. 19 * This is the second common version of a Unicode trie (hence the name UTrie2). 41 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { 44 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) { 45 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY]; 52 i2=trie->index1[c>>UTRIE2_SHIFT_1]+ 55 block=trie->index2[i2]; 56 return trie->data[block+(c&UTRIE2_DATA_MASK)]; 60 utrie2_get32(const UTrie2 *trie, UChar32 c) 136 UTrie2 *trie; local 238 UTrie2 *trie; local 407 UTrie2Header trie; local [all...] |
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...] |
utrie.cpp | 16 * This is a common implementation of a "folded" trie. 44 /* Building a trie ----------------------------------------------------------*/ 51 UNewTrie *trie; local 61 trie=fillIn; 63 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie)); 64 if(trie==NULL) { 68 uprv_memset(trie, 0, sizeof(UNewTrie)); 69 trie->isAllocated= (UBool)(fillIn==NULL); 72 trie->data=aliasData; 73 trie->isDataAllocated=FALSE 115 UNewTrie *trie; local [all...] |
ucase.cpp | 40 UTrie2 trie; member in struct:UCaseProps 71 /* add the start code point of each same-value range of the trie */ 72 utrie2_enum(&csp->trie, NULL, _enumPropertyStartsRange, sa); 136 uint16_t props=UTRIE2_GET16(&csp->trie, c); 153 uint16_t props=UTRIE2_GET16(&csp->trie, c); 170 uint16_t props=UTRIE2_GET16(&csp->trie, c); 231 props=UTRIE2_GET16(&csp->trie, c); 433 uint16_t props=UTRIE2_GET16(&csp->trie, c); 440 uint16_t props=UTRIE2_GET16(&csp->trie, c); 447 uint16_t props=UTRIE2_GET16(&csp->trie, c) [all...] |
utrie2.h | 34 * This is a common implementation of a Unicode trie. 38 * This is the second common version of a Unicode trie (hence the name UTrie2). 58 * Trie structure. 80 * Open a frozen trie from its serialized from, stored in 32-bit-aligned memory. 82 * The memory must remain valid and unchanged as long as the trie is used. 83 * You must utrie2_close() the trie once you are done using it. 90 * @param pActualLength receives the actual number of bytes at data taken up by the trie data; 93 * @return the unserialized trie 104 * Open a frozen, empty "dummy" trie. 105 * A dummy trie is an empty trie, used when a real data trie canno 635 const UTrie2 *trie; member in class:UTrie2StringIterator [all...] |
utrie2_builder.cpp | 16 * This is a common implementation of a Unicode trie. 19 * This is the second common version of a Unicode trie (hence the name UTrie2). 42 * have been chosen to minimize trie sizes overall. 71 /* Building a trie ----------------------------------------------------------*/ 106 allocIndex2Block(UNewTrie2 *trie); 110 UTrie2 *trie; local 119 trie=(UTrie2 *)uprv_malloc(sizeof(UTrie2)); 122 if(trie==NULL || newTrie==NULL || data==NULL) { 123 uprv_free(trie); 130 uprv_memset(trie, 0, sizeof(UTrie2)) 237 UNewTrie2 *trie; local 279 UTrie2 *trie; local 322 UTrie2 *trie; member in struct:NewTrieAndStatus [all...] |
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...] |
/external/icu4c/test/cintltst/ |
trietest.c | 56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { 65 value=utrie_get32(trie, start, &inBlockZero); 87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { 96 value=utrie_get32(trie, start, &inBlockZero); 142 const UTrie *trie, 171 if(trie->data32!=NULL) { 172 UTRIE_NEXT32(trie, p, limit, c, c2, value); 174 UTRIE_NEXT16(trie, p, limit, c, c2, value); 192 if(trie->data32==NULL) { 193 value=UTRIE_GET16_FROM_LEAD(trie, c) 263 UTrie trie={ 0 }; local 457 UTrie trie={ 0 }; local 825 UTrie trie; local [all...] |
trie2test.c | 98 const UTrie2 *trie, 105 utrie2_enum(trie, testEnumValue, testEnumRange, &checkRanges); 111 const UTrie2 *trie, UTrie2ValueBits valueBits, 118 UBool isFrozen=utrie2_isFrozen(trie); 119 const char *const typeName= isFrozen ? "frozen trie" : "newTrie"; 133 value2=UTRIE2_GET16_FROM_U16_SINGLE_LEAD(trie, start); 135 value2=UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, start); 144 value2=UTRIE2_GET16_FROM_SUPP(trie, start); 146 value2=UTRIE2_GET32_FROM_SUPP(trie, start); 154 value2=UTRIE2_GET16(trie, start) 800 UTrie2 *trie; local 860 UTrie2 *trie=makeTrieWithRanges(testName, withClone, local 1060 UTrie2 *trie=makeTrieWithRanges(testName, FALSE, local 1108 UTrie2 *trie; local 1157 UTrie2 *trie; local 1210 UTrie2 *trie; local [all...] |
/external/marisa-trie/tools/ |
marisa-benchmark.cc | 50 " -P, --patricia-trie build patricia tries (default)\n" 51 " -p, --prefix-trie build prefix tries\n" 71 std::cout << "trie: patricia" << std::endl; 75 std::cout << "trie: prefix" << std::endl; 174 marisa::Trie *trie, std::vector<marisa::UInt32> *key_ids) { 176 trie->build(keys, key_ids, num_tries 178 std::printf(" %9lu", (unsigned long)trie->num_nodes()); 179 std::printf(" %9lu", (unsigned long)trie->total_size()); 183 void benchmark_restore(const marisa::Trie &trie 273 marisa::Trie trie; local [all...] |
/external/marisa-trie/v0_1_5/tools/ |
marisa_alpha-benchmark.cc | 50 " -P, --patricia-trie build patricia tries (default)\n" 51 " -p, --prefix-trie build prefix tries\n" 71 std::cout << "trie: patricia" << std::endl; 75 std::cout << "trie: prefix" << std::endl; 174 marisa_alpha::Trie *trie, std::vector<marisa_alpha::UInt32> *key_ids) { 176 trie->build(keys, key_ids, num_tries 178 std::printf(" %9lu", (unsigned long)trie->num_nodes()); 179 std::printf(" %9lu", (unsigned long)trie->total_size()); 183 void benchmark_restore(const marisa_alpha::Trie &trie 273 marisa_alpha::Trie trie; local [all...] |
/external/antlr/antlr-3.4/runtime/C/src/ |
antlr3collections.c | 106 // Interface functions for int TRIE 108 static pANTLR3_TRIE_ENTRY intTrieGet (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key); 109 static ANTLR3_BOOLEAN intTrieDel (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key); 110 static ANTLR3_BOOLEAN intTrieAdd (pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key, ANTLR3_UINT32 type, ANTLR3_INTKEY intType, void * data, void (ANTLR3_CDECL *freeptr)(void *)); 111 static void intTrieFree (pANTLR3_INT_TRIE trie); 1770 pANTLR3_INT_TRIE trie; local [all...] |
/external/icu4c/test/perf/dicttrieperf/ |
dicttrieperf.cpp | 263 BytesTrie trie(nameTrieBytes); 264 if(USTRINGTRIE_HAS_VALUE(trie.next(s, -1))) { 265 return trie.getValue(); 340 // Note: CompactTrieDictionary::matches() is part of its trie implementation, 343 // check the trie state each time and load/store state in the object. 346 ucharsTrieMatches(UCharsTrie &trie, 358 UStringTrieResult result=trie.first(c); 387 result=trie.next(c); 406 : DictLookup(perfTest), trie(NULL) { 421 trie=builder->build(USTRINGTRIE_BUILD_SMALL, errorCode) 431 UCharsTrie *trie; member in class:UCharsTrieDictLookup 540 BytesTrie *trie; member in class:BytesTrieDictLookup [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
com.ibm.icu_4.2.1.v20100412.jar | |
/prebuilts/misc/common/tradefed/ |
tradefed-prebuilt.jar | |
/prebuilts/tools/common/m2/internal/com/ibm/icu/icu4j/2.6.1/ |
icu4j-2.6.1.jar | |