Lines Matching defs:maxLevel
346 * Here, runCount>1 and maxLevel>=minLevel>=paraLevel.
352 * Since each run is moved but not modified, and since at the initial maxLevel
354 * don't need to do anything there and can predecrement maxLevel.
368 * However, for all maxLevel>paraLevel, this run will never be reordered
369 * and does not need to be taken into account. maxLevel==paraLevel is only reordered
375 private static void reorderLine(BidiBase bidiBase, byte minLevel, byte maxLevel) {
378 if (maxLevel<=(minLevel|1)) {
403 while (--maxLevel >= minLevel) {
408 /* look for a sequence of runs that are all at >=maxLevel */
410 while (firstRun < runCount && levels[runs[firstRun].start] < maxLevel) {
419 levels[runs[limitRun].start]>=maxLevel; ) {}
439 /* now do maxLevel==old minLevel (==odd!), see above */
540 byte maxLevel=0;
568 if (level > maxLevel) {
569 maxLevel = level;
594 reorderLine(bidiBase, minLevel, maxLevel);
643 byte level, minLevel, maxLevel;
649 /* determine minLevel and maxLevel */
651 maxLevel = 0;
660 if (level > maxLevel) {
661 maxLevel = level;
665 pMaxLevel[0] = maxLevel;
682 byte minLevel, maxLevel;
690 maxLevel = aMaxLevel[0];
693 if (minLevel == maxLevel && (minLevel & 1) == 0) {
700 /* loop maxLevel..minLevel */
704 /* loop for all sequences of levels to reorder at the current maxLevel */
706 /* look for a sequence of levels that are all at >=maxLevel */
708 while (start < levels.length && levels[start] < maxLevel) {
716 for (limit = start; ++limit < levels.length && levels[limit] >= maxLevel; ) {}
740 } while (--maxLevel >= minLevel);