java.lang.Object  
↳  java.util.Arrays 
This class contains various methods for manipulating arrays (such as sorting and searching). This class also contains a static factory that allows arrays to be viewed as lists.
The methods in this class all throw a NullPointerException if the specified array reference is null, except where noted.
The documentation for the methods contained in this class includes briefs description of the implementations. Such descriptions should be regarded as implementation notes, rather than parts of the specification. Implementors should feel free to substitute other algorithms, so long as the specification itself is adhered to. (For example, the algorithm used by sort(Object[]) does not have to be a mergesort, but it does have to be stable.)
This class is a member of the Java Collections Framework.
Public Methods  

Returns a fixedsize list backed by the specified array.
 
Searches a range of
the specified array for the specified object using the binary
search algorithm.
 
Searches a range of
the specified array of bytes for the specified value using the
binary search algorithm.
 
Searches a range of
the specified array of longs for the specified value using the
binary search algorithm.
 
Searches the specified array of longs for the specified value using the
binary search algorithm.
 
Searches the specified array of chars for the specified value using the
binary search algorithm.
 
Searches a range of
the specified array of shorts for the specified value using
the binary search algorithm.
 
Searches the specified array for the specified object using the binary
search algorithm.
 
Searches a range of
the specified array of chars for the specified value using the
binary search algorithm.
 
Searches the specified array of shorts for the specified value using
the binary search algorithm.
 
Searches a range of
the specified array for the specified object using the binary
search algorithm.
 
Searches the specified array of bytes for the specified value using the
binary search algorithm.
 
Searches the specified array of doubles for the specified value using
the binary search algorithm.
 
Searches a range of
the specified array of doubles for the specified value using
the binary search algorithm.
 
Searches the specified array of floats for the specified value using
the binary search algorithm.
 
Searches the specified array of ints for the specified value using the
binary search algorithm.
 
Searches a range of
the specified array of floats for the specified value using
the binary search algorithm.
 
Searches the specified array for the specified object using the binary
search algorithm.
 
Searches a range of
the specified array of ints for the specified value using the
binary search algorithm.
 
