Lines Matching defs:ce
63 binarySearch(const int64_t list[], int32_t limit, int64_t ce) {
68 int32_t cmp = compareInt64AsUnsigned(ce, list[i]);
73 return ~start; // insert ce before i
78 return ~(start + 1); // insert ce after i
335 // or a short-primary CE is followed by a secondary CE.
427 CollationFastLatinBuilder::addUniqueCE(int64_t ce, UErrorCode &errorCode) {
429 if(ce == 0 || (uint32_t)(ce >> 32) == Collation::NO_CE_PRIMARY) { return; }
430 ce &= ~(int64_t)Collation::CASE_MASK; // blank out case bits
431 int32_t i = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
433 ce, ~i, errorCode);
438 CollationFastLatinBuilder::getMiniCE(int64_t ce) const {
439 ce &= ~(int64_t)Collation::CASE_MASK; // blank out case bits
440 int32_t index = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
456 // The lowest unique CE must be at least a secondary CE.
464 int64_t ce = uniqueCEs.elementAti(i);
465 // Note: At least one of the p/s/t weights changes from one unique CE to the next.
467 uint32_t p = (uint32_t)(ce >> 32);
514 uint32_t lower32 = (uint32_t)ce;
574 int64_t ce = uniqueCEs.elementAti(i);
575 printf("unique CE 0x%016lx -> 0x%04x\n", ce, miniCEs[i]);
590 int64_t ce = charCEs[i][0];
591 if(isContractionCharCE(ce)) { continue; } // defer contraction
592 uint32_t miniCE = encodeTwoCEs(ce, charCEs[i][1]);
618 int64_t ce = charCEs[i][0];
619 if(!isContractionCharCE(ce)) { continue; }
626 for(int32_t index = (int32_t)ce & 0x7fffffff;; index += 3) {
700 // Shift them from normal CE bits 15..14 to mini CE bits 4..3.
725 // Secondary CE, or a CE with a short primary, copy the case bits.
