63 binarySearch(const int64_t list[], int32_t limit, int64_t ce) {  in binarySearch()  argument
68         int32_t cmp = compareInt64AsUnsigned(ce, list[i]);  in binarySearch()
427 CollationFastLatinBuilder::addUniqueCE(int64_t ce, UErrorCode &errorCode) {  in addUniqueCE()  argument
429     if(ce == 0 || (uint32_t)(ce >> 32) == Collation::NO_CE_PRIMARY) { return; }  in addUniqueCE()
430     ce &= ~(int64_t)Collation::CASE_MASK;  // blank out case bits  in addUniqueCE()
431     int32_t i = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);  in addUniqueCE()
433         uniqueCEs.insertElementAt(ce, ~i, errorCode);  in addUniqueCE()
438 CollationFastLatinBuilder::getMiniCE(int64_t ce) const {  in getMiniCE()
439     ce &= ~(int64_t)Collation::CASE_MASK;  // blank out case bits  in getMiniCE()
440     int32_t index = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);  in getMiniCE()
464         int64_t ce = uniqueCEs.elementAti(i);  in encodeUniqueCEs()  local
467         uint32_t p = (uint32_t)(ce >> 32);  in encodeUniqueCEs()
514         uint32_t lower32 = (uint32_t)ce;  in encodeUniqueCEs()
574         int64_t ce = uniqueCEs.elementAti(i);  in encodeUniqueCEs()  local
575         printf("unique CE 0x%016lx -> 0x%04x\n", ce, miniCEs[i]);  in encodeUniqueCEs()
590         int64_t ce = charCEs[i][0];  in encodeCharCEs()  local
591         if(isContractionCharCE(ce)) { continue; }  // defer contraction  in encodeCharCEs()
592         uint32_t miniCE = encodeTwoCEs(ce, charCEs[i][1]);  in encodeCharCEs()
618         int64_t ce = charCEs[i][0];  in encodeContractions()  local
619         if(!isContractionCharCE(ce)) { continue; }  in encodeContractions()
626         for(int32_t index = (int32_t)ce & 0x7fffffff;; index += 3) {  in encodeContractions()