Lines Matching defs:maxLevel
332 * Here, runCount>1 and maxLevel>=minLevel>=paraLevel.
338 * Since each run is moved but not modified, and since at the initial maxLevel
340 * don't need to do anything there and can predecrement maxLevel.
354 * However, for all maxLevel>paraLevel, this run will never be reordered
355 * and does not need to be taken into account. maxLevel==paraLevel is only reordered
361 private static void reorderLine(Bidi bidi, byte minLevel, byte maxLevel) {
364 if (maxLevel<=(minLevel|1)) {
389 while (--maxLevel >= minLevel) {
394 /* look for a sequence of runs that are all at >=maxLevel */
396 while (firstRun < runCount && levels[runs[firstRun].start] < maxLevel) {
405 levels[runs[limitRun].start]>=maxLevel; ) {}
425 /* now do maxLevel==old minLevel (==odd!), see above */
528 byte maxLevel=0;
556 if (level > maxLevel) {
557 maxLevel = level;
582 reorderLine(bidi, minLevel, maxLevel);
631 byte level, minLevel, maxLevel;
637 /* determine minLevel and maxLevel */
639 maxLevel = 0;
651 if (level > maxLevel) {
652 maxLevel = level;
656 pMaxLevel[0] = maxLevel;
673 byte minLevel, maxLevel;
680 maxLevel = aMaxLevel[0];
683 if (minLevel == maxLevel && (minLevel & 1) == 0) {
690 /* loop maxLevel..minLevel */
694 /* loop for all sequences of levels to reorder at the current maxLevel */
696 /* look for a sequence of levels that are all at >=maxLevel */
698 while (start < levels.length && levels[start] < maxLevel) {
706 for (limit = start; ++limit < levels.length && levels[limit] >= maxLevel; ) {}
733 } while (--maxLevel >= minLevel);
742 byte minLevel, maxLevel;
750 maxLevel = aMaxLevel[0];
753 if (minLevel == maxLevel && (minLevel & 1) == 0) {
760 /* loop maxLevel..minLevel */
764 /* loop for all sequences of levels to reorder at the current maxLevel */
766 /* look for a sequence of levels that are all at >=maxLevel */
768 while (start < levels.length && levels[start] < maxLevel) {
776 for (limit = start; ++limit < levels.length && levels[limit] >= maxLevel; ) {}
800 } while (--maxLevel >= minLevel);