/external/icu4c/common/ |
utrie.c | 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...] |
utrie.h | 28 * This is a common implementation of a "folded" trie. 49 * Trie constants, defining shift widths, index array lengths, etc. 114 * Number of bytes for a dummy trie. 115 * A dummy trie is an empty runtime trie, used when a real data trie cannot 135 * @param data data value for a surrogate from the trie, including the folding offset 142 * Run-time Trie structure. 175 /** Internal trie getter from an offset (0 if c16 is a BMP/lead units) and a 16-bit unit */ 176 #define _UTRIE_GET_RAW(trie, data, offset, c16) [all...] |
utrie2_builder.c | 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...] |
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). 37 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { 40 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) { 41 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY]; 48 i2=trie->index1[c>>UTRIE2_SHIFT_1]+ 51 block=trie->index2[i2]; 52 return trie->data[block+(c&UTRIE2_DATA_MASK)]; 56 utrie2_get32(const UTrie2 *trie, UChar32 c) 132 UTrie2 *trie; local 234 UTrie2 *trie; local 403 UTrie2Header trie; local [all...] |
utrie2.h | 33 * This is a common implementation of a Unicode trie. 37 * This is the second common version of a Unicode trie (hence the name UTrie2). 57 * Trie structure. 79 * Open a frozen trie from its serialized from, stored in 32-bit-aligned memory. 81 * The memory must remain valid and unchanged as long as the trie is used. 82 * You must utrie2_close() the trie once you are done using it. 89 * @param pActualLength receives the actual number of bytes at data taken up by the trie data; 92 * @return the unserialized trie 103 * Open a frozen, empty "dummy" trie. 104 * A dummy trie is an empty trie, used when a real data trie canno 633 const UTrie2 *trie; member in class:UTrie2StringIterator [all...] |
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);
|
rbbisetb.h | 25 // creates the TRIE table used to map from Unicode to the 71 // - construct the trie table that maps input characters 87 int32_t getTrieSize() /*const*/; // Size in bytes of the serialized Trie. 88 void serializeTrie(uint8_t *where); // write out the serialized Trie. 110 UNewTrie *fTrie; // The mapping TRIE that is the end result of processing
|
unormimp.h | 116 _NORM_INDEX_TRIE_SIZE, /* number of bytes in normalization trie */ 129 _NORM_INDEX_FCD_TRIE_SIZE, /* number of bytes in FCD trie */ 131 _NORM_INDEX_AUX_TRIE_SIZE, /* number of bytes in the auxiliary trie */ 179 * Change to version 2.1: add third/auxiliary trie with associated data. 237 * The first trie (normTrie above) 239 * The second trie (fcdTrie above) provides data just for FCD checks. 242 * - norm32 data words from the first trie 253 * code unit in the second trie access 366 * - FCD trie 368 * The FCD trie is very simple [all...] |
/external/icu4c/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/icu4c/test/cintltst/ |
trietest.c | 55 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { 64 value=utrie_get32(trie, start, &inBlockZero); 86 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { 95 value=utrie_get32(trie, start, &inBlockZero); 141 const UTrie *trie, 170 if(trie->data32!=NULL) { 171 UTRIE_NEXT32(trie, p, limit, c, c2, value); 173 UTRIE_NEXT16(trie, p, limit, c, c2, value); 191 if(trie->data32==NULL) { 192 value=UTRIE_GET16_FROM_LEAD(trie, c) 262 UTrie trie={ 0 }; local 456 UTrie trie={ 0 }; local 824 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/llvm/include/llvm/ADT/ |
Trie.h | 1 //===- llvm/ADT/Trie.h ---- Generic trie structure --------------*- C++ -*-===// 10 // This class defines a generic trie structure. The trie structure 32 class Trie { 33 friend class GraphTraits<Trie<Payload> >; 34 friend class DOTGraphTraits<Trie<Payload> >; 37 friend class Trie; 184 Trie(const Trie&) [all...] |
/external/icu4c/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
|
uspoof_wsconf.cpp | 120 // The scriptSets vector provides a mapping from TRIE values to the set of scripts. 122 // Reserved TRIE values: 129 // Because Trie values are indexes into the ScriptSets vector, pre-fill 237 bsset->trie = table; 290 // But this doesn't get all. We need to fix the TRIE. 298 // Update the Trie values to be reflect the run time script indexes (after duplicate merging). 299 // (Trie Values 0 and 1 are reserved, and the corresponding slots in scriptSets 305 utrie2_set32(bSet->trie, bSet->codePoint, bSet->rindex, &status); 332 // printf("Any case Trie size: %d\n", size); 345 // printf("Lower case Trie size: %d\n", size) [all...] |
/external/icu4c/tools/genprops/ |
store.c | 65 i0 indicates the length of the main trie. 73 i3 additionalTrieIndex; -- 32-bit unit index to the additional trie for more properties 84 PT serialized properties trie, see utrie.h (byte size: 4*(i0-16)) 92 AT serialized trie for additional properties (byte size: 4*(i4-i3)) 95 Trie lookup and properties: 105 The lookup of properties for a given code point is done with a trie lookup, 107 The trie lookup result is a 16-bit properties word. 116 UTRIE_GET16(trie, c, props); 141 The second trie for additional properties (AT) is also a UTrie with 16-bit data. 177 The main trie's data is significantly simplified 394 UTrie trie={ NULL }; local [all...] |
/external/icu4c/tools/genbidi/ |
store.c | 57 i2 trieSize; -- size in bytes of the bidi/shaping properties trie 67 otherwise the bits are used like enum fields in the trie word 69 Serialized trie, see utrie.h; 75 Trie data word: 94 delta stored in the trie data value. Only those where the delta does not fit 95 into the trie data are stored in this table. 115 The Joining_Group values do not fit into the 16-bit trie, but the data is also 169 /* delta does not fit into the trie properties value, store in the mirrors[] table */ 315 /* store most values from vector column 0 in the trie */ 317 fprintf(stderr, "genbidi error: unable to set trie value (overflow)\n") 381 UTrie trie={ NULL }; local [all...] |
/external/icu4c/tools/gensprep/ |
store.c | 37 * The file format prepared and written here contains a 16-bit trie and a mapping table. 52 * the trie-word, if any, for that code point. This means that the input 67 * indexes[_SPREP_INDEX_TRIE_SIZE] -- The size of the StringPrep trie in bytes 77 * StringPrep Trie : 79 * The StringPrep tries is a 16-bit trie that contains data for the profile. 80 * Each code point is associated with a value (trie-word) in the trie. 82 * - structure of data words from the trie 106 * If the type of the code point is USPREP_MAP and value in trie word is an index, the index 154 static int16_t currentIndex = 0; /* the current index into the data trie */ [all...] |
/frameworks/base/core/java/android/text/ |
AutoText.java | 36 // struct trie { 39 // struct trie *child; 40 // struct trie *next; 54 private static final int DEFAULT = 14337; // Size of the Trie 13 Aug 2007 64 // 64K characters and that the trie for the source side totals less 68 // 14K of trie) but may need to be revisited.
|
/external/icu4c/tools/genctd/ |
genctd.1.in | 10 \- Compiles word list into ICU compact trie dictionary 37 and creates a compact trie dictionary file. Normally this data file has the
|
/external/icu4c/tools/toolutil/ |
writesrc.c | 162 /* 16-bit trie */ 165 /* 32-bit trie */ 181 /* 16-bit trie */ 191 /* 32-bit trie */
|
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/ |
trie_policy.hpp | 38 * Contains trie-related policies. 208 // Returns the const_node_iterator associated with the trie's root node. 212 // Returns the node_iterator associated with the trie's root node. 306 // Returns the iterator associated with the trie's first element. 310 // Returns the iterator associated with the trie's 315 // Returns the const_node_iterator associated with the trie's root node. 319 // Returns the node_iterator associated with the trie's root node.
|
/prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
trie_policy.hpp | 38 * Contains trie-related policies. 208 // Returns the const_node_iterator associated with the trie's root node. 212 // Returns the node_iterator associated with the trie's root node. 306 // Returns the iterator associated with the trie's first element. 310 // Returns the iterator associated with the trie's 315 // Returns the const_node_iterator associated with the trie's root node. 319 // Returns the node_iterator associated with the trie's root node.
|
/prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
trie_policy.hpp | 38 * Contains trie-related policies. 208 // Returns the const_node_iterator associated with the trie's root node. 212 // Returns the node_iterator associated with the trie's root node. 306 // Returns the iterator associated with the trie's first element. 310 // Returns the iterator associated with the trie's 315 // Returns the const_node_iterator associated with the trie's root node. 319 // Returns the node_iterator associated with the trie's root node.
|
/prebuilt/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
trie_policy.hpp | 38 * Contains trie-related policies. 208 // Returns the const_node_iterator associated with the trie's root node. 212 // Returns the node_iterator associated with the trie's root node. 306 // Returns the iterator associated with the trie's first element. 310 // Returns the iterator associated with the trie's 315 // Returns the const_node_iterator associated with the trie's root node. 319 // Returns the node_iterator associated with the trie's root node.
|