Class GrowingArrayUtils


  • final class GrowingArrayUtils
    extends Object
    A helper class that aims to provide comparable growth performance to ArrayList, but on primitive arrays. Common array operations are implemented for efficient use in dynamic containers. All methods in this class assume that the length of an array is equivalent to its capacity and NOT the number of elements in the array. The current size of the array is always passed in as a parameter.
    • Method Detail

      • append

        public static <T> T[] append​(T[] array,
                                     int currentSize,
                                     T element)
        Appends an element to the end of the array, growing the array if there is no more room.
        Parameters:
        array - The array to which to append the element. This must NOT be null.
        currentSize - The number of elements in the array. Must be less than or equal to array.length.
        element - The element to append.
        Returns:
        the array to which the element was appended. This may be different than the given array.
      • insert

        public static <T> T[] insert​(T[] array,
                                     int currentSize,
                                     int index,
                                     T element)
        Inserts an element into the array at the specified index, growing the array if there is no more room.
        Parameters:
        array - The array to which to append the element. Must NOT be null.
        currentSize - The number of elements in the array. Must be less than or equal to array.length.
        element - The element to insert.
        Returns:
        the array to which the element was appended. This may be different than the given array.
      • growSize

        public static int growSize​(int currentSize)
        Given the current size of an array, returns an ideal size to which the array should grow. This is typically double the given size, but should not be relied upon to do so in the future.