Copies the specified array, truncating or padding with nulls (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with false (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with null characters (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
 
Copies the specified array, truncating or padding with nulls (if necessary)
so the copy has the specified length.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Copies the specified range of the specified array into a new array.
 
Returns true if the two specified arrays are deeply
equal to one another.
 
Returns a hash code based on the "deep contents" of the specified
array.
 
Returns a string representation of the "deep contents" of the specified
array.
 
Returns true if the two specified arrays of chars are
equal to one another.
 
Returns true if the two specified arrays of Objects are
equal to one another.
 
Returns true if the two specified arrays of ints are
equal to one another.
 
Returns true if the two specified arrays of floats are
equal to one another.
 
Returns true if the two specified arrays of doubles are
equal to one another.
 
Returns true if the two specified arrays of shorts are
equal to one another.
 
Returns true if the two specified arrays of bytes are
equal to one another.
 
Returns true if the two specified arrays of longs are
equal to one another.
 
Returns true if the two specified arrays of booleans are
equal to one another.
 
Assigns the specified boolean value to each element of the specified
range of the specified array of booleans.
 
Assigns the specified int value to each element of the specified array
of ints.
 
Assigns the specified int value to each element of the specified
range of the specified array of ints.
 
Assigns the specified double value to each element of the specified
range of the specified array of doubles.
 
Assigns the specified char value to each element of the specified array
of chars.
 
Assigns the specified float value to each element of the specified array
of floats.
 
Assigns the specified char value to each element of the specified
range of the specified array of chars.
 
Assigns the specified long value to each element of the specified array
of longs.
 
Assigns the specified float value to each element of the specified
range of the specified array of floats.
 
Assigns the specified Object reference to each element of the specified
range of the specified array of Objects.
 
Assigns the specified byte value to each element of the specified array
of bytes.
 
Assigns the specified short value to each element of the specified
range of the specified array of shorts.
 
Assigns the specified byte value to each element of the specified
range of the specified array of bytes.
 
Assigns the specified double value to each element of the specified
array of doubles.
 
Assigns the specified long value to each element of the specified
range of the specified array of longs.
 
Assigns the specified boolean value to each element of the specified
array of booleans.
 
Assigns the specified short value to each element of the specified array
of shorts.
 
Assigns the specified Object reference to each element of the specified
array of Objects.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Returns a hash code based on the contents of the specified array.
 
Sorts the specified range of the specified array of longs into
ascending numerical order.
 
Sorts the specified array of chars into ascending numerical order.
 
Sorts the specified range of the specified array of ints into
ascending numerical order.
 
Sorts the specified array of objects according to the order induced by
the specified comparator.
 
Sorts the specified array of ints into ascending numerical order.
 
Sorts the specified array of objects into ascending order, according to
the
natural ordering
of its elements.  
Sorts the specified range of the specified array of chars into
ascending numerical order.
 
Sorts the specified range of the specified array of doubles into
ascending numerical order.
 
Sorts the specified array of floats into ascending numerical order.
 
Sorts the specified range of the specified array of objects according
to the order induced by the specified comparator.
 
Sorts the specified range of the specified array of bytes into
ascending numerical order.
 
Sorts the specified array of longs into ascending numerical order.
 
Sorts the specified range of the specified array of floats into
ascending numerical order.
 
Sorts the specified range of the specified array of shorts into
ascending numerical order.
 
Sorts the specified array of bytes into ascending numerical order.
 
Sorts the specified array of shorts into ascending numerical order.
 
Sorts the specified range of the specified array of objects into
ascending order, according to the
natural ordering of its
elements.  
Sorts the specified array of doubles into ascending numerical order.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.
 
Returns a string representation of the contents of the specified array.

[Expand]
Inherited Methods  

From class
java.lang.Object

Returns a fixedsize list backed by the specified array. (Changes to
the returned list "write through" to the array.) This method acts
as bridge between arraybased and collectionbased APIs, in
combination with toArray()
. The returned list is
serializable and implements RandomAccess
.
This method also provides a convenient way to create a fixedsize list initialized to contain several elements:
List<String> stooges = Arrays.asList("Larry", "Moe", "Curly");
a  the array by which the list will be backed 

Searches a range of
the specified array for the specified object using the binary
search algorithm.
The range must be sorted into ascending order
according to the specified comparator (as by the
sort(T[], int, int, Comparator)
method) prior to making this call.
If it is not sorted, the results are undefined.
If the range contains multiple elements equal to the specified object,
there is no guarantee which one will be found.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
c  the comparator by which the array is ordered. A
null value indicates that the elements'
natural ordering should be used. 
ClassCastException  if the range contains elements that are not mutually comparable using the specified comparator, or the search key is not comparable to the elements in the range using this comparator. 

IllegalArgumentException  if fromIndex > toIndex 
ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches a range of
the specified array of bytes for the specified value using the
binary search algorithm.
The range must be sorted (as
by the sort(byte[], int, int)
method)
prior to making this call. If it
is not sorted, the results are undefined. If the range contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches a range of
the specified array of longs for the specified value using the
binary search algorithm.
The range must be sorted (as
by the sort(long[], int, int)
method)
prior to making this call. If it
is not sorted, the results are undefined. If the range contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches the specified array of longs for the specified value using the
binary search algorithm. The array must be sorted (as
by the sort(long[])
method) prior to making this call. If it
is not sorted, the results are undefined. If the array contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

key  the value to be searched for 
Searches the specified array of chars for the specified value using the
binary search algorithm. The array must be sorted (as
by the sort(char[])
method) prior to making this call. If it
is not sorted, the results are undefined. If the array contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

key  the value to be searched for 
Searches a range of
the specified array of shorts for the specified value using
the binary search algorithm.
The range must be sorted
(as by the sort(short[], int, int)
method)
prior to making this call. If
it is not sorted, the results are undefined. If the range contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches the specified array for the specified object using the binary
search algorithm. The array must be sorted into ascending order
according to the specified comparator (as by the
sort(T[], Comparator)
method) prior to making this call. If it is
not sorted, the results are undefined.
If the array contains multiple
elements equal to the specified object, there is no guarantee which one
will be found.
a  the array to be searched 

key  the value to be searched for 
c  the comparator by which the array is ordered. A
null value indicates that the elements'
natural ordering should be used. 
ClassCastException  if the array contains elements that are not mutually comparable using the specified comparator, or the search key is not comparable to the elements of the array using this comparator. 

Searches a range of
the specified array of chars for the specified value using the
binary search algorithm.
The range must be sorted (as
by the sort(char[], int, int)
method)
prior to making this call. If it
is not sorted, the results are undefined. If the range contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches the specified array of shorts for the specified value using
the binary search algorithm. The array must be sorted
(as by the sort(short[])
method) prior to making this call. If
it is not sorted, the results are undefined. If the array contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

key  the value to be searched for 
Searches a range of
the specified array for the specified object using the binary
search algorithm.
The range must be sorted into ascending order
according to the
natural ordering
of its elements (as by the
sort(Object[], int, int)
method) prior to making this
call. If it is not sorted, the results are undefined.
(If the range contains elements that are not mutually comparable (for
example, strings and integers), it cannot be sorted according
to the natural ordering of its elements, hence results are undefined.)
If the range contains multiple
elements equal to the specified object, there is no guarantee which
one will be found.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
ClassCastException  if the search key is not comparable to the elements of the array within the specified range. 

IllegalArgumentException  if fromIndex > toIndex 
ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches the specified array of bytes for the specified value using the
binary search algorithm. The array must be sorted (as
by the sort(byte[])
method) prior to making this call. If it
is not sorted, the results are undefined. If the array contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

key  the value to be searched for 
Searches the specified array of doubles for the specified value using
the binary search algorithm. The array must be sorted
(as by the sort(double[])
method) prior to making this call.
If it is not sorted, the results are undefined. If the array contains
multiple elements with the specified value, there is no guarantee which
one will be found. This method considers all NaN values to be
equivalent and equal.
a  the array to be searched 

key  the value to be searched for 
Searches a range of
the specified array of doubles for the specified value using
the binary search algorithm.
The range must be sorted
(as by the sort(double[], int, int)
method)
prior to making this call.
If it is not sorted, the results are undefined. If the range contains
multiple elements with the specified value, there is no guarantee which
one will be found. This method considers all NaN values to be
equivalent and equal.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches the specified array of floats for the specified value using
the binary search algorithm. The array must be sorted
(as by the sort(float[])
method) prior to making this call. If
it is not sorted, the results are undefined. If the array contains
multiple elements with the specified value, there is no guarantee which
one will be found. This method considers all NaN values to be
equivalent and equal.
a  the array to be searched 

key  the value to be searched for 
Searches the specified array of ints for the specified value using the
binary search algorithm. The array must be sorted (as
by the sort(int[])
method) prior to making this call. If it
is not sorted, the results are undefined. If the array contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

key  the value to be searched for 
Searches a range of
the specified array of floats for the specified value using
the binary search algorithm.
The range must be sorted
(as by the sort(float[], int, int)
method)
prior to making this call. If
it is not sorted, the results are undefined. If the range contains
multiple elements with the specified value, there is no guarantee which
one will be found. This method considers all NaN values to be
equivalent and equal.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Searches the specified array for the specified object using the binary
search algorithm. The array must be sorted into ascending order
according to the
natural ordering
of its elements (as by the
sort(Object[])
method) prior to making this call.
If it is not sorted, the results are undefined.
(If the array contains elements that are not mutually comparable (for
example, strings and integers), it cannot be sorted according
to the natural ordering of its elements, hence results are undefined.)
If the array contains multiple
elements equal to the specified object, there is no guarantee which
one will be found.
a  the array to be searched 

key  the value to be searched for 
ClassCastException  if the search key is not comparable to the elements of the array. 

Searches a range of
the specified array of ints for the specified value using the
binary search algorithm.
The range must be sorted (as
by the sort(int[], int, int)
method)
prior to making this call. If it
is not sorted, the results are undefined. If the range contains
multiple elements with the specified value, there is no guarantee which
one will be found.
a  the array to be searched 

fromIndex  the index of the first element (inclusive) to be searched 
toIndex  the index of the last element (exclusive) to be searched 
key  the value to be searched for 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Copies the specified array, truncating or padding with nulls (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain null. Such indices will exist if and only if the specified length is greater than that of the original array. The resulting array is of the class newType.
original  the array to be copied 

newLength  the length of the copy to be returned 
newType  the class of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
ArrayStoreException  if an element copied from original is not of a runtime type that can be stored in an array of class newType 
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain (short)0. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain 0L. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain 0d. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with false (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain false. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with null characters (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain '\\u000'. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain 0. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain 0f. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain (byte)0. Such indices will exist if and only if the specified length is greater than that of the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified array, truncating or padding with nulls (if necessary) so the copy has the specified length. For all indices that are valid in both the original array and the copy, the two arrays will contain identical values. For any indices that are valid in the copy but not the original, the copy will contain null. Such indices will exist if and only if the specified length is greater than that of the original array. The resulting array is of exactly the same class as the original array.
original  the array to be copied 

newLength  the length of the copy to be returned 
NegativeArraySizeException  if newLength is negative 

NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case (byte)0 is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case null is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
The resulting array is of exactly the same class as the original array.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case null is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from. The resulting array is of the class newType.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
newType  the class of the copy to be returned 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
ArrayStoreException  if an element copied from original is not of a runtime type that can be stored in an array of class newType. 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case 0d is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case 0 is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case 0L is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case false is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case '\\u000' is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case (short)0 is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Copies the specified range of the specified array into a new array. The initial index of the range (from) must lie between zero and original.length, inclusive. The value at original[from] is placed into the initial element of the copy (unless from == original.length or from == to). Values from subsequent elements in the original array are placed into subsequent elements in the copy. The final index of the range (to), which must be greater than or equal to from, may be greater than original.length, in which case 0f is placed in all elements of the copy whose index is greater than or equal to original.length  from. The length of the returned array will be to  from.
original  the array from which a range is to be copied 

from  the initial index of the range to be copied, inclusive 
to  the final index of the range to be copied, exclusive. (This index may lie outside the array.) 
ArrayIndexOutOfBoundsException  if from < 0
or from > original.length 

IllegalArgumentException  if from > to 
NullPointerException  if original is null 
Returns true if the two specified arrays are deeply
equal to one another. Unlike the equals(Object[], Object[])
method, this method is appropriate for use with nested arrays of
arbitrary depth.
Two array references are considered deeply equal if both are null, or if they refer to arrays that contain the same number of elements and all corresponding pairs of elements in the two arrays are deeply equal.
Two possibly null elements e1 and e2 are deeply equal if any of the following conditions hold:
If either of the specified arrays contain themselves as elements either directly or indirectly through one or more levels of arrays, the behavior of this method is undefined.
a1  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns a hash code based on the "deep contents" of the specified array. If the array contains other arrays as elements, the hash code is based on their contents and so on, ad infinitum. It is therefore unacceptable to invoke this method on an array that contains itself as an element, either directly or indirectly through one or more levels of arrays. The behavior of such an invocation is undefined.
For any two arrays a and b such that Arrays.deepEquals(a, b), it is also the case that Arrays.deepHashCode(a) == Arrays.deepHashCode(b).
The computation of the value returned by this method is similar to
that of the value returned by hashCode()
on a list
containing the same elements as a in the same order, with one
difference: If an element e of a is itself an array,
its hash code is computed not by calling e.hashCode(), but as
by calling the appropriate overloading of Arrays.hashCode(e)
if e is an array of a primitive type, or as by calling
Arrays.deepHashCode(e) recursively if e is an array
of a reference type. If a is null, this method
returns 0.
a  the array whose deepcontentbased hash code to compute 

Returns a string representation of the "deep contents" of the specified array. If the array contains other arrays as elements, the string representation contains their contents and so on. This method is designed for converting multidimensional arrays to strings.
The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(Object), unless they are themselves arrays.
If an element e is an array of a primitive type, it is converted to a string as by invoking the appropriate overloading of Arrays.toString(e). If an element e is an array of a reference type, it is converted to a string as by invoking this method recursively.
To avoid infinite recursion, if the specified array contains itself as an element, or contains an indirect reference to itself through one or more levels of arrays, the selfreference is converted to the string "[...]". For example, an array containing only a reference to itself would be rendered as "[[...]]".
This method returns "null" if the specified array is null.
a  the array whose string representation to return 

Returns true if the two specified arrays of chars are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of Objects are equal to one another. The two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. Two objects e1 and e2 are considered equal if (e1==null ? e2==null : e1.equals(e2)). In other words, the two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of ints are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of floats are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
Two floats f1 and f2 are considered equal if:
new Float(f1).equals(new Float(f2))(Unlike the == operator, this method considers NaN equals to itself, and 0.0f unequal to 0.0f.)
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of doubles are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
Two doubles d1 and d2 are considered equal if:
new Double(d1).equals(new Double(d2))(Unlike the == operator, this method considers NaN equals to itself, and 0.0d unequal to 0.0d.)
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of shorts are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of bytes are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of longs are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Returns true if the two specified arrays of booleans are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.
a  one array to be tested for equality 

a2  the other array to be tested for equality 
Assigns the specified boolean value to each element of the specified range of the specified array of booleans. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified int value to each element of the specified array of ints.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified int value to each element of the specified range of the specified array of ints. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified double value to each element of the specified range of the specified array of doubles. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified char value to each element of the specified array of chars.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified float value to each element of the specified array of floats.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified char value to each element of the specified range of the specified array of chars. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified long value to each element of the specified array of longs.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified float value to each element of the specified range of the specified array of floats. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified Object reference to each element of the specified range of the specified array of Objects. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
ArrayStoreException  if the specified value is not of a runtime type that can be stored in the specified array 
Assigns the specified byte value to each element of the specified array of bytes.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified short value to each element of the specified range of the specified array of shorts. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified byte value to each element of the specified range of the specified array of bytes. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified double value to each element of the specified array of doubles.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified long value to each element of the specified range of the specified array of longs. The range to be filled extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be filled is empty.)
a  the array to be filled 

fromIndex  the index of the first element (inclusive) to be filled with the specified value 
toIndex  the index of the last element (exclusive) to be filled with the specified value 
val  the value to be stored in all elements of the array 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Assigns the specified boolean value to each element of the specified array of booleans.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified short value to each element of the specified array of shorts.
a  the array to be filled 

val  the value to be stored in all elements of the array 
Assigns the specified Object reference to each element of the specified array of Objects.
a  the array to be filled 

val  the value to be stored in all elements of the array 
ArrayStoreException  if the specified value is not of a runtime type that can be stored in the specified array 

Returns a hash code based on the contents of the specified array. For any two boolean arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Boolean
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Returns a hash code based on the contents of the specified array. For any two nonnull int arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Integer
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Returns a hash code based on the contents of the specified array. If the array contains other arrays as elements, the hash code is based on their identities rather than their contents. It is therefore acceptable to invoke this method on an array that contains itself as an element, either directly or indirectly through one or more levels of arrays.
For any two arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is equal to the value that would be returned by Arrays.asList(a).hashCode(), unless a is null, in which case 0 is returned.
a  the array whose contentbased hash code to compute 

Returns a hash code based on the contents of the specified array. For any two double arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Double
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Returns a hash code based on the contents of the specified array. For any two short arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Short
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Returns a hash code based on the contents of the specified array. For any two byte arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Byte
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Returns a hash code based on the contents of the specified array. For any two char arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Character
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Returns a hash code based on the contents of the specified array. For any two float arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Float
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Returns a hash code based on the contents of the specified array. For any two long arrays a and b such that Arrays.equals(a, b), it is also the case that Arrays.hashCode(a) == Arrays.hashCode(b).
The value returned by this method is the same value that would be
obtained by invoking the hashCode
method on a List
containing a sequence of Long
instances representing the elements of a in the same order.
If a is null, this method returns 0.
a  the array whose hash value to compute 

Sorts the specified range of the specified array of longs into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified array of chars into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

Sorts the specified range of the specified array of ints into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified array of objects according to the order induced by the specified comparator. All elements in the array must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the array).
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.
a  the array to be sorted 

c  the comparator to determine the order of the array. A
null value indicates that the elements'
natural ordering should be used. 
ClassCastException  if the array contains elements that are not mutually comparable using the specified comparator. 

Sorts the specified array of ints into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

Sorts the specified array of objects into ascending order, according to
the natural ordering
of its elements. All elements in the array
must implement the Comparable
interface. Furthermore, all
elements in the array must be mutually comparable (that is,
e1.compareTo(e2) must not throw a ClassCastException
for any elements e1 and e2 in the array).
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.
a  the array to be sorted 

ClassCastException  if the array contains elements that are not mutually comparable (for example, strings and integers). 

Sorts the specified range of the specified array of chars into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified range of the specified array of doubles into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)
The <
relation does not provide a total order on
all floatingpoint values; although they are distinct numbers
0.0 == 0.0
is true
and a NaN value
compares neither less than, greater than, nor equal to any
floatingpoint value, even itself. To allow the sort to
proceed, instead of using the <
relation to
determine ascending numerical order, this method uses the total
order imposed by compareTo(T)
. This ordering
differs from the <
relation in that
0.0
is treated as less than 0.0
and
NaN is considered greater than any other floatingpoint value.
For the purposes of sorting, all NaN values are considered
equivalent and equal.
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified array of floats into ascending numerical order.
The <
relation does not provide a total order on
all floatingpoint values; although they are distinct numbers
0.0f == 0.0f
is true
and a NaN value
compares neither less than, greater than, nor equal to any
floatingpoint value, even itself. To allow the sort to
proceed, instead of using the <
relation to
determine ascending numerical order, this method uses the total
order imposed by compareTo(T)
. This ordering
differs from the <
relation in that
0.0f
is treated as less than 0.0f
and
NaN is considered greater than any other floatingpoint value.
For the purposes of sorting, all NaN values are considered
equivalent and equal.
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

Sorts the specified range of the specified array of objects according to the order induced by the specified comparator. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.) All elements in the range must be mutually comparable by the specified comparator (that is, c.compare(e1, e2) must not throw a ClassCastException for any elements e1 and e2 in the range).
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
c  the comparator to determine the order of the array. A
null value indicates that the elements'
natural ordering should be used. 
ClassCastException  if the array contains elements that are not mutually comparable using the specified comparator. 

IllegalArgumentException  if fromIndex > toIndex 
ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified range of the specified array of bytes into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified array of longs into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

Sorts the specified range of the specified array of floats into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)
The <
relation does not provide a total order on
all floatingpoint values; although they are distinct numbers
0.0f == 0.0f
is true
and a NaN value
compares neither less than, greater than, nor equal to any
floatingpoint value, even itself. To allow the sort to
proceed, instead of using the <
relation to
determine ascending numerical order, this method uses the total
order imposed by compareTo(T)
. This ordering
differs from the <
relation in that
0.0f
is treated as less than 0.0f
and
NaN is considered greater than any other floatingpoint value.
For the purposes of sorting, all NaN values are considered
equivalent and equal.
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified range of the specified array of shorts into ascending numerical order. The range to be sorted extends from index fromIndex, inclusive, to index toIndex, exclusive. (If fromIndex==toIndex, the range to be sorted is empty.)
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
Sorts the specified array of bytes into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

Sorts the specified array of shorts into ascending numerical order. The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

Sorts the specified range of the specified array of objects into
ascending order, according to the
natural ordering
of its
elements. The range to be sorted extends from index
fromIndex, inclusive, to index toIndex, exclusive.
(If fromIndex==toIndex, the range to be sorted is empty.) All
elements in this range must implement the Comparable
interface. Furthermore, all elements in this range must be mutually
comparable (that is, e1.compareTo(e2) must not throw a
ClassCastException for any elements e1 and
e2 in the array).
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
The sorting algorithm is a modified mergesort (in which the merge is omitted if the highest element in the low sublist is less than the lowest element in the high sublist). This algorithm offers guaranteed n*log(n) performance.
a  the array to be sorted 

fromIndex  the index of the first element (inclusive) to be sorted 
toIndex  the index of the last element (exclusive) to be sorted 
IllegalArgumentException  if fromIndex > toIndex 

ArrayIndexOutOfBoundsException  if fromIndex < 0 or toIndex > a.length 
ClassCastException  if the array contains elements that are not mutually comparable (for example, strings and integers). 
Sorts the specified array of doubles into ascending numerical order.
The <
relation does not provide a total order on
all floatingpoint values; although they are distinct numbers
0.0 == 0.0
is true
and a NaN value
compares neither less than, greater than, nor equal to any
floatingpoint value, even itself. To allow the sort to
proceed, instead of using the <
relation to
determine ascending numerical order, this method uses the total
order imposed by compareTo(T)
. This ordering
differs from the <
relation in that
0.0
is treated as less than 0.0
and
NaN is considered greater than any other floatingpoint value.
For the purposes of sorting, all NaN values are considered
equivalent and equal.
The sorting algorithm is a tuned quicksort, adapted from Jon L. Bentley and M. Douglas McIlroy's "Engineering a Sort Function", SoftwarePractice and Experience, Vol. 23(11) P. 12491265 (November 1993). This algorithm offers n*log(n) performance on many data sets that cause other quicksorts to degrade to quadratic performance.
a  the array to be sorted 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(long). Returns "null" if a is null.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(int). Returns "null" if a is null.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(char). Returns "null" if a is null.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(boolean). Returns "null" if a is null.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(byte). Returns "null" if a is null.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(float). Returns "null" if a is null.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(short). Returns "null" if a is null.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array.
If the array contains other arrays as elements, they are converted to
strings by the toString()
method inherited from
Object, which describes their identities rather than
their contents.
The value returned by this method is equal to the value that would be returned by Arrays.asList(a).toString(), unless a is null, in which case "null" is returned.
a  the array whose string representation to return 

Returns a string representation of the contents of the specified array. The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(double). Returns "null" if a is null.
a  the array whose string representation to return 
