Searched refs:trie (Results 1 - 25 of 60) sorted by relevance

123

/macosx-10.10.1/ICU-531.30/icuSources/common/
H A Dutrie2.cpp16 * 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) { argument
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, UChar3 argument
73 utrie2_get32FromLeadSurrogateCodeUnit(const UTrie2 *trie, UChar32 c) argument
87 u8Index(const UTrie2 *trie, UChar32 c, int32_t i) argument
97 utrie2_internalU8NextIndex(const UTrie2 *trie, UChar32 c, const uint8_t *src, const uint8_t *limit) argument
112 utrie2_internalU8PrevIndex(const UTrie2 *trie, UChar32 c, const uint8_t *start, const uint8_t *src) argument
136 UTrie2 *trie; local
238 UTrie2 *trie; local
367 utrie2_close(UTrie2 *trie) argument
403 utrie2_isFrozen(const UTrie2 *trie) argument
408 utrie2_serialize(const UTrie2 *trie, void *data, int32_t capacity, UErrorCode *pErrorCode) argument
436 UTrie2Header trie; local
545 enumEitherTrie(const UTrie2 *trie, UChar32 start, UChar32 limit, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
723 utrie2_enum(const UTrie2 *trie, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
729 utrie2_enumForLeadSurrogate(const UTrie2 *trie, UChar32 lead, UTrie2EnumValue *enumValue, UTrie2EnumRange *enumRange, const void *context) argument
[all...]
H A Dutrie.h29 * This is a common implementation of a "folded" trie.
115 * Number of bytes for a dummy trie.
116 * A dummy trie is an empty runtime trie, used when a real data trie cannot
136 * @param data data value for a surrogate from the trie, including the folding offset
176 /** Internal trie getter from an offset (0 if c16 is a BMP/lead units) and a 16-bit unit */
177 #define _UTRIE_GET_RAW(trie, data, offset, c16) \
178 (trie)->data[ \
179 ((int32_t)((trie)
[all...]
H A Dutrie.cpp16 * 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
115 UNewTrie *trie; local
151 utrie_close(UNewTrie *trie) argument
164 utrie_getData(UNewTrie *trie, int32_t *pLength) argument
174 utrie_allocDataBlock(UNewTrie *trie) argument
194 utrie_getDataBlock(UNewTrie *trie, UChar32 c) argument
220 utrie_set32(UNewTrie *trie, UChar32 c, uint32_t value) argument
238 utrie_get32(UNewTrie *trie, UChar32 c, UBool *pInBlockZero) argument
282 utrie_setRange32(UNewTrie *trie, UChar32 start, UChar32 limit, uint32_t value, UBool overwrite) argument
403 utrie_fold(UNewTrie *trie, UNewTrieGetFoldedValue *getFoldedValue, UErrorCode *pErrorCode) argument
544 _findUnusedBlocks(UNewTrie *trie) argument
588 utrie_compact(UNewTrie *trie, UBool overlap, UErrorCode *pErrorCode) argument
719 defaultGetFoldedValue(UNewTrie *trie, UChar32 start, int32_t offset) argument
740 utrie_serialize(UNewTrie *trie, void *dt, int32_t capacity, UNewTrieGetFoldedValue *getFoldedValue, UBool reduceTo16Bits, UErrorCode *pErrorCode) argument
855 utrie_unserialize(UTrie *trie, const void *data, int32_t length, UErrorCode *pErrorCode) argument
930 utrie_unserializeDummy(UTrie *trie, void *data, int32_t length, uint32_t initialValue, uint32_t leadUnitValue, UBool make16BitTrie, UErrorCode *pErrorCode) argument
1057 utrie_enum(const UTrie *trie, UTrieEnumValue *enumValue, UTrieEnumRange *enumRange, const void *context) argument
[all...]
H A Dutrie2.h34 * This is a common implementation of a Unicode trie.
38 * This is the second common version of a Unicode trie (hence the name UTrie2).
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, use
635 const UTrie2 *trie; member in class:UTrie2StringIterator
[all...]
H A Dutrie2_builder.cpp16 * 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,
237 UNewTrie2 *trie; local
279 UTrie2 *trie; local
322 UTrie2 *trie; member in struct:NewTrieAndStatus
347 utrie_printLengths(const UTrie *trie) argument
356 utrie2_printLengths(const UTrie2 *trie, const char *which) argument
459 isInNullBlock(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
474 allocIndex2Block(UNewTrie2 *trie) argument
493 getIndex2Block(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
513 allocDataBlock(UNewTrie2 *trie, int32_t copyBlock) argument
559 releaseDataBlock(UNewTrie2 *trie, int32_t block) argument
566 isWritableBlock(UNewTrie2 *trie, int32_t block) argument
571 setIndex2Entry(UNewTrie2 *trie, int32_t i2, int32_t block) argument
588 getDataBlock(UNewTrie2 *trie, UChar32 c, UBool forLSCP) argument
616 set32(UNewTrie2 *trie, UChar32 c, UBool forLSCP, uint32_t value, UErrorCode *pErrorCode) argument
636 utrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode) argument
648 utrie2_set32ForLeadSurrogateCodeUnit(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode) argument
695 utrie2_setRange32(UTrie2 *trie, UChar32 start, UChar32 end, uint32_t value, UBool overwrite, UErrorCode *pErrorCode) argument
899 findHighStart(UNewTrie2 *trie, uint32_t highValue) argument
985 compactData(UNewTrie2 *trie) argument
1092 compactIndex2(UNewTrie2 *trie) argument
1174 compactTrie(UTrie2 *trie, UErrorCode *pErrorCode) argument
1251 utrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode) argument
[all...]
H A Dubidi_props.c36 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,
[all...]
H A Ducol_swp.cpp30 * This performs data swapping for a folded trie (see utrie.c for details).
38 UTrieHeader trie; local
57 trie.signature=ds->readUInt32(inTrie->signature);
58 trie.options=ds->readUInt32(inTrie->options);
59 trie.indexLength=udata_readInt32(ds, inTrie->indexLength);
60 trie.dataLength=udata_readInt32(ds, inTrie->dataLength);
62 if( trie.signature!=0x54726965 ||
63 (trie.options&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_SHIFT ||
64 ((trie.options>>UTRIE_OPTIONS_INDEX_SHIFT)&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_INDEX_SHIFT ||
65 trie
[all...]
H A Drbtok.cpp57 const UTrie *trie = &fData->fTrie; local
95 UTRIE_GET16(trie, c, category);
192 const UTrie *trie = &fData->fTrie; local
197 //UTRIE_GET16(trie, i, category);
199 fLatin1Cat[i] = _UTRIE_GET_RAW(trie, index, 0, i);
H A Dbytestrieiterator.cpp45 BytesTrie::Iterator::Iterator(const BytesTrie &trie, int32_t maxStringLength, argument
47 : bytes_(trie.bytes_), pos_(trie.pos_), initialPos_(trie.pos_),
48 remainingMatchLength_(trie.remainingMatchLength_),
49 initialRemainingMatchLength_(trie.remainingMatchLength_),
H A Ducharstrieiterator.cpp44 UCharsTrie::Iterator::Iterator(const UCharsTrie &trie, int32_t maxStringLength, argument
46 : uchars_(trie.uchars_), pos_(trie.pos_), initialPos_(trie.pos_),
47 remainingMatchLength_(trie.remainingMatchLength_),
48 initialRemainingMatchLength_(trie.remainingMatchLength_),
H A Dpropname.cpp218 UBool PropNameData::containsName(BytesTrie &trie, const char *name) { argument
233 result=trie.next((uint8_t)c);
259 BytesTrie trie(bytesTries+bytesTrieOffset);
260 if(containsName(trie, alias)) {
261 return trie.getValue();
/macosx-10.10.1/ICU-531.30/icuSources/test/intltest/
H A Ducharstrietest.cpp69 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
818 checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
856 checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
930 checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
990 checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
1008 checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength) argument
[all...]
H A Dbytestrietest.cpp62 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
656 checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
678 checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
758 checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
818 checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
835 checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength) argument
[all...]
/macosx-10.10.1/ICU-531.30/icuSources/test/perf/unisetperf/draft/
H A Dtrieset.cpp16 * 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
109 UTrie trie; member in class:TrieSet
[all...]
/macosx-10.10.1/ICU-531.30/icuSources/test/cintltst/
H A Dtrie2test.c98 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, star
97 testTrieEnum(const char *testName, const UTrie2 *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
110 testTrieGetters(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
269 testTrieUTF16(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
349 testTrieUTF8(const char *testName, const UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
485 testFrozenTrie(const char *testName, UTrie2 *trie, UTrie2ValueBits valueBits, const CheckRange checkRanges[], int32_t countCheckRanges) argument
534 testNewTrie(const char *testName, const UTrie2 *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
542 testTrieSerialize(const char *testName, UTrie2 *trie, UTrie2ValueBits valueBits, UBool withSwap, const CheckRange checkRanges[], int32_t countCheckRanges) argument
751 testTrieSerializeAllValueBits(const char *testName, UTrie2 *trie, UBool withClone, const CheckRange checkRanges[], int32_t countCheckRanges) argument
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...]
H A Dtrietest.c56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { argument
65 value=utrie_get32(trie, start, &inBlockZero);
87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { argument
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,
141 testTrieIteration(const char *testName, const UTrie *trie, const CheckRange checkRanges[], int32_t countCheckRanges) argument
263 UTrie trie={ 0 }; local
457 UTrie trie={ 0 }; local
825 UTrie trie; local
[all...]
/macosx-10.10.1/JavaScriptCore-7600.1.17/
H A DKeywordLookupGenerator.py134 for trie in self.keys.values():
135 trie.fillOut(self.fullPrefix)
136 weight = weight + trie.weight
137 self.keys = [(trie.prefix, trie) for trie in sorted(self.keys.values(), key=operator.attrgetter('weight'), reverse=True)]
152 for k, trie in self.keys:
156 k = trie.fullPrefix[baseIndex] + k
170 trie.printSubTreeAsC(typeName, indent + 4)
178 for (_, trie) i
215 trie = Trie("") variable
[all...]
/macosx-10.10.1/ICU-531.30/icuSources/i18n/
H A Duspoof_wsconf.h44 UTrie2 *trie; // Any-case or Lower-case Trie. member in class:BuilderScriptSet
H A Dcollationdata.h37 : 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
H A Dcollationdatabuilder.cpp107 * In particular, this class reads from the unfinished trie
119 * so that the CollationIterator does not need the finished trie
183 uint32_t ce32 = utrie2_get32(builder.trie, c);
249 return utrie2_get32(builder.trie, c);
257 return utrie2_get32(builder.trie, jamo);
279 trie(NULL),
290 utrie2_close(trie);
298 if(trie != NULL) {
309 trie = utrie2_open(Collation::FALLBACK_CE32, Collation::FFFD_CE32, &errorCode);
317 utrie2_set32(trie,
[all...]
H A Dcollationtailoring.h80 UTrie2 *trie; member in struct:CollationTailoring
88 * It is immutable, and the data trie cannot be copied either.
H A Dcollationtailoring.cpp38 trie(NULL), unsafeBackwardSet(NULL),
60 utrie2_close(trie);
/macosx-10.10.1/ICU-531.30/icuSources/test/perf/dicttrieperf/
H A Ddicttrieperf.cpp263 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, argument
358 UStringTrieResult result=trie.first(c);
387 result=trie.next(c);
406 : DictLookup(perfTest), trie(NULL) {
421 trie
431 UCharsTrie *trie; member in class:UCharsTrieDictLookup
540 BytesTrie *trie; member in class:BytesTrieDictLookup
545 bytesTrieMatches(BytesTrie &trie, UText *text, int32_t textLimit, int32_t *lengths, int &count, int limit ) argument
[all...]
/macosx-10.10.1/cxxfilt-11/cxxfilt/bfd/
H A Dmmo.c1210 search trie}, following ideas of Bentley and Sedgewick. (See
1213 Addison--Wesley, 1998), @samp{15.4}.) Each trie node stores a
1216 character in the trie. There also is a pointer to a symbol table
1229 | 0x40 - Traverse left trie.
1266 | 0x20 - Traverse middle trie. (Read a new command byte
1270 | 0x10 - Traverse right trie. (Read a new command byte and
1283 This forms the trivial trie (note that the path between ``:'' and
1307 /* Traverse left trie. */
1396 /* Traverse middle trie. */
1403 /* Traverse right trie
2608 struct mmo_symbol_trie *trie = rootp; local
2664 mmo_internal_3_length(bfd *abfd, struct mmo_symbol_trie *trie) argument
2734 mmo_internal_3_dump(bfd *abfd, struct mmo_symbol_trie *trie) argument
[all...]
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/pb_ds/
H A Dassoc_container.hpp464 // An abstract basic tree-like (tree, trie) associative container.
565 // A concrete basic trie-based associative container.
576 class trie : public PB_DS_BASE_C_DEC class in namespace:pb_ds
585 trie() { } function in class:pb_ds::trie
590 trie(const e_access_traits& t) function in class:pb_ds::trie
597 trie(It first, It last) function in class:pb_ds::trie
604 trie(It first, It last, const e_access_traits& t) function in class:pb_ds::trie
608 trie(const trie& other) function in class:pb_ds::trie
612 ~trie() { }
[all...]

Completed in 226 milliseconds

123