Home | History | Annotate | Download | only in i18n

Lines Matching refs:count2

419     // Calculate how to split the range between minLength (count1) and minLength+1 (count2).
421 // count1 + count2 * nextCountBytes = n
422 // count1 + count2 = count
424 // (count - count2) + count2 * nextCountBytes = n
425 // and then into the following count1 & count2 computations.
426 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened
427 int32_t count1 = count - count2; // number of minLength weights
428 if(count2 == 0 || (count1 + count2 * nextCountBytes) < n) {
430 ++count2;
432 U_ASSERT((count1 + count2 * nextCountBytes) >= n);
447 splitRange, rangeCount, count1, count2);
457 ranges[1].count = count2; // *countBytes when lengthened