Lines Matching refs:CEs
103 (s)->CEpos = (s)->toReturn = (s)->CEs;
244 oldCEs = data->CEs;
265 oldCapacity = LENGTHOF(data->CEs);
276 oldCapacity = LENGTHOF(data->CEs);
913 * For generation of Implicit CEs
1230 * Supply parameters for generating implicit CEs
1388 if (collationSource->CEpos > collationSource->toReturn) { /* Are there any CEs from previous expansions? */
1391 collationSource->CEpos = collationSource->toReturn = collationSource->extendCEs ? collationSource->extendCEs : collationSource->CEs;
1828 * For more complicated CEs it resorts to getComplicatedCE.
1853 (!data->extendCEs && data->toReturn > data->CEs))
1857 if (data->CEs == data->toReturn || data->extendCEs == data->toReturn) {
2580 /* This function handles the special CEs like contractions, expansions, surrogates, Thai */
2889 uint8_t numTempBuf[UCOL_MAX_DIGITS_FOR_NUMBER/2 + 3]; // I just need a temporary place to store my generated CEs.
3239 * This function handles the special CEs like contractions, expansions,
3260 /* the only ces that loops are thai and contractions */
3452 endCEBuffer = source->CEs + UCOL_EXPAND_CE_BUFFER_SIZE;
3453 CECount = (int32_t)((source->CEpos - source->CEs)/sizeof(uint32_t));
3499 source->CEpos = source->CEs;
3539 if (source->toReturn == source->CEs) {
3540 source->CEpos = source->CEs;
3640 if(source->toReturn == source->CEs) {
3641 source->CEpos = source->CEs;
3665 uint8_t numTempBuf[UCOL_MAX_DIGITS_FOR_NUMBER/2 + 2]; // I just need a temporary place to store my generated CEs.
4431 // otherwise we would break well formedness of CEs
4881 // otherwise we would break well formedness of CEs
5676 // macro calculating the number of expansion CEs available
5718 * 9..31 - CEs consumed. Number of getCE or next32 operations performed
5871 // are the existence of expansion CEs that are not yet processed, and
5876 // Consume all the CEs that were consumed at the end of the previous
5919 // for(;;) which will be broken when we exhaust all the CEs. Other
6114 // We have finished processing CEs on this level.
6134 // otherwise we would break well formedness of CEs
7219 /* of CEs in a buffer within ucol_strcoll */
7399 // We fetch CEs until we hit a non ignorable primary or end.
7418 // and there are no more CEs, we advance to the next level
7557 /* now, we're gonna reexamine collected CEs */
7662 // otherwise, the CEs stop being well-formed
7678 // otherwise, the CEs stop being well-formed
8007 if(sOrder == tOrder) { // if we have same CEs, we continue the loop
