/macosx-10.10.1/ICU-531.30/icuSources/i18n/ |
H A D | utf8collationiterator.cpp | 52 return trie->data32[c]; 57 uint32_t ce32 = trie->data32[trie->index[(UTRIE2_UTF8_2B_INDEX_2_OFFSET - 0xc0) + c] + t1]; 69 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c); 161 return trie->data32[c]; 166 uint32_t ce32 = trie->data32[trie->index[(UTRIE2_UTF8_2B_INDEX_2_OFFSET - 0xc0) + c] + t1]; 218 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
|
H A D | collationbasedatabuilder.cpp | 97 if(trie != NULL) { 114 trie = utrie2_open(Collation::UNASSIGNED_CE32, Collation::FFFD_CE32, &errorCode); 116 // Preallocate trie blocks for Latin in the hope that proximity helps with CPU caches. 118 utrie2_set32(trie, c, Collation::UNASSIGNED_CE32, &errorCode); 121 utrie2_set32(trie, 0xfffe, Collation::MERGE_SEPARATOR_CE32, &errorCode); 127 utrie2_setRange32(trie, Hangul::HANGUL_BASE, Hangul::HANGUL_END, hangulCE32, TRUE, &errorCode); 143 utrie2_set32(trie, 0xfffd, ce32, &errorCode); 148 utrie2_set32(trie, 0xffff, ce32, &errorCode);
|
H A D | collationiterator.h | 86 : trie(d->trie), 248 * Returns the CE32 from the data trie. 259 // Main lookup trie of the data object. 260 const UTrie2 *trie; member in class:CollationIterator
|
H A D | uspoof_wsconf.cpp | 236 bsset->trie = table; 304 utrie2_set32(bSet->trie, bSet->codePoint, bSet->rindex, &status); 421 trie = NULL;
|
H A D | collationdatawriter.cpp | 226 length = utrie2_serialize(data.trie, dest + totalSize, 229 length = utrie2_serialize(data.trie, NULL, 0, &errorCode2); 235 // The trie size should be a multiple of 8 bytes due to the way 236 // compactIndex2(UNewTrie2 *trie) currently works. 304 // The trie has already been serialized into the dest buffer.
|
H A D | collationiterator.cpp | 124 void saveTrieState(const UCharsTrie &trie) { trie.saveState(state); } argument 125 void resetToTrieState(UCharsTrie &trie) const { trie.resetToState(state); } 140 // We save the trie state before we attempt to match a character, 147 trie(other.trie), 172 // Compare the iterator state but not the collation data (trie & data fields): 619 // Reset to the trie state before the failed match of c.
|
H A D | collationsets.cpp | 50 utrie2_enum(data->trie, NULL, enumTailoredRange, this); 398 utrie2_enum(data->trie, NULL, enumCnERange, this); 407 utrie2_enum(data->trie, NULL, enumCnERange, this);
|
H A D | collationdatareader.cpp | 153 data->trie = tailoring.trie = utrie2_openFromSerialized( 170 errorCode = U_INVALID_FORMAT_ERROR; // Tailored ces without tailored trie. 182 errorCode = U_INVALID_FORMAT_ERROR; // Tailored ce32s without tailored trie. 235 errorCode = U_INVALID_FORMAT_ERROR; // Tailored contexts without tailored trie.
|
H A D | uitercollationiterator.cpp | 48 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c); 138 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
|
H A D | utf16collationiterator.cpp | 64 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c); 235 return UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, c);
|
/macosx-10.10.1/ICU-531.30/icuSources/common/ |
H A D | propname.h | 109 static UBool containsName(BytesTrie &trie, const char *name);
|
H A D | 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, [all...] |
H A D | propsvec.c | 482 utrie2_freeze(toUTrie2.trie, UTRIE2_16_VALUE_BITS, pErrorCode); 484 utrie2_close(toUTrie2.trie); 485 toUTrie2.trie=NULL; 487 return toUTrie2.trie; 502 utrie2_setRange32(toUTrie2->trie, start, end, (uint32_t)rowIndex, TRUE, pErrorCode); 514 /* too many rows for a 16-bit trie */ 517 toUTrie2->trie=utrie2_open(toUTrie2->initialValue,
|
H A D | propsvec.h | 154 * vectors array, and freeze the trie. 160 UTrie2 *trie; member in struct:UPVecToUTrie2Context 167 /* context=UPVecToUTrie2Context, creates the trie and stores the rowIndex values */
|
H A D | 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 [all...] |
H A D | normalizer2impl.cpp | 251 UTrie2 *trie; member in struct:CanonIterData 441 /* add the start code point of each same-value range of each trie */ 448 /* add the start code point of each same-value range of each trie */ 462 /* add the start code point of each same-value range of the canonical iterator data trie */ 465 utrie2_enum(fCanonIterData->trie, segmentStarterMapper, enumPropertyStartsRange, sa); 769 // at the cost of building the FCD trie for a decomposition normalizer. 1619 // still had getFCDTrie() which built and cached an FCD trie. 1859 trie(utrie2_open(0, 0, &errorCode)), 1863 utrie2_close(trie); 1867 uint32_t canonValue=utrie2_get32(trie, decompLea [all...] |
H A D | rbbisetb.cpp | 26 // - construct the trie table that maps input characters 58 getFoldedRBBIValue(UNewTrie *trie, UChar32 start, int32_t offset) { argument 65 value=utrie_get32(trie, start, &inBlockZero); 288 fTrie = utrie_open(NULL, // Pre-existing trie to be filled in 322 // serializeTrie() Put the serialized trie at the specified address.
|
/macosx-10.10.1/ICU-531.30/icuSources/test/cintltst/ |
H A D | sprpdata.c | 155 UTrie trie = data->sprepTrie; local 161 UTRIE_GET16(&trie, codepoint, result); 235 UTrie trie = data->sprepTrie; local 255 UTRIE_GET16(&trie,start, result);
|
/macosx-10.10.1/xnu-2782.1.97/bsd/netinet/ |
H A D | flow_divert.c | 632 trie_node_alloc(struct flow_divert_trie *trie) argument 634 if (trie->nodes_free_next < trie->nodes_count) { 635 uint16_t node_idx = trie->nodes_free_next++; 636 TRIE_NODE(trie, node_idx).child_map = NULL_TRIE_IDX; 644 trie_child_map_alloc(struct flow_divert_trie *trie) argument 646 if (trie->child_maps_free_next < trie->child_maps_count) { 647 return trie->child_maps_free_next++; 654 trie_bytes_move(struct flow_divert_trie *trie, uint16_ argument 669 flow_divert_trie_insert(struct flow_divert_trie *trie, uint16_t string_start, size_t string_len) argument 782 flow_divert_trie_search(struct flow_divert_trie *trie, const uint8_t *string_bytes) argument [all...] |
/macosx-10.10.1/dyld-353.2.1/launch-cache/ |
H A D | MachOBinder.hpp | 220 std::vector<mach_o::trie::Entry> exports; 223 mach_o::trie::parseTrie(exportsStart, exportsEnd, exports); 225 for(std::vector<mach_o::trie::Entry>::iterator it = exports.begin(); it != exports.end(); ++it) { 485 std::vector<mach_o::trie::Entry> exports; 486 mach_o::trie::parseTrie(exportsStart, exportsEnd, exports); 487 //fprintf(stderr, "%s exports %lu symbols from trie of size %u \n", this->fLayout.getFilePath(), exports.size(), fDyldInfo->export_size()); 495 std::vector<mach_o::trie::Entry> aDylibsExports; 496 mach_o::trie::parseTrie(aDylibsExportsStart, aDylibsExportsEnd, aDylibsExports); 498 for(std::vector<mach_o::trie::Entry>::iterator eit = aDylibsExports.begin(); eit != aDylibsExports.end(); ++eit) { 499 mach_o::trie [all...] |
/macosx-10.10.1/ksh-23/ksh/src/lib/libast/regex/ |
H A D | regcomp.c | 218 triedrop(disc, e->re.trie.root[i]); 622 if ((env->stats.m += e->re.trie.min) < cm) 625 if ((env->stats.n += e->re.trie.max) < cn) 628 if (!env->stats.y || env->stats.y->re.trie.min < e->re.trie.min) 1942 if (!(t = g->re.trie.root[*s]) && !(t = g->re.trie.root[*s] = trienode(env, *s))) 1962 if (g->re.trie.min > len) 1963 g->re.trie.min = len; 1964 if (g->re.trie 1977 trie(Cenv_t* env, Rex_t* e, Rex_t* f) function [all...] |
H A D | regdecomp.c | 310 if (e->re.trie.root[c]) 318 detrie(e->re.trie.root[c], sp, pfx, pfx, &pfx[sizeof(pfx)], delimiter);
|
/macosx-10.10.1/ICU-531.30/icuSources/tools/gensprep/ |
H A D | store.c | 38 * The file format prepared and written here contains a 16-bit trie and a mapping table. 53 * the trie-word, if any, for that code point. This means that the input 68 * indexes[_SPREP_INDEX_TRIE_SIZE] -- The size of the StringPrep trie in bytes 80 * The StringPrep tries is a 16-bit trie that contains data for the profile. 81 * Each code point is associated with a value (trie-word) in the trie. 83 * - structure of data words from the trie 107 * If the type of the code point is USPREP_MAP and value in trie word is an index, the index 155 static int16_t currentIndex = 0; /* the current index into the data trie */ 294 /* turn on the first bit in trie wor 525 getFoldedValue(UNewTrie *trie, UChar32 start, int32_t offset) argument [all...] |
/macosx-10.10.1/ICU-531.30/icuSources/common/unicode/ |
H A D | bytestrie.h | 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. 131 * If the state object contains no state, or the state of a different trie, [all...] |
H A D | ucharstrie.h | 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. 131 * If the state object contains no state, or the state of a different trie, [all...] |