Java Utililty Methods Array Max Value

int currentMax = a[0];
int currentMaxIndex = 0;
for (int i = 1; i < a.length; i++) {
    if (a[i] > currentMax) {
        currentMax = a[i];
        currentMaxIndex = i;
return currentMaxIndex;

int maxIndex = 0;
for (int i = 0; i < array.length; i++) {
    if (array[maxIndex] < array[i]) {
        maxIndex = i;
return maxIndex;

int result = 0;
for (int i = 1; i < from.length; ++i)
    if (from[i] > from[result])
        result = i;
return result;

int bi = -1;
for (int i = 0; i < list.length; i++)
    if (bi == -1 || list[i] > list[bi])
        bi = i;
return bi;

return shape[0] * Math.max(1, initDimensionMultiples(shape)[0]) - 1;

int max = Integer.MIN_VALUE;
int index = -1;
if (checkArguments(values, begin, end)) {
    max = values[begin];
    index = begin;
    for (int i = begin; i < end; i++) {
        if (values[i] > max) {
            max = values[i];
...

int result;
int i;
double maxValue;
result = -1;
maxValue = -Double.MAX_VALUE;
for (i = 0; i < array.length; i++) {
    if (array[i].doubleValue() > maxValue) {
        maxValue = array[i].doubleValue();
...

int i, max = 0;
for (i = 1; i < array.length; i++) {
    if (array[max].compareTo(array[i]) < 0)
        max = i;
return max;

if (value2indices == null) {
    value2indices = new TreeMap<Double, Integer>();
value2indices.clear();
for (int i = 0; i < aArray.length; ++i) {
    if (value2indices.get(aArray[i]) != null) {
        aArray[i] += EPS;
    value2indices.put(-aArray[i], i);
value2indices.values().toArray(indices);
return indices;

int max = max(values);
List<Integer> retVal = new ArrayList<Integer>();
for (int i = 0; i < values.length; i++) {
    if (values[i] == max) {
        retVal.add(i);
return retVal;
...