Lines Matching full:minlevel
405 * Here, runCount>1 and maxLevel>=minLevel>=paraLevel.
417 * which is minLevel|1. However, if the lowest level itself is odd, then
420 * This is covered by ++minLevel instead of minLevel|=1 followed
429 * if minLevel==paraLevel is odd, which is done in the extra segment.
435 reorderLine(UBiDi *pBiDi, UBiDiLevel minLevel, UBiDiLevel maxLevel) {
441 if(maxLevel<=(minLevel|1)) {
447 * and reorder at an odd minLevel in a separate, simpler loop.
448 * See comments above for why minLevel is always incremented.
450 ++minLevel;
456 /* do not include the WS run at paraLevel<=old minLevel except in the simple loop */
461 while(--maxLevel>=minLevel) {
496 /* now do maxLevel==old minLevel (==odd!), see above */
497 if(!(minLevel&1)) {
600 UBiDiLevel minLevel=UBIDI_MAX_EXPLICIT_LEVEL+1, maxLevel=0;
628 if(level<minLevel) {
629 minLevel=level;
651 if(pBiDi->paraLevel<minLevel) {
652 minLevel=pBiDi->paraLevel;
660 reorderLine(pBiDi, minLevel, maxLevel);
714 UBiDiLevel level, minLevel, maxLevel;
720 /* determine minLevel and maxLevel */
721 minLevel=UBIDI_MAX_EXPLICIT_LEVEL+1;
728 if(level<minLevel) {
729 minLevel=level;
735 *pMinLevel=minLevel;
752 UBiDiLevel minLevel = 0, maxLevel = 0;
754 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) {
759 if(minLevel==maxLevel && (minLevel&1)==0) {
764 minLevel|=1;
766 /* loop maxLevel..minLevel */
809 } while(--maxLevel>=minLevel);
815 UBiDiLevel minLevel = 0, maxLevel = 0;
817 if(indexMap==NULL || !prepareReorder(levels, length, indexMap, &minLevel, &maxLevel)) {
822 if(minLevel==maxLevel && (minLevel&1)==0) {
827 minLevel|=1;
829 /* loop maxLevel..minLevel */
869 } while(--maxLevel>=minLevel);
