public final class Arrays extends Object
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 brief descriptions 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.
Modifier and Type | Method | Description |
---|---|---|
static <T> List |
asList |
Returns a fixed-size list backed by the specified array. |
static int |
binarySearch |
Searches the specified array of bytes for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array of bytes for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches the specified array of chars for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array of chars for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches the specified array of doubles for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array of doubles for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches the specified array of floats for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array of floats for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches the specified array of ints for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array of ints for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array of longs for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches the specified array of longs for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array of shorts for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches the specified array of shorts for the specified value using the binary search algorithm. |
static int |
binarySearch |
Searches a range of the specified array for the specified object using the binary search algorithm. |
static int |
binarySearch |
Searches the specified array for the specified object using the binary search algorithm. |
static <T> int |
binarySearch |
Searches a range of the specified array for the specified object using the binary search algorithm. |
static <T> int |
binarySearch |
Searches the specified array for the specified object using the binary search algorithm. |
static int |
compare |
Compares two boolean arrays lexicographically. |
static int |
compare |
Compares two boolean arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two byte arrays lexicographically. |
static int |
compare |
Compares two byte arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two char arrays lexicographically. |
static int |
compare |
Compares two char arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two double arrays lexicographically. |
static int |
compare |
Compares two double arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two float arrays lexicographically. |
static int |
compare |
Compares two float arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two int arrays lexicographically. |
static int |
compare |
Compares two int arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two long arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two long arrays lexicographically. |
static int |
compare |
Compares two short arrays lexicographically over the specified ranges. |
static int |
compare |
Compares two short arrays lexicographically. |
static <T extends Comparable<? super T>> |
compare |
Compares two Object arrays lexicographically over the specified ranges. |
static <T> int |
compare |
Compares two Object arrays lexicographically over the specified ranges. |
static <T extends Comparable<? super T>> |
compare |
Compares two Object arrays, within comparable elements, lexicographically. |
static <T> int |
compare |
Compares two Object arrays lexicographically using a specified comparator. |
static int |
compareUnsigned |
Compares two byte arrays lexicographically, numerically treating elements as unsigned. |
static int |
compareUnsigned |
Compares two byte arrays lexicographically over the specified ranges, numerically treating elements as unsigned. |
static int |
compareUnsigned |
Compares two int arrays lexicographically, numerically treating elements as unsigned. |
static int |
compareUnsigned |
Compares two int arrays lexicographically over the specified ranges, numerically treating elements as unsigned. |
static int |
compareUnsigned |
Compares two long arrays lexicographically over the specified ranges, numerically treating elements as unsigned. |
static int |
compareUnsigned |
Compares two long arrays lexicographically, numerically treating elements as unsigned. |
static int |
compareUnsigned |
Compares two short arrays lexicographically over the specified ranges, numerically treating elements as unsigned. |
static int |
compareUnsigned |
Compares two short arrays lexicographically, numerically treating elements as unsigned. |
static boolean[] |
copyOf |
Copies the specified array, truncating or padding with false (if necessary) so the copy has the specified length. |
static byte[] |
copyOf |
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. |
static char[] |
copyOf |
Copies the specified array, truncating or padding with null characters (if necessary) so the copy has the specified length. |
static double[] |
copyOf |
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. |
static float[] |
copyOf |
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. |
static int[] |
copyOf |
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. |
static long[] |
copyOf |
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. |
static short[] |
copyOf |
Copies the specified array, truncating or padding with zeros (if necessary) so the copy has the specified length. |
static <T> T[] |
copyOf |
Copies the specified array, truncating or padding with nulls (if necessary) so the copy has the specified length. |
static <T, |
copyOf |
Copies the specified array, truncating or padding with nulls (if necessary) so the copy has the specified length. |
static boolean[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static byte[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static char[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static double[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static float[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static int[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static long[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static short[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static <T> T[] |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static <T, |
copyOfRange |
Copies the specified range of the specified array into a new array. |
static boolean |
deepEquals |
Returns true if the two specified arrays are deeply equal to one another. |
static int |
deepHashCode |
Returns a hash code based on the "deep contents" of the specified array. |
static String |
deepToString |
Returns a string representation of the "deep contents" of the specified array. |
static boolean |
equals |
Returns true if the two specified arrays of booleans are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of booleans, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of bytes are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of bytes, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of chars are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of chars, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of doubles are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of doubles, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of floats are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of floats, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of ints are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of ints, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of longs, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of longs are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of shorts, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of shorts are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of Objects, over the specified ranges, are equal to one another. |
static boolean |
equals |
Returns true if the two specified arrays of Objects are equal to one another. |
static <T> boolean |
equals |
Returns true if the two specified arrays of Objects, over the specified ranges, are equal to one another. |
static <T> boolean |
equals |
Returns true if the two specified arrays of Objects are equal to one another. |
static void |
fill |
Assigns the specified boolean value to each element of the specified array of booleans. |
static void |
fill |
Assigns the specified boolean value to each element of the specified range of the specified array of booleans. |
static void |
fill |
Assigns the specified byte value to each element of the specified array of bytes. |
static void |
fill |
Assigns the specified byte value to each element of the specified range of the specified array of bytes. |
static void |
fill |
Assigns the specified char value to each element of the specified array of chars. |
static void |
fill |
Assigns the specified char value to each element of the specified range of the specified array of chars. |
static void |
fill |
Assigns the specified double value to each element of the specified array of doubles. |
static void |
fill |
Assigns the specified double value to each element of the specified range of the specified array of doubles. |
static void |
fill |
Assigns the specified float value to each element of the specified array of floats. |
static void |
fill |
Assigns the specified float value to each element of the specified range of the specified array of floats. |
static void |
fill |
Assigns the specified int value to each element of the specified array of ints. |
static void |
fill |
Assigns the specified int value to each element of the specified range of the specified array of ints. |
static void |
fill |
Assigns the specified long value to each element of the specified range of the specified array of longs. |
static void |
fill |
Assigns the specified long value to each element of the specified array of longs. |
static void |
fill |
Assigns the specified short value to each element of the specified range of the specified array of shorts. |
static void |
fill |
Assigns the specified short value to each element of the specified array of shorts. |
static void |
fill |
Assigns the specified Object reference to each element of the specified range of the specified array of Objects. |
static void |
fill |
Assigns the specified Object reference to each element of the specified array of Objects. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
hashCode |
Returns a hash code based on the contents of the specified array. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two boolean arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two boolean arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two byte arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two byte arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two char arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two char arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two double arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two double arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two float arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two float arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two int arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two int arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two long arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two long arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two short arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two short arrays, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the relative index of the first mismatch between two Object arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static int |
mismatch |
Finds and returns the index of the first mismatch between two Object arrays, otherwise return -1 if no mismatch is found. |
static <T> int |
mismatch |
Finds and returns the relative index of the first mismatch between two Object arrays over the specified ranges, otherwise return -1 if no mismatch is found. |
static <T> int |
mismatch |
Finds and returns the index of the first mismatch between two Object arrays, otherwise return -1 if no mismatch is found. |
static void |
parallelPrefix |
Performs parallelPrefix(double[], DoubleBinaryOperator) for the given subrange of the array. |
static void |
parallelPrefix |
Cumulates, in parallel, each element of the given array in place, using the supplied function. |
static void |
parallelPrefix |
Performs parallelPrefix(int[], IntBinaryOperator) for the given subrange of the array. |
static void |
parallelPrefix |
Cumulates, in parallel, each element of the given array in place, using the supplied function. |
static void |
parallelPrefix |
Performs parallelPrefix(long[], LongBinaryOperator) for the given subrange of the array. |
static void |
parallelPrefix |
Cumulates, in parallel, each element of the given array in place, using the supplied function. |
static <T> void |
parallelPrefix |
Performs parallelPrefix(Object[], BinaryOperator) for the given subrange of the array. |
static <T> void |
parallelPrefix |
Cumulates, in parallel, each element of the given array in place, using the supplied function. |
static void |
parallelSetAll |
Set all elements of the specified array, in parallel, using the provided generator function to compute each element. |
static void |
parallelSetAll |
Set all elements of the specified array, in parallel, using the provided generator function to compute each element. |
static void |
parallelSetAll |
Set all elements of the specified array, in parallel, using the provided generator function to compute each element. |
static <T> void |
parallelSetAll |
Set all elements of the specified array, in parallel, using the provided generator function to compute each element. |
static void |
parallelSort |
Sorts the specified array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified range of the array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified range of the array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified range of the array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified range of the array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified range of the array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified range of the array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified array into ascending numerical order. |
static void |
parallelSort |
Sorts the specified range of the array into ascending numerical order. |
static <T extends Comparable<? super T>> |
parallelSort |
Sorts the specified array of objects into ascending order, according to the natural ordering of its elements. |
static <T extends Comparable<? super T>> |
parallelSort |
Sorts the specified range of the specified array of objects into ascending order, according to the natural ordering of its elements. |
static <T> void |
parallelSort |
Sorts the specified range of the specified array of objects according to the order induced by the specified comparator. |
static <T> void |
parallelSort |
Sorts the specified array of objects according to the order induced by the specified comparator. |
static void |
setAll |
Set all elements of the specified array, using the provided generator function to compute each element. |
static void |
setAll |
Set all elements of the specified array, using the provided generator function to compute each element. |
static void |
setAll |
Set all elements of the specified array, using the provided generator function to compute each element. |
static <T> void |
setAll |
Set all elements of the specified array, using the provided generator function to compute each element. |
static void |
sort |
Sorts the specified array into ascending numerical order. |
static void |
sort |
Sorts the specified range of the array into ascending order. |
static void |
sort |
Sorts the specified array into ascending numerical order. |
static void |
sort |
Sorts the specified range of the array into ascending order. |
static void |
sort |
Sorts the specified array into ascending numerical order. |
static void |
sort |
Sorts the specified range of the array into ascending order. |
static void |
sort |
Sorts the specified array into ascending numerical order. |
static void |
sort |
Sorts the specified range of the array into ascending order. |
static void |
sort |
Sorts the specified array into ascending numerical order. |
static void |
sort |
Sorts the specified range of the array into ascending order. |
static void |
sort |
Sorts the specified array into ascending numerical order. |
static void |
sort |
Sorts the specified range of the array into ascending order. |
static void |
sort |
Sorts the specified array into ascending numerical order. |
static void |
sort |
Sorts the specified range of the array into ascending order. |
static void |
sort |
Sorts the specified array of objects into ascending order, according to the natural ordering of its elements. |
static void |
sort |
Sorts the specified range of the specified array of objects into ascending order, according to the natural ordering of its elements. |
static <T> void |
sort |
Sorts the specified range of the specified array of objects according to the order induced by the specified comparator. |
static <T> void |
sort |
Sorts the specified array of objects according to the order induced by the specified comparator. |
static Spliterator.OfDouble |
spliterator |
Returns a Spliterator.OfDouble covering all of the specified array. |
static Spliterator.OfDouble |
spliterator |
Returns a Spliterator.OfDouble covering the specified range of the specified array. |
static Spliterator.OfInt |
spliterator |
Returns a Spliterator.OfInt covering all of the specified array. |
static Spliterator.OfInt |
spliterator |
Returns a Spliterator.OfInt covering the specified range of the specified array. |
static Spliterator.OfLong |
spliterator |
Returns a Spliterator.OfLong covering all of the specified array. |
static Spliterator.OfLong |
spliterator |
Returns a Spliterator.OfLong covering the specified range of the specified array. |
static <T> Spliterator |
spliterator |
Returns a Spliterator covering all of the specified array. |
static <T> Spliterator |
spliterator |
Returns a Spliterator covering the specified range of the specified array. |
static DoubleStream |
stream |
Returns a sequential DoubleStream with the specified array as its source. |
static DoubleStream |
stream |
Returns a sequential DoubleStream with the specified range of the specified array as its source. |
static IntStream |
stream |
Returns a sequential IntStream with the specified array as its source. |
static IntStream |
stream |
Returns a sequential IntStream with the specified range of the specified array as its source. |
static LongStream |
stream |
Returns a sequential LongStream with the specified array as its source. |
static LongStream |
stream |
Returns a sequential LongStream with the specified range of the specified array as its source. |
static <T> Stream |
stream |
Returns a sequential Stream with the specified array as its source. |
static <T> Stream |
stream |
Returns a sequential Stream with the specified range of the specified array as its source. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
static String |
toString |
Returns a string representation of the contents of the specified array. |
public static void sort(int[] a)
a
- the array to be sortedpublic static void sort(int[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void sort(long[] a)
a
- the array to be sortedpublic static void sort(long[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void sort(short[] a)
a
- the array to be sortedpublic static void sort(short[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void sort(char[] a)
a
- the array to be sortedpublic static void sort(char[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void sort(byte[] a)
a
- the array to be sortedpublic static void sort(byte[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void sort(float[] a)
The <
relation does not provide a total order on all float values: -0.0f == 0.0f
is true
and a Float.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Float.compareTo(java.lang.Float)
: -0.0f
is treated as less than value 0.0f
and Float.NaN
is considered greater than any other value and all Float.NaN
values are considered equal.
a
- the array to be sortedpublic static void sort(float[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty. The <
relation does not provide a total order on all float values: -0.0f == 0.0f
is true
and a Float.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Float.compareTo(java.lang.Float)
: -0.0f
is treated as less than value 0.0f
and Float.NaN
is considered greater than any other value and all Float.NaN
values are considered equal.
a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void sort(double[] a)
The <
relation does not provide a total order on all double values: -0.0d == 0.0d
is true
and a Double.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Double.compareTo(java.lang.Double)
: -0.0d
is treated as less than value 0.0d
and Double.NaN
is considered greater than any other value and all Double.NaN
values are considered equal.
a
- the array to be sortedpublic static void sort(double[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty. The <
relation does not provide a total order on all double values: -0.0d == 0.0d
is true
and a Double.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Double.compareTo(java.lang.Double)
: -0.0d
is treated as less than value 0.0d
and Double.NaN
is considered greater than any other value and all Double.NaN
values are considered equal.
a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void parallelSort(byte[] a)
a
- the array to be sortedpublic static void parallelSort(byte[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void parallelSort(char[] a)
a
- the array to be sortedpublic static void parallelSort(char[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void parallelSort(short[] a)
a
- the array to be sortedpublic static void parallelSort(short[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void parallelSort(int[] a)
a
- the array to be sortedpublic static void parallelSort(int[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void parallelSort(long[] a)
a
- the array to be sortedpublic static void parallelSort(long[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty.a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void parallelSort(float[] a)
The <
relation does not provide a total order on all float values: -0.0f == 0.0f
is true
and a Float.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Float.compareTo(java.lang.Float)
: -0.0f
is treated as less than value 0.0f
and Float.NaN
is considered greater than any other value and all Float.NaN
values are considered equal.
a
- the array to be sortedpublic static void parallelSort(float[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty. The <
relation does not provide a total order on all float values: -0.0f == 0.0f
is true
and a Float.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Float.compareTo(java.lang.Float)
: -0.0f
is treated as less than value 0.0f
and Float.NaN
is considered greater than any other value and all Float.NaN
values are considered equal.
a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void parallelSort(double[] a)
The <
relation does not provide a total order on all double values: -0.0d == 0.0d
is true
and a Double.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Double.compareTo(java.lang.Double)
: -0.0d
is treated as less than value 0.0d
and Double.NaN
is considered greater than any other value and all Double.NaN
values are considered equal.
a
- the array to be sortedpublic static void parallelSort(double[] a, int fromIndex, int toIndex)
fromIndex
, inclusive, to the index toIndex
, exclusive. If fromIndex == toIndex
, the range to be sorted is empty. The <
relation does not provide a total order on all double values: -0.0d == 0.0d
is true
and a Double.NaN
value compares neither less than, greater than, nor equal to any value, even itself. This method uses the total order imposed by the method Double.compareTo(java.lang.Double)
: -0.0d
is treated as less than value 0.0d
and Double.NaN
is considered greater than any other value and all Double.NaN
values are considered equal.
a
- the array to be sortedfromIndex
- the index of the first element, inclusive, to be sortedtoIndex
- the index of the last element, exclusive, to be sortedIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static <T extends Comparable<? super T>> void parallelSort(T[] a)
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.
Arrays.sort
method. If the length of the specified array is less than the minimum granularity, then it is sorted using the appropriate Arrays.sort
method. The algorithm requires a working space no greater than the size of the original array. The ForkJoin common pool
is used to execute any parallel tasks.T
- the class of the objects to be sorteda
- the array to be sortedClassCastException
- if the array contains elements that are not mutually comparable (for example, strings and integers)IllegalArgumentException
- (optional) if the natural ordering of the array elements is found to violate the Comparable
contractpublic static <T extends Comparable<? super T>> void parallelSort(T[] a, int fromIndex, int toIndex)
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.
Arrays.sort
method. If the length of the specified array is less than the minimum granularity, then it is sorted using the appropriate Arrays.sort
method. The algorithm requires a working space no greater than the size of the specified range of the original array. The ForkJoin common pool
is used to execute any parallel tasks.T
- the class of the objects to be sorteda
- the array to be sortedfromIndex
- the index of the first element (inclusive) to be sortedtoIndex
- the index of the last element (exclusive) to be sortedIllegalArgumentException
- if fromIndex > toIndex
or (optional) if the natural ordering of the array elements is found to violate the Comparable
contractArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
ClassCastException
- if the array contains elements that are not mutually comparable (for example, strings and integers).public static <T> void parallelSort(T[] a, Comparator<? super T> cmp)
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.
Arrays.sort
method. If the length of the specified array is less than the minimum granularity, then it is sorted using the appropriate Arrays.sort
method. The algorithm requires a working space no greater than the size of the original array. The ForkJoin common pool
is used to execute any parallel tasks.T
- the class of the objects to be sorteda
- the array to be sortedcmp
- 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 comparatorIllegalArgumentException
- (optional) if the comparator is found to violate the Comparator
contractpublic static <T> void parallelSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> cmp)
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.
Arrays.sort
method. If the length of the specified array is less than the minimum granularity, then it is sorted using the appropriate Arrays.sort
method. The algorithm requires a working space no greater than the size of the specified range of the original array. The ForkJoin common pool
is used to execute any parallel tasks.T
- the class of the objects to be sorteda
- the array to be sortedfromIndex
- the index of the first element (inclusive) to be sortedtoIndex
- the index of the last element (exclusive) to be sortedcmp
- the comparator to determine the order of the array. A null
value indicates that the elements' natural ordering should be used.IllegalArgumentException
- if fromIndex > toIndex
or (optional) if the natural ordering of the array elements is found to violate the Comparable
contractArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
ClassCastException
- if the array contains elements that are not mutually comparable (for example, strings and integers).public static void sort(Object[] a)
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.
Implementation note: This implementation is a stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when the input array is partially sorted, while offering the performance of a traditional mergesort when the input array is randomly ordered. If the input array is nearly sorted, the implementation requires approximately n comparisons. Temporary storage requirements vary from a small constant for nearly sorted input arrays to n/2 object references for randomly ordered input arrays.
The implementation takes equal advantage of ascending and descending order in its input array, and can take advantage of ascending and descending order in different parts of the same input array. It is well-suited to merging two or more sorted arrays: simply concatenate the arrays and sort the resulting array.
The implementation was adapted from Tim Peters's list sort for Python ( TimSort). It uses techniques from Peter McIlroy's "Optimistic Sorting and Information Theoretic Complexity", in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, January 1993.
a
- the array to be sortedClassCastException
- if the array contains elements that are not mutually comparable (for example, strings and integers)IllegalArgumentException
- (optional) if the natural ordering of the array elements is found to violate the Comparable
contractpublic static void sort(Object[] a, int fromIndex, int toIndex)
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.
Implementation note: This implementation is a stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when the input array is partially sorted, while offering the performance of a traditional mergesort when the input array is randomly ordered. If the input array is nearly sorted, the implementation requires approximately n comparisons. Temporary storage requirements vary from a small constant for nearly sorted input arrays to n/2 object references for randomly ordered input arrays.
The implementation takes equal advantage of ascending and descending order in its input array, and can take advantage of ascending and descending order in different parts of the same input array. It is well-suited to merging two or more sorted arrays: simply concatenate the arrays and sort the resulting array.
The implementation was adapted from Tim Peters's list sort for Python ( TimSort). It uses techniques from Peter McIlroy's "Optimistic Sorting and Information Theoretic Complexity", in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, January 1993.
a
- the array to be sortedfromIndex
- the index of the first element (inclusive) to be sortedtoIndex
- the index of the last element (exclusive) to be sortedIllegalArgumentException
- if fromIndex > toIndex
or (optional) if the natural ordering of the array elements is found to violate the Comparable
contractArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
ClassCastException
- if the array contains elements that are not mutually comparable (for example, strings and integers).public static <T> void sort(T[] a, Comparator<? super T> c)
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.
Implementation note: This implementation is a stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when the input array is partially sorted, while offering the performance of a traditional mergesort when the input array is randomly ordered. If the input array is nearly sorted, the implementation requires approximately n comparisons. Temporary storage requirements vary from a small constant for nearly sorted input arrays to n/2 object references for randomly ordered input arrays.
The implementation takes equal advantage of ascending and descending order in its input array, and can take advantage of ascending and descending order in different parts of the same input array. It is well-suited to merging two or more sorted arrays: simply concatenate the arrays and sort the resulting array.
The implementation was adapted from Tim Peters's list sort for Python ( TimSort). It uses techniques from Peter McIlroy's "Optimistic Sorting and Information Theoretic Complexity", in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, January 1993.
T
- the class of the objects to be sorteda
- the array to be sortedc
- 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 comparatorIllegalArgumentException
- (optional) if the comparator is found to violate the Comparator
contractpublic static <T> void sort(T[] a, int fromIndex, int toIndex, Comparator<? super T> c)
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.
Implementation note: This implementation is a stable, adaptive, iterative mergesort that requires far fewer than n lg(n) comparisons when the input array is partially sorted, while offering the performance of a traditional mergesort when the input array is randomly ordered. If the input array is nearly sorted, the implementation requires approximately n comparisons. Temporary storage requirements vary from a small constant for nearly sorted input arrays to n/2 object references for randomly ordered input arrays.
The implementation takes equal advantage of ascending and descending order in its input array, and can take advantage of ascending and descending order in different parts of the same input array. It is well-suited to merging two or more sorted arrays: simply concatenate the arrays and sort the resulting array.
The implementation was adapted from Tim Peters's list sort for Python ( TimSort). It uses techniques from Peter McIlroy's "Optimistic Sorting and Information Theoretic Complexity", in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 467-474, January 1993.
T
- the class of the objects to be sorteda
- the array to be sortedfromIndex
- the index of the first element (inclusive) to be sortedtoIndex
- the index of the last element (exclusive) to be sortedc
- 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
or (optional) if the comparator is found to violate the Comparator
contractArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static <T> void parallelPrefix(T[] array, BinaryOperator<T> op)
[2, 1, 0, 3]
and the operation performs addition, then upon return the array holds [2, 3, 3, 6]
. Parallel prefix computation is usually more efficient than sequential loops for large arrays.T
- the class of the objects in the arrayarray
- the array, which is modified in-place by this methodop
- a side-effect-free, associative function to perform the cumulationNullPointerException
- if the specified array or function is nullpublic static <T> void parallelPrefix(T[] array, int fromIndex, int toIndex, BinaryOperator<T> op)
parallelPrefix(Object[], BinaryOperator)
for the given subrange of the array.T
- the class of the objects in the arrayarray
- the arrayfromIndex
- the index of the first element, inclusivetoIndex
- the index of the last element, exclusiveop
- a side-effect-free, associative function to perform the cumulationIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > array.length
NullPointerException
- if the specified array or function is nullpublic static void parallelPrefix(long[] array, LongBinaryOperator op)
[2, 1, 0, 3]
and the operation performs addition, then upon return the array holds [2, 3, 3, 6]
. Parallel prefix computation is usually more efficient than sequential loops for large arrays.array
- the array, which is modified in-place by this methodop
- a side-effect-free, associative function to perform the cumulationNullPointerException
- if the specified array or function is nullpublic static void parallelPrefix(long[] array, int fromIndex, int toIndex, LongBinaryOperator op)
parallelPrefix(long[], LongBinaryOperator)
for the given subrange of the array.array
- the arrayfromIndex
- the index of the first element, inclusivetoIndex
- the index of the last element, exclusiveop
- a side-effect-free, associative function to perform the cumulationIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > array.length
NullPointerException
- if the specified array or function is nullpublic static void parallelPrefix(double[] array, DoubleBinaryOperator op)
[2.0, 1.0, 0.0, 3.0]
and the operation performs addition, then upon return the array holds [2.0, 3.0, 3.0, 6.0]
. Parallel prefix computation is usually more efficient than sequential loops for large arrays. Because floating-point operations may not be strictly associative, the returned result may not be identical to the value that would be obtained if the operation was performed sequentially.
array
- the array, which is modified in-place by this methodop
- a side-effect-free function to perform the cumulationNullPointerException
- if the specified array or function is nullpublic static void parallelPrefix(double[] array, int fromIndex, int toIndex, DoubleBinaryOperator op)
parallelPrefix(double[], DoubleBinaryOperator)
for the given subrange of the array.array
- the arrayfromIndex
- the index of the first element, inclusivetoIndex
- the index of the last element, exclusiveop
- a side-effect-free, associative function to perform the cumulationIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > array.length
NullPointerException
- if the specified array or function is nullpublic static void parallelPrefix(int[] array, IntBinaryOperator op)
[2, 1, 0, 3]
and the operation performs addition, then upon return the array holds [2, 3, 3, 6]
. Parallel prefix computation is usually more efficient than sequential loops for large arrays.array
- the array, which is modified in-place by this methodop
- a side-effect-free, associative function to perform the cumulationNullPointerException
- if the specified array or function is nullpublic static void parallelPrefix(int[] array, int fromIndex, int toIndex, IntBinaryOperator op)
parallelPrefix(int[], IntBinaryOperator)
for the given subrange of the array.array
- the arrayfromIndex
- the index of the first element, inclusivetoIndex
- the index of the last element, exclusiveop
- a side-effect-free, associative function to perform the cumulationIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > array.length
NullPointerException
- if the specified array or function is nullpublic static int binarySearch(long[] a, long key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.public static int binarySearch(long[] a, int fromIndex, int toIndex, long key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.IllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0 or toIndex > a.length
public static int binarySearch(int[] a, int key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.public static int binarySearch(int[] a, int fromIndex, int toIndex, int key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.IllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0 or toIndex > a.length
public static int binarySearch(short[] a, short key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.public static int binarySearch(short[] a, int fromIndex, int toIndex, short key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.IllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0 or toIndex > a.length
public static int binarySearch(char[] a, char key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.public static int binarySearch(char[] a, int fromIndex, int toIndex, char key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.IllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0 or toIndex > a.length
public static int binarySearch(byte[] a, byte key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.public static int binarySearch(byte[] a, int fromIndex, int toIndex, byte key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.IllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0 or toIndex > a.length
public static int binarySearch(double[] a, double key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.public static int binarySearch(double[] a, int fromIndex, int toIndex, double key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.IllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0 or toIndex > a.length
public static int binarySearch(float[] a, float key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.public static int binarySearch(float[] a, int fromIndex, int toIndex, float key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.IllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0 or toIndex > a.length
public static int binarySearch(Object[] a, Object key)
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 searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.ClassCastException
- if the search key is not comparable to the elements of the array.public static int binarySearch(Object[] a, int fromIndex, int toIndex, Object key)
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 searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched for(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.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
public static <T> int binarySearch(T[] a, T key, Comparator<? super T> c)
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.T
- the class of the objects in the arraya
- the array to be searchedkey
- the value to be searched forc
- the comparator by which the array is ordered. A null
value indicates that the elements' natural ordering should be used.(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length
if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.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.public static <T> int binarySearch(T[] a, int fromIndex, int toIndex, T key, Comparator<? super T> c)
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.T
- the class of the objects in the arraya
- the array to be searchedfromIndex
- the index of the first element (inclusive) to be searchedtoIndex
- the index of the last element (exclusive) to be searchedkey
- the value to be searched forc
- the comparator by which the array is ordered. A null
value indicates that the elements' natural ordering should be used.(-(insertion point) - 1)
. The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element in the range greater than the key, or toIndex
if all elements in the range are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found.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
public static boolean equals(long[] a, long[] a2)
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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(int[] a, int[] a2)
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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(short[] a, short[] a2)
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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(char[] a, char[] a2)
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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(byte[] a, byte[] a2)
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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(boolean[] a, boolean[] a2)
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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(double[] a, double[] a2)
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: Double.valueOf(d1).equals(Double.valueOf(d2))
(Unlike the ==
operator, this method considers NaN
equal to itself, and 0.0d unequal to -0.0d.)a
- one array to be tested for equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
Two doubles d1
and d2
are considered equal if:
Double.valueOf(d1).equals(Double.valueOf(d2))
(Unlike the ==
operator, this method considers NaN
equal to itself, and 0.0d unequal to -0.0d.)a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(float[] a, float[] a2)
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: Float.valueOf(f1).equals(Float.valueOf(f2))
(Unlike the ==
operator, this method considers NaN
equal to itself, and 0.0f unequal to -0.0f.)a
- one array to be tested for equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
Two floats f1
and f2
are considered equal if:
Float.valueOf(f1).equals(Float.valueOf(f2))
(Unlike the ==
operator, this method considers NaN
equal to itself, and 0.0f unequal to -0.0f.)a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static boolean equals(Object[] a, Object[] a2)
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 Objects.equals(e1, 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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static boolean equals(Object[] a, int aFromIndex, int aToIndex, Object[] b, int bFromIndex, int bToIndex)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
Two objects e1
and e2
are considered equal if Objects.equals(e1, e2)
.
a
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedtrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static <T> boolean equals(T[] a, T[] a2, Comparator<? super T> cmp)
true
if the two specified arrays of Objects 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, 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
.
Two objects e1
and e2
are considered equal if, given the specified comparator, cmp.compare(e1, e2) == 0
.
T
- the type of array elementsa
- one array to be tested for equalitya2
- the other array to be tested for equalitycmp
- the comparator to compare array elementstrue
if the two arrays are equalNullPointerException
- if the comparator is null
public static <T> boolean equals(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp)
Two arrays are considered equal if the number of elements covered by each range is the same, and all corresponding pairs of elements over the specified ranges in the two arrays are equal. In other words, two arrays are equal if they contain, over the specified ranges, the same elements in the same order.
Two objects e1
and e2
are considered equal if, given the specified comparator, cmp.compare(e1, e2) == 0
.
T
- the type of array elementsa
- the first array to be tested for equalityaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for equalitybFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedcmp
- the comparator to compare array elementstrue
if the two arrays, over the specified ranges, are equalIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array or the comparator is null
public static void fill(long[] a, long val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(long[] a, int fromIndex, int toIndex, long val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(int[] a, int val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(int[] a, int fromIndex, int toIndex, int val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(short[] a, short val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(short[] a, int fromIndex, int toIndex, short val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(char[] a, char val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(char[] a, int fromIndex, int toIndex, char val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(byte[] a, byte val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(byte[] a, int fromIndex, int toIndex, byte val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(boolean[] a, boolean val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(boolean[] a, int fromIndex, int toIndex, boolean val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(double[] a, double val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(double[] a, int fromIndex, int toIndex, double val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(float[] a, float val)
a
- the array to be filledval
- the value to be stored in all elements of the arraypublic static void fill(float[] a, int fromIndex, int toIndex, float val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- if fromIndex > toIndex
ArrayIndexOutOfBoundsException
- if fromIndex < 0
or toIndex > a.length
public static void fill(Object[] a, Object val)
a
- the array to be filledval
- the value to be stored in all elements of the arrayArrayStoreException
- if the specified value is not of a runtime type that can be stored in the specified arraypublic static void fill(Object[] a, int fromIndex, int toIndex, Object val)
fromIndex
, inclusive, to index toIndex
, exclusive. (If fromIndex==toIndex
, the range to be filled is empty.)a
- the array to be filledfromIndex
- the index of the first element (inclusive) to be filled with the specified valuetoIndex
- the index of the last element (exclusive) to be filled with the specified valueval
- the value to be stored in all elements of the arrayIllegalArgumentException
- 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 arraypublic static <T> T[] copyOf(T[] original, int newLength)
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.T
- the class of the objects in the arrayoriginal
- the array to be copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static <T, U> T[] copyOf(U[] original, int newLength, Class<? extends T[]> newType)
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
.T
- the class of the objects in the returned arrayU
- the class of the objects in the original arrayoriginal
- the array to be copiednewLength
- the length of the copy to be returnednewType
- the class of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullArrayStoreException
- if an element copied from original
is not of a runtime type that can be stored in an array of class newType
public static byte[] copyOf(byte[] original, int newLength)
(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 copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static short[] copyOf(short[] original, int newLength)
(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 copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static int[] copyOf(int[] original, int newLength)
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 copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static long[] copyOf(long[] original, int newLength)
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 copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static char[] copyOf(char[] original, int newLength)
'\u0000'
. Such indices will exist if and only if the specified length is greater than that of the original array.original
- the array to be copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static float[] copyOf(float[] original, int newLength)
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 copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static double[] copyOf(double[] original, int newLength)
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 copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static boolean[] copyOf(boolean[] original, int newLength)
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 copiednewLength
- the length of the copy to be returnedNegativeArraySizeException
- if newLength
is negativeNullPointerException
- if original
is nullpublic static <T> T[] copyOfRange(T[] original, int from, int to)
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.
T
- the class of the objects in the arrayoriginal
- the array from which a range is to be copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static <T, U> T[] copyOfRange(U[] original, int from, int to, Class<? extends T[]> newType)
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
.T
- the class of the objects in the returned arrayU
- the class of the objects in the original arrayoriginal
- the array from which a range is to be copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 returnedArrayIndexOutOfBoundsException
- if from < 0
or from > original.length
IllegalArgumentException
- if from > to
NullPointerException
- if original
is nullArrayStoreException
- if an element copied from original
is not of a runtime type that can be stored in an array of class newType
.public static byte[] copyOfRange(byte[] original, int from, int to)
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static short[] copyOfRange(short[] original, int from, int to)
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static int[] copyOfRange(int[] original, int from, int to)
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static long[] copyOfRange(long[] original, int from, int to)
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static char[] copyOfRange(char[] original, int from, int to)
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 '\u0000'
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static float[] copyOfRange(float[] original, int from, int to)
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static double[] copyOfRange(double[] original, int from, int to)
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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 nullpublic static boolean[] copyOfRange(boolean[] original, int from, int to)
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 copiedfrom
- the initial index of the range to be copied, inclusiveto
- 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@SafeVarargs public static <T> List<T> asList(T... a)
Serializable
and implements RandomAccess
. The returned list implements the optional Collection
methods, except those that would change the size of the returned list. Those methods leave the list unchanged and throw UnsupportedOperationException
.
If the specified array's actual component type differs from the type parameter T, this can result in operations on the returned list throwing an ArrayStoreException
.
Collection.toArray()
. This method provides a way to wrap an existing array:
Integer[] numbers = ...
...
List<Integer> values = Arrays.asList(numbers);
This method also provides a convenient way to create a fixed-size list initialized to contain several elements:
List<String> stooges = Arrays.asList("Larry", "Moe", "Curly");
The list returned by this method is modifiable. To create an unmodifiable list, use Collections.unmodifiableList
or Unmodifiable Lists.
T
- the class of the objects in the arraya
- the array by which the list will be backedNullPointerException
- if the specified array is null
public static int hashCode(long[] a)
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 computea
public static int hashCode(int[] a)
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 computea
public static int hashCode(short[] a)
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 computea
public static int hashCode(char[] a)
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 computea
public static int hashCode(byte[] a)
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 computea
public static int hashCode(boolean[] a)
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 computea
public static int hashCode(float[] a)
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 computea
public static int hashCode(double[] a)
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 computea
public static int hashCode(Object[] a)
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 content-based hash code to computea
public static int deepHashCode(Object[] a)
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 List.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 deep-content-based hash code to computea
public static boolean deepEquals(Object[] a1, Object[] a2)
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:
e1
and e2
are both arrays of object reference types, and Arrays.deepEquals(e1, e2) would return true
e1
and e2
are arrays of the same primitive type, and the appropriate overloading of Arrays.equals(e1, e2)
would return true. e1 == e2
e1.equals(e2)
would return true. null
elements at any depth. 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 equalitya2
- the other array to be tested for equalitytrue
if the two arrays are equalpublic static String toString(long[] a)
"[]"
). 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 returna
public static String toString(int[] a)
"[]"
). 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 returna
public static String toString(short[] a)
"[]"
). 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 returna
public static String toString(char[] a)
"[]"
). 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 returna
public static String toString(byte[] a)
"[]"
). 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 returna
public static String toString(boolean[] a)
"[]"
). 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 returna
public static String toString(float[] a)
"[]"
). 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 returna
public static String toString(double[] a)
"[]"
). 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 returna
public static String toString(Object[] a)
Object.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 returna
public static String deepToString(Object[] a)
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 self-reference 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 returna
public static <T> void setAll(T[] array, IntFunction<? extends T> generator)
If the generator function throws an exception, it is relayed to the caller and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.forEach(i -> array[i] = generator.apply(i));
T
- type of elements of the arrayarray
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static <T> void parallelSetAll(T[] array, IntFunction<? extends T> generator)
If the generator function throws an exception, an unchecked exception is thrown from parallelSetAll
and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.parallel()
.forEach(i -> array[i] = generator.apply(i));
T
- type of elements of the arrayarray
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static void setAll(int[] array, IntUnaryOperator generator)
If the generator function throws an exception, it is relayed to the caller and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.forEach(i -> array[i] = generator.applyAsInt(i));
array
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static void parallelSetAll(int[] array, IntUnaryOperator generator)
If the generator function throws an exception, an unchecked exception is thrown from parallelSetAll
and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.parallel()
.forEach(i -> array[i] = generator.applyAsInt(i));
array
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static void setAll(long[] array, IntToLongFunction generator)
If the generator function throws an exception, it is relayed to the caller and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.forEach(i -> array[i] = generator.applyAsLong(i));
array
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static void parallelSetAll(long[] array, IntToLongFunction generator)
If the generator function throws an exception, an unchecked exception is thrown from parallelSetAll
and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.parallel()
.forEach(i -> array[i] = generator.applyAsLong(i));
array
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static void setAll(double[] array, IntToDoubleFunction generator)
If the generator function throws an exception, it is relayed to the caller and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.forEach(i -> array[i] = generator.applyAsDouble(i));
array
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static void parallelSetAll(double[] array, IntToDoubleFunction generator)
If the generator function throws an exception, an unchecked exception is thrown from parallelSetAll
and the array is left in an indeterminate state.
IntStream.range(startInclusive, endExclusive)
.parallel()
.forEach(i -> array[i] = generator.applyAsDouble(i));
array
- array to be initializedgenerator
- a function accepting an index and producing the desired value for that positionNullPointerException
- if the generator is nullpublic static <T> Spliterator<T> spliterator(T[] array)
Spliterator
covering all of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
T
- type of elementsarray
- the array, assumed to be unmodified during usepublic static <T> Spliterator<T> spliterator(T[] array, int startInclusive, int endExclusive)
Spliterator
covering the specified range of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
T
- type of elementsarray
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static Spliterator.OfInt spliterator(int[] array)
Spliterator.OfInt
covering all of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
array
- the array, assumed to be unmodified during usepublic static Spliterator.OfInt spliterator(int[] array, int startInclusive, int endExclusive)
Spliterator.OfInt
covering the specified range of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
array
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static Spliterator.OfLong spliterator(long[] array)
Spliterator.OfLong
covering all of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
array
- the array, assumed to be unmodified during usepublic static Spliterator.OfLong spliterator(long[] array, int startInclusive, int endExclusive)
Spliterator.OfLong
covering the specified range of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
array
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static Spliterator.OfDouble spliterator(double[] array)
Spliterator.OfDouble
covering all of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
array
- the array, assumed to be unmodified during usepublic static Spliterator.OfDouble spliterator(double[] array, int startInclusive, int endExclusive)
Spliterator.OfDouble
covering the specified range of the specified array. The spliterator reports Spliterator.SIZED
, Spliterator.SUBSIZED
, Spliterator.ORDERED
, and Spliterator.IMMUTABLE
.
array
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static <T> Stream<T> stream(T[] array)
Stream
with the specified array as its source.T
- The type of the array elementsarray
- The array, assumed to be unmodified during useStream
for the arraypublic static <T> Stream<T> stream(T[] array, int startInclusive, int endExclusive)
Stream
with the specified range of the specified array as its source.T
- the type of the array elementsarray
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverStream
for the array rangeArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static IntStream stream(int[] array)
IntStream
with the specified array as its source.array
- the array, assumed to be unmodified during useIntStream
for the arraypublic static IntStream stream(int[] array, int startInclusive, int endExclusive)
IntStream
with the specified range of the specified array as its source.array
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverIntStream
for the array rangeArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static LongStream stream(long[] array)
LongStream
with the specified array as its source.array
- the array, assumed to be unmodified during useLongStream
for the arraypublic static LongStream stream(long[] array, int startInclusive, int endExclusive)
LongStream
with the specified range of the specified array as its source.array
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverLongStream
for the array rangeArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static DoubleStream stream(double[] array)
DoubleStream
with the specified array as its source.array
- the array, assumed to be unmodified during useDoubleStream
for the arraypublic static DoubleStream stream(double[] array, int startInclusive, int endExclusive)
DoubleStream
with the specified range of the specified array as its source.array
- the array, assumed to be unmodified during usestartInclusive
- the first index to cover, inclusiveendExclusive
- index immediately past the last index to coverDoubleStream
for the array rangeArrayIndexOutOfBoundsException
- if startInclusive
is negative, endExclusive
is less than startInclusive
, or endExclusive
is greater than the array sizepublic static int compare(boolean[] a, boolean[] b)
boolean
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Boolean.compare(boolean, boolean)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(boolean[], boolean[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Boolean.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex)
boolean
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Boolean.compare(boolean, boolean)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(boolean[], int, int, boolean[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Boolean.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int compare(byte[] a, byte[] b)
byte
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Byte.compare(byte, byte)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(byte[], byte[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Byte.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
byte
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Byte.compare(byte, byte)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(byte[], int, int, byte[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Byte.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int compareUnsigned(byte[] a, byte[] b)
byte
arrays lexicographically, numerically treating elements as unsigned. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Byte.compareUnsigned(byte, byte)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(byte[], byte[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Byte.compareUnsigned(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compareUnsigned(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
byte
arrays lexicographically over the specified ranges, numerically treating elements as unsigned. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Byte.compareUnsigned(byte, byte)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(byte[], int, int, byte[], int, int)
for the definition of a common and proper prefix.)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Byte.compareUnsigned(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is nullpublic static int compare(short[] a, short[] b)
short
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Short.compare(short, short)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(short[], short[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Short.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
short
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Short.compare(short, short)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(short[], int, int, short[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Short.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int compareUnsigned(short[] a, short[] b)
short
arrays lexicographically, numerically treating elements as unsigned. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Short.compareUnsigned(short, short)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(short[], short[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Short.compareUnsigned(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compareUnsigned(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
short
arrays lexicographically over the specified ranges, numerically treating elements as unsigned. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Short.compareUnsigned(short, short)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(short[], int, int, short[], int, int)
for the definition of a common and proper prefix.)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Short.compareUnsigned(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is nullpublic static int compare(char[] a, char[] b)
char
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Character.compare(char, char)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(char[], char[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Character.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex)
char
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Character.compare(char, char)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(char[], int, int, char[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Character.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int compare(int[] a, int[] b)
int
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Integer.compare(int, int)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(int[], int[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Integer.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
int
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Integer.compare(int, int)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(int[], int, int, int[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Integer.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int compareUnsigned(int[] a, int[] b)
int
arrays lexicographically, numerically treating elements as unsigned. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Integer.compareUnsigned(int, int)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(int[], int[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Integer.compareUnsigned(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compareUnsigned(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
int
arrays lexicographically over the specified ranges, numerically treating elements as unsigned. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Integer.compareUnsigned(int, int)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(int[], int, int, int[], int, int)
for the definition of a common and proper prefix.)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Integer.compareUnsigned(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is nullpublic static int compare(long[] a, long[] b)
long
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Long.compare(long, long)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(long[], long[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Long.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
long
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Long.compare(long, long)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(long[], int, int, long[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Long.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int compareUnsigned(long[] a, long[] b)
long
arrays lexicographically, numerically treating elements as unsigned. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Long.compareUnsigned(long, long)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(long[], long[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Long.compareUnsigned(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compareUnsigned(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
long
arrays lexicographically over the specified ranges, numerically treating elements as unsigned. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Long.compareUnsigned(long, long)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(long[], int, int, long[], int, int)
for the definition of a common and proper prefix.)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Long.compareUnsigned(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is nullpublic static int compare(float[] a, float[] b)
float
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Float.compare(float, float)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(float[], float[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Float.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex)
float
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Float.compare(float, float)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(float[], int, int, float[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Float.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int compare(double[] a, double[] b)
double
arrays lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Double.compare(double, double)
, at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(double[], double[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return Double.compare(a[i], b[i]);
return a.length - b.length;
a
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static int compare(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex)
double
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements, as if by Double.compare(double, double)
, at a relative index within the respective arrays that is the length of the prefix. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(double[], int, int, double[], int, int)
for the definition of a common and proper prefix.)
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if:
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return Double.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
a
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static <T extends Comparable<? super T>> int compare(T[] a, T[] b)
Object
arrays, within comparable elements, lexicographically. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing two elements of type T
at an index i
within the respective arrays that is the prefix length, as if by:
Comparator.nullsFirst(Comparator.<T>naturalOrder()).
compare(a[i], b[i])
Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(Object[], Object[])
for the definition of a common and proper prefix.) A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal. A null
array element is considered lexicographically less than a non-null
array element. Two null
array elements are considered equal.
The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
:
Arrays.equals(a, b) == (Arrays.compare(a, b) == 0)
This method behaves as if (for non-null
array references and elements):
int i = Arrays.mismatch(a, b);
if (i >= 0 && i < Math.min(a.length, b.length))
return a[i].compareTo(b[i]);
return a.length - b.length;
T
- the type of comparable array elementsa
- the first array to compareb
- the second array to compare0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arraypublic static <T extends Comparable<? super T>> int compare(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex)
Object
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing two elements of type T
at a relative index i
within the respective arrays that is the prefix length, as if by:
Comparator.nullsFirst(Comparator.<T>naturalOrder()).
compare(a[aFromIndex + i, b[bFromIndex + i])
Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(Object[], int, int, Object[], int, int)
for the definition of a common and proper prefix.) The comparison is consistent with equals
, more specifically the following holds for arrays a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively:
Arrays.equals(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) ==
(Arrays.compare(a, aFromIndex, aToIndex, b, bFromIndex, bToIndex) == 0)
This method behaves as if (for non-null
array elements):
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return a[aFromIndex + i].compareTo(b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
T
- the type of comparable array elementsa
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be compared0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static <T> int compare(T[] a, T[] b, Comparator<? super T> cmp)
Object
arrays lexicographically using a specified comparator. If the two arrays share a common prefix then the lexicographic comparison is the result of comparing with the specified comparator two elements at an index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two array lengths. (See mismatch(Object[], Object[])
for the definition of a common and proper prefix.)
A null
array reference is considered lexicographically less than a non-null
array reference. Two null
array references are considered equal.
This method behaves as if (for non-null
array references):
int i = Arrays.mismatch(a, b, cmp);
if (i >= 0 && i < Math.min(a.length, b.length))
return cmp.compare(a[i], b[i]);
return a.length - b.length;
T
- the type of array elementsa
- the first array to compareb
- the second array to comparecmp
- the comparator to compare array elements0
if the first and second array are equal and contain the same elements in the same order; a value less than 0
if the first array is lexicographically less than the second array; and a value greater than 0
if the first array is lexicographically greater than the second arrayNullPointerException
- if the comparator is null
public static <T> int compare(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp)
Object
arrays lexicographically over the specified ranges. If the two arrays, over the specified ranges, share a common prefix then the lexicographic comparison is the result of comparing with the specified comparator two elements at a relative index within the respective arrays that is the prefix length. Otherwise, one array is a proper prefix of the other and, lexicographic comparison is the result of comparing the two range lengths. (See mismatch(Object[], int, int, Object[], int, int)
for the definition of a common and proper prefix.)
This method behaves as if (for non-null
array elements):
int i = Arrays.mismatch(a, aFromIndex, aToIndex,
b, bFromIndex, bToIndex, cmp);
if (i >= 0 && i < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
return cmp.compare(a[aFromIndex + i], b[bFromIndex + i]);
return (aToIndex - aFromIndex) - (bToIndex - bFromIndex);
T
- the type of array elementsa
- the first array to compareaFromIndex
- the index (inclusive) of the first element in the first array to be comparedaToIndex
- the index (exclusive) of the last element in the first array to be comparedb
- the second array to comparebFromIndex
- the index (inclusive) of the first element in the second array to be comparedbToIndex
- the index (exclusive) of the last element in the second array to be comparedcmp
- the comparator to compare array elements0
if, over the specified ranges, the first and second array are equal and contain the same elements in the same order; a value less than 0
if, over the specified ranges, the first array is lexicographically less than the second array; and a value greater than 0
if, over the specified ranges, the first array is lexicographically greater than the second arrayIllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array or the comparator is null
public static int mismatch(boolean[] a, boolean[] b)
boolean
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
a[pl] != b[pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex)
boolean
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
a[aFromIndex + pl] != b[bFromIndex + pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(byte[] a, byte[] b)
byte
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
a[pl] != b[pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
byte
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
a[aFromIndex + pl] != b[bFromIndex + pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(char[] a, char[] b)
char
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
a[pl] != b[pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex)
char
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
a[aFromIndex + pl] != b[bFromIndex + pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(short[] a, short[] b)
short
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
a[pl] != b[pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
short
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
a[aFromIndex + pl] != b[bFromIndex + pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(int[] a, int[] b)
int
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
a[pl] != b[pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
int
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
a[aFromIndex + pl] != b[bFromIndex + pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(long[] a, long[] b)
long
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
a[pl] != b[pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
long
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
a[aFromIndex + pl] != b[bFromIndex + pl]
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(float[] a, float[] b)
float
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
Float.compare(a[pl], b[pl]) != 0
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex)
float
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
Float.compare(a[aFromIndex + pl], b[bFromIndex + pl]) != 0
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(double[] a, double[] b)
double
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
Double.compare(a[pl], b[pl]) != 0
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex)
double
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
Double.compare(a[aFromIndex + pl], b[bFromIndex + pl]) != 0
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static int mismatch(Object[] a, Object[] b)
Object
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl) &&
!Objects.equals(a[pl], b[pl])
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length))
a
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatch-1
.NullPointerException
- if either array is null
public static int mismatch(Object[] a, int aFromIndex, int aToIndex, Object[] b, int bFromIndex, int bToIndex)
Object
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl) &&
!Objects.equals(a[aFromIndex + pl], b[bFromIndex + pl])
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex))
a
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be tested-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array is null
public static <T> int mismatch(T[] a, T[] b, Comparator<? super T> cmp)
Object
arrays, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller array. The specified comparator is used to determine if two array elements from the each array are not equal.
If the two arrays share a common prefix then the returned index is the length of the common prefix and it follows that there is a mismatch between the two elements at that index within the respective arrays. If one array is a proper prefix of the other then the returned index is the length of the smaller array and it follows that the index is only valid for the larger array. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(a.length, b.length) &&
Arrays.equals(a, 0, pl, b, 0, pl, cmp)
cmp.compare(a[pl], b[pl]) != 0
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
, share a proper prefix if the following expression is true:
a.length != b.length &&
Arrays.equals(a, 0, Math.min(a.length, b.length),
b, 0, Math.min(a.length, b.length),
cmp)
T
- the type of array elementsa
- the first array to be tested for a mismatchb
- the second array to be tested for a mismatchcmp
- the comparator to compare array elements-1
.NullPointerException
- if either array or the comparator is null
public static <T> int mismatch(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp)
Object
arrays over the specified ranges, otherwise return -1 if no mismatch is found. The index will be in the range of 0 (inclusive) up to the length (inclusive) of the smaller range. If the two arrays, over the specified ranges, share a common prefix then the returned relative index is the length of the common prefix and it follows that there is a mismatch between the two elements at that relative index within the respective arrays. If one array is a proper prefix of the other, over the specified ranges, then the returned relative index is the length of the smaller range and it follows that the relative index is only valid for the array with the larger range. Otherwise, there is no mismatch.
Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a common prefix of length pl
if the following expression is true:
pl >= 0 &&
pl < Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex) &&
Arrays.equals(a, aFromIndex, aFromIndex + pl, b, bFromIndex, bFromIndex + pl, cmp) &&
cmp.compare(a[aFromIndex + pl], b[bFromIndex + pl]) != 0
Note that a common prefix length of 0
indicates that the first elements from each array mismatch. Two non-null
arrays, a
and b
with specified ranges [aFromIndex
, aToIndex
) and [bFromIndex
, bToIndex
) respectively, share a proper prefix if the following expression is true:
(aToIndex - aFromIndex) != (bToIndex - bFromIndex) &&
Arrays.equals(a, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
b, 0, Math.min(aToIndex - aFromIndex, bToIndex - bFromIndex),
cmp)
T
- the type of array elementsa
- the first array to be tested for a mismatchaFromIndex
- the index (inclusive) of the first element in the first array to be testedaToIndex
- the index (exclusive) of the last element in the first array to be testedb
- the second array to be tested for a mismatchbFromIndex
- the index (inclusive) of the first element in the second array to be testedbToIndex
- the index (exclusive) of the last element in the second array to be testedcmp
- the comparator to compare array elements-1
.IllegalArgumentException
- if aFromIndex > aToIndex
or if bFromIndex > bToIndex
ArrayIndexOutOfBoundsException
- if aFromIndex < 0 or aToIndex > a.length
or if bFromIndex < 0 or bToIndex > b.length
NullPointerException
- if either array or the comparator is null
© 1993, 2023, Oracle and/or its affiliates. All rights reserved.
Documentation extracted from Debian's OpenJDK Development Kit package.
Licensed under the GNU General Public License, version 2, with the Classpath Exception.
Various third party code in OpenJDK is licensed under different licenses (see Debian package).
Java and OpenJDK are trademarks or registered trademarks of Oracle and/or its affiliates.
https://docs.oracle.com/en/java/javase/21/docs/api/java.base/java/util/Arrays.html