Home
last modified time | relevance | path

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

/external/exoplayer/tree/library/core/src/main/java/com/google/android/exoplayer2/upstream/
DDefaultAllocator.java142 int highIndex = availableCount - 1; in trim() local
143 while (lowIndex <= highIndex) { in trim()
148 Allocation highAllocation = availableAllocations[highIndex]; in trim()
150 highIndex--; in trim()
153 availableAllocations[highIndex--] = lowAllocation; in trim()
/external/exoplayer/tree/library/dash/src/main/java/com/google/android/exoplayer2/source/dash/manifest/
DSegmentBase.java166 long highIndex = firstSegmentNum + segmentCount - 1; in getSegmentNum() local
167 while (lowIndex <= highIndex) { in getSegmentNum()
168 long midIndex = lowIndex + (highIndex - lowIndex) / 2; in getSegmentNum()
173 highIndex = midIndex - 1; in getSegmentNum()
178 return lowIndex == firstSegmentNum ? lowIndex : highIndex; in getSegmentNum()
/external/exoplayer/tree/library/common/src/main/java/com/google/android/exoplayer2/util/
DUtil.java891 int highIndex = longArray.size() - 1; in binarySearchFloor() local
893 while (lowIndex <= highIndex) { in binarySearchFloor()
894 int midIndex = (lowIndex + highIndex) >>> 1; in binarySearchFloor()
898 highIndex = midIndex - 1; in binarySearchFloor()
902 if (inclusive && highIndex + 1 < longArray.size() && longArray.get(highIndex + 1) == value) { in binarySearchFloor()
903 highIndex++; in binarySearchFloor()
904 } else if (stayInBounds && highIndex == -1) { in binarySearchFloor()
905 highIndex = 0; in binarySearchFloor()
908 return highIndex; in binarySearchFloor()
/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
3565 …buf[i].ce = strSearch->textProcessedIter->nextProcessed(&buf[i].lowIndex, &buf[i].highIndex, &stat… in get()
3607 …buf[i].ce = strSearch->textProcessedIter->previousProcessed(&buf[i].lowIndex, &buf[i].highIndex, &… in getPrevious()
3982 … if (nextCEI->lowIndex == nextCEI->highIndex && nextCEI->ce != UCOL_PROCESSED_NULLORDER) { in usearch_search()
4004 } else if ( nextCEI->lowIndex == nextCEI->highIndex ) { in usearch_search()
4030 int32_t secondIx = firstCEI->highIndex; in usearch_search()
4051 maxLimit >= lastCEI->highIndex && nextCEI->highIndex > maxLimit && in usearch_search()
4073 if (minLimit == lastCEI->highIndex && isBreakBoundary(strsrch, minLimit)) { in usearch_search()
4080 if (nba >= lastCEI->highIndex && (!allowMidclusterMatch || nba < maxLimit)) { in usearch_search()
4294 if (mStart == firstCEI->highIndex) { in usearch_searchBackwards()
[all …]