package de.ugoe.cs.util; /** *

* Helper class that provides methods to simplify working with arrays. *

* * @author Steffen Herbold * @version 1.0 */ final public class ArrayTools { /** *

* Private constructor to prevent initializing of the class. *

*/ private ArrayTools() { } /** *

* Finds the first occurrence of an object inside an array. *

*

* In case {@code other==null}, the first occurrence of a {@code null} value * in the array is returned. *

* * @param array * the array * @param other * the object * @return index of the object if found, -1 otherwise */ public static int findIndex(Object[] array, Object other) { int retVal = -1; for (int i = 0; i < array.length && retVal == -1; i++) { if (other != null) { if (array[i] != null && array[i].equals(other)) { retVal = i; } } else { if (array[i] == null) { retVal = i; } } } return retVal; } /** *

* Finds the highest element in an array. If multiple elements have the * maximum value, the index of the first one is returned; null-values are * ignored. In case the parameter array is null, has length 0 or contains * only null-values, -1 is returned. *

* * @param * @param array * the array * @return index of the element with the highest value, -1 in case of an * invalid parameter */ @SuppressWarnings("unchecked") public static int findMax(Comparable[] array) { int maxIndex = -1; T maxElement = null; if (array != null) { for (int i = 0; i < array.length; i++) { if (array[i] != null) { if (maxElement == null || array[i].compareTo(maxElement) > 0) { maxElement = (T) array[i]; maxIndex = i; } } } } return maxIndex; } /** *

* Finds the lowest element in an array. If multiple elements have the * minimal value, the index of the first one is returned; null-values are * ignored. In case the parameter array is null, has length 0 or contains * only null-values, -1 is returned. *

* * @param * @param array * the array * @return index of the element with the lowest value, -1 in case of an * invalid parameter */ @SuppressWarnings("unchecked") public static int findMin(Comparable[] array) { int maxIndex = -1; T maxElement = null; if (array != null) { for (int i = 0; i < array.length; i++) { if (array[i] != null) { if (maxElement == null || array[i].compareTo(maxElement) < 0) { maxElement = (T) array[i]; maxIndex = i; } } } } return maxIndex; } }