| /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
|
| bytestrieiterator.cpp | 45 BytesTrie::Iterator::Iterator(const BytesTrie &trie, int32_t maxStringLength,
47 : bytes_(trie.bytes_), pos_(trie.pos_), initialPos_(trie.pos_),
48 remainingMatchLength_(trie.remainingMatchLength_),
49 initialRemainingMatchLength_(trie.remainingMatchLength_),
|
| ucharstrieiterator.cpp | 44 UCharsTrie::Iterator::Iterator(const UCharsTrie &trie, int32_t maxStringLength,
46 : uchars_(trie.uchars_), pos_(trie.pos_), initialPos_(trie.pos_),
47 remainingMatchLength_(trie.remainingMatchLength_),
48 initialRemainingMatchLength_(trie.remainingMatchLength_),
|
| /external/icu4c/test/intltest/ |
| ucharstrietest.cpp | 69 void checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
70 void checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
71 void checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
72 void checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
73 void checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
296 LocalPointer<UCharsTrie> trie(buildTrie(data, LENGTHOF(data), USTRINGTRIE_BUILD_FAST));
297 if(trie.isNull()) {
301 if( (result=trie->nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() ||
302 (result=trie->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() |
[all...] |
| bytestrietest.cpp | 62 void checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
63 void checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
64 void checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
65 void checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
66 void checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength);
307 LocalPointer<BytesTrie> trie(buildMonthsTrie(USTRINGTRIE_BUILD_FAST));
308 if(trie.isNull()) {
312 if(trie->hasUniqueValue(uniqueValue)) {
315 trie->next('j');
316 trie->next('a')
[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
233 bsset->trie = table;
286 // But this doesn't get all. We need to fix the TRIE.
294 // Update the Trie values to be reflect the run time script indexes (after duplicate merging).
295 // (Trie Values 0 and 1 are reserved, and the corresponding slots in scriptSets
301 utrie2_set32(bSet->trie, bSet->codePoint, bSet->rindex, &status);
328 // printf("Any case Trie size: %d\n", size);
341 // printf("Lower case Trie size: %d\n", size)
[all...] |
| /external/icu4c/common/unicode/ |
| ucharstrie.h | 20 * \brief C++ API: Trie for mapping Unicode strings (or 16-bit-unit sequences)
40 * This class owns the serialized trie data only if it was constructed by
61 * @param trieUChars The UChar array that contains the serialized trie.
75 * Copy constructor, copies the other trie reader object and its state,
85 * Resets this trie to its initial state.
96 * UCharsTrie state object, for saving a trie's current state
97 * and resetting the trie back to this state later.
116 * Saves the state of this trie.
117 * @param state The State object to hold the trie's state.
130 * Resets this trie to the saved state
[all...] |
| bytestriebuilder.h | 69 * This method passes ownership of the builder's internal result array to the new trie object.
70 * Another call to any build() variant will re-serialize the trie.
88 * If buildStringPiece() is called after build(), the trie will be
90 * If build() is called after buildStringPiece(), the trie object will become
105 * New data can then be add()ed and a new trie can be built.
161 // Byte serialization of the trie.
|
| ucharstriebuilder.h | 68 * This method passes ownership of the builder's internal result array to the new trie object.
69 * Another call to any build() variant will re-serialize the trie.
87 * If buildUnicodeString() is called after build(), the trie will be
89 * If build() is called after buildUnicodeString(), the trie object will become
107 * New data can then be add()ed and a new trie can be built.
165 // UChar serialization of the trie.
|
| bytestrie.h | 20 * \brief C++ API: Trie for mapping byte sequences to integer values.
40 * This class owns the serialized trie data only if it was constructed by
61 * @param trieBytes The byte array that contains the serialized trie.
75 * Copy constructor, copies the other trie reader object and its state,
85 * Resets this trie to its initial state.
96 * BytesTrie state object, for saving a trie's current state
97 * and resetting the trie back to this state later.
116 * Saves the state of this trie.
117 * @param state The State object to hold the trie's state.
130 * Resets this trie to the saved state
[all...] |
| /external/icu4c/test/perf/dicttrieperf/ |
| dicttrieperf.cpp | 264 BytesTrie trie(nameTrieBytes);
265 if(USTRINGTRIE_HAS_VALUE(trie.next(s, -1))) {
266 return trie.getValue();
391 // Note: CompactTrieDictionary::matches() is part of its trie implementation,
394 // check the trie state each time and load/store state in the object.
397 ucharsTrieMatches(UCharsTrie &trie,
409 UStringTrieResult result=trie.first(c);
438 result=trie.next(c);
457 : DictLookup(perfTest), trie(NULL) {
472 trie=builder->build(USTRINGTRIE_BUILD_SMALL, errorCode)
482 UCharsTrie *trie; member in class:UCharsTrieDictLookup
591 BytesTrie *trie; member in class:BytesTrieDictLookup
[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...] |
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTree.java | 31 * Patricia trie/tree, or crit bit tree is a specialized set data structure
32 * based on the trie that is used to store a set of strings. In contrast with a
33 * regular trie, the edges of a Patricia trie are labelled with sequences of
38 * Patricia trie is retained for more general inputs, but the structure works
|
