Home
last modified time | relevance | path

Searched refs:highIndex (Results 1 – 2 of 2) sorted by relevance

/external/proguard/src/proguard/optimize/evaluation/
DEvaluationSimplifier.java1105 int highIndex = length - 1; in trimSwitchInstruction() local
1106 while (highIndex >= 0 && in trimSwitchInstruction()
1107 jumpOffsets[highIndex] == defaultOffset) in trimSwitchInstruction()
1109 highIndex--; in trimSwitchInstruction()
1113 int newLength = highIndex - lowIndex + 1; in trimSwitchInstruction()
/external/icu/icu4c/source/i18n/
Dusearch.cpp3451 int32_t highIndex; member
3562 …buf[i].ce = strSearch->textProcessedIter->nextProcessed(&buf[i].lowIndex, &buf[i].highIndex, &stat… in get()
3601 …buf[i].ce = strSearch->textProcessedIter->previousProcessed(&buf[i].lowIndex, &buf[i].highIndex, &… in getPrevious()
3976 … if (nextCEI->lowIndex == nextCEI->highIndex && nextCEI->ce != UCOL_PROCESSED_NULLORDER) { in usearch_search()
3998 } else if ( nextCEI->lowIndex == nextCEI->highIndex ) { in usearch_search()
4024 int32_t secondIx = firstCEI->highIndex; in usearch_search()
4045 maxLimit >= lastCEI->highIndex && nextCEI->highIndex > maxLimit && in usearch_search()
4067 if (minLimit == lastCEI->highIndex && isBreakBoundary(strsrch, minLimit)) { in usearch_search()
4074 if (nba >= lastCEI->highIndex && (!allowMidclusterMatch || nba < maxLimit)) { in usearch_search()
4288 if (mStart == firstCEI->highIndex) { in usearch_searchBackwards()
[all …]