Companion
Properties
Functions
Copies an array into a new array.
Copies the specified range of the given array into a new sub array.
Return a comparator for exactly the specified number of bytes.
Returns a larger array, generally over-allocating exponentially
Returns an array whose size is at least minSize, generally over-allocating exponentially
Returns an array whose size is at least minLength, generally over-allocating exponentially, but never allocating more than maxLength elements.
Returns an array whose size is at least minSize, generally over-allocating exponentially, and it will not copy the origin data to the new array
Sorts the given array in natural order. This method uses the intro sort algorithm, but falls back to insertion sort for small arrays.
Sorts the given array using the Comparator. This method uses the intro sort algorithm, but falls back to insertion sort for small arrays.
Sorts the given array slice in natural order. This method uses the intro sort algorithm, but falls back to insertion sort for small arrays.
Sorts the given array slice using the Comparator. This method uses the intro sort algorithm, but falls back to insertion sort for small arrays.
Parses a char array into an int.
Parses the string argument as if it was an int value and returns the result. Throws NumberFormatException if the string does not represent an int quantity. The second argument specifies the radix to use when parsing the value.
Reorganize arr[from:to[ so that the element at offset k is at the same position as if arr[from:to] was sorted, and all elements on its left are less than or equal to it, and all elements on its right are greater than or equal to it.
Sorts the given array in natural order. This method uses the Tim sort algorithm, but falls back to binary sort for small arrays.
Sorts the given array using the Comparator. This method uses the Tim sort algorithm, but falls back to binary sort for small arrays.
Sorts the given array slice in natural order. This method uses the Tim sort algorithm, but falls back to binary sort for small arrays.
Sorts the given array slice using the Comparator. This method uses the Tim sort algorithm, but falls back to binary sort for small arrays.