|
FlexDoc/Javadoc 2.0 Demo Java Doc |
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.
Method Summary |
||
Returns a fixed-size list backed by the specified array.
|
||
static int |
binarySearch(byte[] a, byte key)
Searches the specified array of bytes for the specified value using the
binary search algorithm.
|
|
static int |
binarySearch(byte[] a, int fromIndex, int toIndex, byte key)
Searches a range of
the specified array of bytes for the specified value using the
binary search algorithm.
|
|
static int |
binarySearch(char[] a, char key)
Searches the specified array of chars for the specified value using the
binary search algorithm.
|
|
static int |
binarySearch(char[] a, int fromIndex, int toIndex, char key)
Searches a range of
the specified array of chars for the specified value using the
binary search algorithm.
|
|
static int |
binarySearch(double[] a, double key)
Searches the specified array of doubles for the specified value using
the binary search algorithm.
|
|
static int |
binarySearch(double[] a, int fromIndex, int toIndex, double key)
Searches a range of
the specified array of doubles for the specified value using
the binary search algorithm.
|
|
static int |
binarySearch(float[] a, float key)
Searches the specified array of floats for the specified value using
the binary search algorithm.
|
|
static int |
binarySearch(float[] a, int fromIndex, int toIndex, float key)
Searches a range of
the specified array of floats for the specified value using
the binary search algorithm.
|
|
static int |
binarySearch(int[] a, int key)
Searches the specified array of ints for the specified value using the
binary search algorithm.
|
|
static int |
binarySearch(int[] a, int fromIndex, int toIndex, int key)
Searches a range of
the specified array of ints for the specified value using the
binary search algorithm.
|
|
static int |
binarySearch(long[] a, int fromIndex, int toIndex, long key)
Searches a range of
the specified array of longs for the specified value using the
binary search algorithm.
|
|
static int |
binarySearch(long[] a, long key)
Searches the specified array of longs for the specified value using the
binary search algorithm.
|
|
static int |
Searches a range of
the specified array for the specified object using the binary
search algorithm.
|
|
static int |
Searches the specified array for the specified object using the binary
search algorithm.
|
|
static int |
binarySearch(short[] a, int fromIndex, int toIndex, short key)
Searches a range of
the specified array of shorts for the specified value using
the binary search algorithm.
|
|
static int |
binarySearch(short[] a, short key)
Searches the specified array of shorts for the specified value using
the binary search algorithm.
|
|
static <T> int |
Searches a range of
the specified array for the specified object using the binary
search algorithm.
|
|
static <T> int |
Searches the specified array for the specified object using the binary
search algorithm.
|
|
static int |
compare(boolean[] a, boolean[] b)
Compares two boolean arrays lexicographically.
|
|
static int |
compare(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex)
Compares two boolean arrays lexicographically over the specified
ranges.
|
|
static int |
compare(byte[] a, byte[] b)
Compares two byte arrays lexicographically.
|
|
static int |
compare(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
Compares two byte arrays lexicographically over the specified
ranges.
|
|
static int |
compare(char[] a, char[] b)
Compares two char arrays lexicographically.
|
|
static int |
compare(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex)
Compares two char arrays lexicographically over the specified
ranges.
|
|
static int |
compare(double[] a, double[] b)
Compares two double arrays lexicographically.
|
|
static int |
compare(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex)
Compares two double arrays lexicographically over the specified
ranges.
|
|
static int |
compare(float[] a, float[] b)
Compares two float arrays lexicographically.
|
|
static int |
compare(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex)
Compares two float arrays lexicographically over the specified
ranges.
|
|
static int |
compare(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
Compares two int arrays lexicographically over the specified
ranges.
|
|
static int |
compare(int[] a, int[] b)
Compares two int arrays lexicographically.
|
|
static int |
compare(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
Compares two long arrays lexicographically over the specified
ranges.
|
|
static int |
compare(long[] a, long[] b)
Compares two long arrays lexicographically.
|
|
static int |
compare(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
Compares two short arrays lexicographically over the specified
ranges.
|
|
static int |
compare(short[] a, short[] b)
Compares two short arrays lexicographically.
|
|
Compares two Object arrays lexicographically over the specified
ranges.
|
||
static <T> int |
compare(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp)
Compares two Object arrays lexicographically over the specified
ranges.
|
|
Compares two Object arrays, within comparable elements,
lexicographically.
|
||
static <T> int |
Compares two Object arrays lexicographically using a specified
comparator.
|
|
static int |
compareUnsigned(byte[] a, byte[] b)
Compares two byte arrays lexicographically, numerically treating
elements as unsigned.
|
|
static int |
compareUnsigned(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
Compares two byte arrays lexicographically over the specified
ranges, numerically treating elements as unsigned.
|
|
static int |
compareUnsigned(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
Compares two int arrays lexicographically over the specified
ranges, numerically treating elements as unsigned.
|
|
static int |
compareUnsigned(int[] a, int[] b)
Compares two int arrays lexicographically, numerically treating
elements as unsigned.
|
|
static int |
compareUnsigned(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
Compares two long arrays lexicographically over the specified
ranges, numerically treating elements as unsigned.
|
|
static int |
compareUnsigned(long[] a, long[] b)
Compares two long arrays lexicographically, numerically treating
elements as unsigned.
|
|
static int |
compareUnsigned(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
Compares two short arrays lexicographically over the specified
ranges, numerically treating elements as unsigned.
|
|
static int |
compareUnsigned(short[] a, short[] b)
Compares two short arrays lexicographically, numerically treating
elements as unsigned.
|
|
static boolean[] |
copyOf(boolean[] original, int newLength)
Copies the specified array, truncating or padding with false (if necessary)
so the copy has the specified length.
|
|
static byte[] |
copyOf(byte[] original, int newLength)
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
|
|
static char[] |
copyOf(char[] original, int newLength)
Copies the specified array, truncating or padding with null characters (if necessary)
so the copy has the specified length.
|
|
static double[] |
copyOf(double[] original, int newLength)
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
|
|
static float[] |
copyOf(float[] original, int newLength)
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
|
|
static int[] |
copyOf(int[] original, int newLength)
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
|
|
static long[] |
copyOf(long[] original, int newLength)
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
|
|
static short[] |
copyOf(short[] original, int newLength)
Copies the specified array, truncating or padding with zeros (if necessary)
so the copy has the specified length.
|
|
Copies the specified array, truncating or padding with nulls (if necessary)
so the copy has the specified length.
|
||
Copies the specified array, truncating or padding with nulls (if necessary)
so the copy has the specified length.
|
||
static boolean[] |
copyOfRange(boolean[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
static byte[] |
copyOfRange(byte[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
static char[] |
copyOfRange(char[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
static double[] |
copyOfRange(double[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
static float[] |
copyOfRange(float[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
static int[] |
copyOfRange(int[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
static long[] |
copyOfRange(long[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
static short[] |
copyOfRange(short[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
|
copyOfRange(T[] original, int from, int to)
Copies the specified range of the specified array into a new array.
|
||
Copies the specified range of the specified array into a new array.
|
||
static boolean |
Returns true if the two specified arrays are deeply
equal to one another.
|
|
static int |
deepHashCode(Object[] a)
Returns a hash code based on the "deep contents" of the specified
array.
|
|
static String |
deepToString(Object[] a)
Returns a string representation of the "deep contents" of the specified
array.
|
|
static boolean |
equals(boolean[] a, boolean[] a2)
Returns true if the two specified arrays of booleans are
equal to one another.
|
|
static boolean |
equals(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of booleans, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(byte[] a, byte[] a2)
Returns true if the two specified arrays of bytes are
equal to one another.
|
|
static boolean |
equals(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of bytes, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(char[] a, char[] a2)
Returns true if the two specified arrays of chars are
equal to one another.
|
|
static boolean |
equals(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of chars, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(double[] a, double[] a2)
Returns true if the two specified arrays of doubles are
equal to one another.
|
|
static boolean |
equals(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of doubles, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(float[] a, float[] a2)
Returns true if the two specified arrays of floats are
equal to one another.
|
|
static boolean |
equals(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of floats, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of ints, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(int[] a, int[] a2)
Returns true if the two specified arrays of ints are
equal to one another.
|
|
static boolean |
equals(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of longs, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(long[] a, long[] a2)
Returns true if the two specified arrays of longs are
equal to one another.
|
|
static boolean |
Returns true if the two specified arrays of Objects, over the specified
ranges, are equal to one another.
|
|
static boolean |
Returns true if the two specified arrays of Objects are
equal to one another.
|
|
static boolean |
equals(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
Returns true if the two specified arrays of shorts, over the specified
ranges, are equal to one another.
|
|
static boolean |
equals(short[] a, short[] a2)
Returns true if the two specified arrays of shorts are
equal to one another.
|
|
static <T> boolean |
equals(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp)
Returns true if the two specified arrays of Objects, over the specified
ranges, are equal to one another.
|
|
static <T> boolean |
Returns true if the two specified arrays of Objects are
equal to one another.
|
|
static void |
fill(boolean[] a, boolean val)
Assigns the specified boolean value to each element of the specified
array of booleans.
|
|
static void |
fill(boolean[] a, int fromIndex, int toIndex, boolean val)
Assigns the specified boolean value to each element of the specified
range of the specified array of booleans.
|
|
static void |
fill(byte[] a, byte val)
Assigns the specified byte value to each element of the specified array
of bytes.
|
|
static void |
fill(byte[] a, int fromIndex, int toIndex, byte val)
Assigns the specified byte value to each element of the specified
range of the specified array of bytes.
|
|
static void |
fill(char[] a, char val)
Assigns the specified char value to each element of the specified array
of chars.
|
|
static void |
fill(char[] a, int fromIndex, int toIndex, char val)
Assigns the specified char value to each element of the specified
range of the specified array of chars.
|
|
static void |
fill(double[] a, double val)
Assigns the specified double value to each element of the specified
array of doubles.
|
|
static void |
fill(double[] a, int fromIndex, int toIndex, double val)
Assigns the specified double value to each element of the specified
range of the specified array of doubles.
|
|
static void |
fill(float[] a, float val)
Assigns the specified float value to each element of the specified array
of floats.
|
|
static void |
fill(float[] a, int fromIndex, int toIndex, float val)
Assigns the specified float value to each element of the specified
range of the specified array of floats.
|
|
static void |
fill(int[] a, int val)
Assigns the specified int value to each element of the specified array
of ints.
|
|
static void |
fill(int[] a, int fromIndex, int toIndex, int val)
Assigns the specified int value to each element of the specified
range of the specified array of ints.
|
|
static void |
fill(long[] a, int fromIndex, int toIndex, long val)
Assigns the specified long value to each element of the specified
range of the specified array of longs.
|
|
static void |
fill(long[] a, long val)
Assigns the specified long value to each element of the specified array
of longs.
|
|
static void |
Assigns the specified Object reference to each element of the specified
range of the specified array of Objects.
|
|
static void |
Assigns the specified Object reference to each element of the specified
array of Objects.
|
|
static void |
fill(short[] a, int fromIndex, int toIndex, short val)
Assigns the specified short value to each element of the specified
range of the specified array of shorts.
|
|
static void |
fill(short[] a, short val)
Assigns the specified short value to each element of the specified array
of shorts.
|
|
static int |
hashCode(boolean[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
hashCode(byte[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
hashCode(char[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
hashCode(double[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
hashCode(float[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
hashCode(int[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
hashCode(long[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
Returns a hash code based on the contents of the specified array.
|
|
static int |
hashCode(short[] a)
Returns a hash code based on the contents of the specified array.
|
|
static int |
mismatch(boolean[] a, boolean[] b)
Finds and returns the index of the first mismatch between two
boolean arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
mismatch(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex)
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(byte[] a, byte[] b)
Finds and returns the index of the first mismatch between two byte
arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
mismatch(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex)
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(char[] a, char[] b)
Finds and returns the index of the first mismatch between two char
arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
mismatch(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex)
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(double[] a, double[] b)
Finds and returns the index of the first mismatch between two
double arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
mismatch(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex)
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(float[] a, float[] b)
Finds and returns the index of the first mismatch between two float
arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
mismatch(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex)
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(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex)
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(int[] a, int[] b)
Finds and returns the index of the first mismatch between two int
arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
mismatch(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex)
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(long[] a, long[] b)
Finds and returns the index of the first mismatch between two long
arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
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 |
Finds and returns the index of the first mismatch between two
Object arrays, otherwise return -1 if no mismatch is found.
|
|
static int |
mismatch(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex)
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(short[] a, short[] b)
Finds and returns the index of the first mismatch between two short
arrays, otherwise return -1 if no mismatch is found.
|
|
static <T> int |
mismatch(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp)
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 |
Finds and returns the index of the first mismatch between two
Object arrays, otherwise return -1 if no mismatch is found.
|
|
static void |
parallelPrefix(double[] array, DoubleBinaryOperator op)
Cumulates, in parallel, each element of the given array in place,
using the supplied function.
|
|
static void |
parallelPrefix(double[] array, int fromIndex, int toIndex, DoubleBinaryOperator op)
Performs parallelPrefix(double[], DoubleBinaryOperator)
for the given subrange of the array.
|
|
static void |
parallelPrefix(int[] array, int fromIndex, int toIndex, IntBinaryOperator op)
Performs parallelPrefix(int[], IntBinaryOperator)
for the given subrange of the array.
|
|
static void |
parallelPrefix(int[] array, IntBinaryOperator op)
Cumulates, in parallel, each element of the given array in place,
using the supplied function.
|
|
static void |
parallelPrefix(long[] array, int fromIndex, int toIndex, LongBinaryOperator op)
Performs parallelPrefix(long[], LongBinaryOperator)
for the given subrange of the array.
|
|
static void |
parallelPrefix(long[] array, LongBinaryOperator op)
Cumulates, in parallel, each element of the given array in place,
using the supplied function.
|
|
static <T> void |
Cumulates, in parallel, each element of the given array in place,
using the supplied function.
|
|
static <T> void |
Performs parallelPrefix(Object[], BinaryOperator)
for the given subrange of the array.
|
|
static void |
parallelSetAll(double[] array, IntToDoubleFunction generator)
Set all elements of the specified array, in parallel, using the
provided generator function to compute each element.
|
|
static void |
parallelSetAll(int[] array, IntUnaryOperator generator)
Set all elements of the specified array, in parallel, using the
provided generator function to compute each element.
|
|
static void |
parallelSetAll(long[] array, IntToLongFunction generator)
Set all elements of the specified array, in parallel, using the
provided generator function to compute each element.
|
|
static <T> void |
Set all elements of the specified array, in parallel, using the
provided generator function to compute each element.
|
|
static void |
parallelSort(byte[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
parallelSort(byte[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending numerical order.
|
|
static void |
parallelSort(char[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
parallelSort(char[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending numerical order.
|
|
static void |
parallelSort(double[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
parallelSort(double[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending numerical order.
|
|
static void |
parallelSort(float[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
parallelSort(float[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending numerical order.
|
|
static void |
parallelSort(int[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
parallelSort(int[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending numerical order.
|
|
static void |
parallelSort(long[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
parallelSort(long[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending numerical order.
|
|
static void |
parallelSort(short[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
parallelSort(short[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending numerical order.
|
|
parallelSort(T[] a)
Sorts the specified array of objects into ascending order, according
to the natural ordering of its elements.
|
||
static <T> void |
Sorts the specified array of objects according to the order induced by
the specified comparator.
|
|
parallelSort(T[] a, int fromIndex, int toIndex)
Sorts the specified range of the specified array of objects into
ascending order, according to the
natural ordering of its
elements.
|
||
static <T> void |
Sorts the specified range of the specified array of objects according
to the order induced by the specified comparator.
|
|
static void |
setAll(double[] array, IntToDoubleFunction generator)
Set all elements of the specified array, using the provided
generator function to compute each element.
|
|
static void |
setAll(int[] array, IntUnaryOperator generator)
Set all elements of the specified array, using the provided
generator function to compute each element.
|
|
static void |
setAll(long[] array, IntToLongFunction generator)
Set all elements of the specified array, using the provided
generator function to compute each element.
|
|
static <T> void |
Set all elements of the specified array, using the provided
generator function to compute each element.
|
|
static void |
sort(byte[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
sort(byte[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending order.
|
|
static void |
sort(char[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
sort(char[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending order.
|
|
static void |
sort(double[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
sort(double[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending order.
|
|
static void |
sort(float[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
sort(float[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending order.
|
|
static void |
sort(int[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
sort(int[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending order.
|
|
static void |
sort(long[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
sort(long[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending order.
|
|
static void |
Sorts the specified array of objects into ascending order, according
to the natural ordering of its elements.
|
|
static void |
Sorts the specified range of the specified array of objects into
ascending order, according to the
natural ordering of its
elements.
|
|
static void |
sort(short[] a)
Sorts the specified array into ascending numerical order.
|
|
static void |
sort(short[] a, int fromIndex, int toIndex)
Sorts the specified range of the array into ascending order.
|
|
static <T> void |
Sorts the specified array of objects according to the order induced by
the specified comparator.
|
|
static <T> void |
Sorts the specified range of the specified array of objects according
to the order induced by the specified comparator.
|
|
static Spliterator.OfDouble |
spliterator(double[] array)
Returns a Spliterator.OfDouble covering all of the specified
array.
|
|
static Spliterator.OfDouble |
spliterator(double[] array, int startInclusive, int endExclusive)
Returns a Spliterator.OfDouble covering the specified range of
the specified array.
|
|
static Spliterator.OfInt |
spliterator(int[] array)
Returns a Spliterator.OfInt covering all of the specified array.
|
|
static Spliterator.OfInt |
spliterator(int[] array, int startInclusive, int endExclusive)
Returns a Spliterator.OfInt covering the specified range of the
specified array.
|
|
static Spliterator.OfLong |
spliterator(long[] array)
Returns a Spliterator.OfLong covering all of the specified array.
|
|
static Spliterator.OfLong |
spliterator(long[] array, int startInclusive, int endExclusive)
Returns a Spliterator.OfLong covering the specified range of the
specified array.
|
|
spliterator(T[] array)
Returns a Spliterator covering all of the specified array.
|
||
spliterator(T[] array, int startInclusive, int endExclusive)
Returns a Spliterator covering the specified range of the
specified array.
|
||
static DoubleStream |
stream(double[] array)
Returns a sequential DoubleStream with the specified array as its
source.
|
|
static DoubleStream |
stream(double[] array, int startInclusive, int endExclusive)
Returns a sequential DoubleStream with the specified range of the
specified array as its source.
|
|
static IntStream |
stream(int[] array)
Returns a sequential IntStream with the specified array as its
source.
|
|
static IntStream |
stream(int[] array, int startInclusive, int endExclusive)
Returns a sequential IntStream with the specified range of the
specified array as its source.
|
|
static LongStream |
stream(long[] array)
Returns a sequential LongStream with the specified array as its
source.
|
|
static LongStream |
stream(long[] array, int startInclusive, int endExclusive)
Returns a sequential LongStream with the specified range of the
specified array as its source.
|
|
Returns a sequential Stream with the specified array as its
source.
|
||
Returns a sequential Stream with the specified range of the
specified array as its source.
|
||
static String |
toString(boolean[] a)
Returns a string representation of the contents of the specified array.
|
|
static String |
toString(byte[] a)
Returns a string representation of the contents of the specified array.
|
|
static String |
toString(char[] a)
Returns a string representation of the contents of the specified array.
|
|
static String |
toString(double[] a)
Returns a string representation of the contents of the specified array.
|
|
static String |
toString(float[] a)
Returns a string representation of the contents of the specified array.
|
|
static String |
toString(int[] a)
Returns a string representation of the contents of the specified array.
|
|
static String |
toString(long[] a)
Returns a string representation of the contents of the specified array.
|
|
static String |
Returns a string representation of the contents of the specified array.
|
|
static String |
toString(short[] a)
Returns a string representation of the contents of the specified array.
|
Methods inherited from class java.lang.Object |
public static void sort |
(int[] a) |
public static void sort |
(int[] a, int fromIndex, int toIndex) |
public static void sort |
(long[] a) |
public static void sort |
(long[] a, int fromIndex, int toIndex) |
public static void sort |
(short[] a) |
public static void sort |
(short[] a, int fromIndex, int toIndex) |
public static void sort |
(char[] a) |
public static void sort |
(char[] a, int fromIndex, int toIndex) |
public static void sort |
(byte[] a) |
public static void sort |
(byte[] a, int fromIndex, int toIndex) |
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(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.
public static void sort |
(float[] a, int fromIndex, int toIndex) |
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(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.
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(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.
public static void sort |
(double[] a, int fromIndex, int toIndex) |
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(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.
public static void parallelSort |
(byte[] a) |
public static void parallelSort |
(byte[] a, int fromIndex, int toIndex) |
public static void parallelSort |
(char[] a) |
public static void parallelSort |
(char[] a, int fromIndex, int toIndex) |
public static void parallelSort |
(short[] a) |
public static void parallelSort |
(short[] a, int fromIndex, int toIndex) |
public static void parallelSort |
(int[] a) |
public static void parallelSort |
(int[] a, int fromIndex, int toIndex) |
public static void parallelSort |
(long[] a) |
public static void parallelSort |
(long[] a, int fromIndex, int toIndex) |
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(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.
public static void parallelSort |
(float[] a, int fromIndex, int toIndex) |
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(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.
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(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.
public static void parallelSort |
(double[] a, int fromIndex, int toIndex) |
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(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.
(T[] a) |
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
public static <T> void parallelSort |
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
public static <T> void parallelSort |
This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort.
public static void sort |
(Object[] a) |
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.
public static void sort |
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.
public static <T> void sort |
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.
public static <T> void sort |
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.
public static <T> void parallelPrefix |
public static <T> void parallelPrefix |
public static void parallelPrefix |
(long[] array, LongBinaryOperator op) |
public static void parallelPrefix |
public static void parallelPrefix |
(double[] array, DoubleBinaryOperator op) |
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.
public static void parallelPrefix |
public static void parallelPrefix |
(int[] array, IntBinaryOperator op) |
public static void parallelPrefix |
public static int binarySearch |
(long[] a, long key) |
(-(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) |
(-(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.public static int binarySearch |
(int[] a, int key) |
(-(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) |
(-(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.public static int binarySearch |
(short[] a, short key) |
(-(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) |
(-(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.public static int binarySearch |
(char[] a, char key) |
(-(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) |
(-(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.public static int binarySearch |
(byte[] a, byte key) |
(-(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) |
(-(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.public static int binarySearch |
(double[] a, double key) |
(-(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) |
(-(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.public static int binarySearch |
(float[] a, float key) |
(-(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) |
(-(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.public static int binarySearch |
(-(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 |
(-(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.public static <T> int binarySearch |
(-(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 <T> int binarySearch |
(-(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.public static boolean equals |
(long[] a, long[] a2) |
public 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.
public static boolean equals |
(int[] a, int[] a2) |
public 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.
public static boolean equals |
(short[] a, short[] a2) |
public 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.
public static boolean equals |
(char[] a, char[] a2) |
public 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.
public static boolean equals |
(byte[] a, byte[] a2) |
public 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.
public static boolean equals |
(boolean[] a, boolean[] a2) |
public 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.
public static boolean equals |
(double[] a, double[] a2) |
new Double(d1).equals(new Double(d2))
(Unlike the == operator, this method considers
NaN equal to itself, and 0.0d unequal to -0.0d.)
public 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:
new Double(d1).equals(new Double(d2))
(Unlike the == operator, this method considers
NaN equal to itself, and 0.0d unequal to -0.0d.)
public static boolean equals |
(float[] a, float[] a2) |
new Float(f1).equals(new Float(f2))
(Unlike the == operator, this method considers
NaN equal to itself, and 0.0f unequal to -0.0f.)
public 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:
new Float(f1).equals(new Float(f2))
(Unlike the == operator, this method considers
NaN equal to itself, and 0.0f unequal to -0.0f.)
public static boolean equals |
public static boolean equals |
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).
public static <T> boolean equals |
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.
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.
public static void fill |
(long[] a, long val) |
public static void fill |
(long[] a, int fromIndex, int toIndex, long val) |
public static void fill |
(int[] a, int val) |
public static void fill |
(int[] a, int fromIndex, int toIndex, int val) |
public static void fill |
(short[] a, short val) |
public static void fill |
(short[] a, int fromIndex, int toIndex, short val) |
public static void fill |
(char[] a, char val) |
public static void fill |
(char[] a, int fromIndex, int toIndex, char val) |
public static void fill |
(byte[] a, byte val) |
public static void fill |
(byte[] a, int fromIndex, int toIndex, byte val) |
public static void fill |
(boolean[] a, boolean val) |
public static void fill |
(boolean[] a, int fromIndex, int toIndex, boolean val) |
public static void fill |
(double[] a, double val) |
public static void fill |
(double[] a, int fromIndex, int toIndex, double val) |
public static void fill |
(float[] a, float val) |
public static void fill |
(float[] a, int fromIndex, int toIndex, float val) |
public static void fill |
public static void fill |
(T[] original, int newLength) |
public static byte[] copyOf |
(byte[] original, int newLength) |
public static short[] copyOf |
(short[] original, int newLength) |
public static int[] copyOf |
(int[] original, int newLength) |
public static long[] copyOf |
(long[] original, int newLength) |
public static char[] copyOf |
(char[] original, int newLength) |
public static float[] copyOf |
(float[] original, int newLength) |
public static double[] copyOf |
(double[] original, int newLength) |
public static boolean[] copyOf |
(boolean[] original, int newLength) |
The resulting array is of exactly the same class as the original array.
public static byte[] copyOfRange |
(byte[] original, int from, int to) |
public static short[] copyOfRange |
(short[] original, int from, int to) |
public static int[] copyOfRange |
(int[] original, int from, int to) |
public static long[] copyOfRange |
(long[] original, int from, int to) |
public static char[] copyOfRange |
(char[] original, int from, int to) |
public static float[] copyOfRange |
(float[] original, int from, int to) |
public static double[] copyOfRange |
(double[] original, int from, int to) |
public static boolean[] copyOfRange |
(boolean[] original, int from, int to) |
(T... a) |
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.
public static int hashCode |
(long[] a) |
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.
public static int hashCode |
(int[] a) |
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.
public static int hashCode |
(short[] a) |
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.
public static int hashCode |
(char[] a) |
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.
public static int hashCode |
(byte[] a) |
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.
public static int hashCode |
(boolean[] a) |
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.
public static int hashCode |
(float[] a) |
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.
public static int hashCode |
(double[] a) |
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.
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.
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.
public static boolean deepEquals |
Two array references are considered deeply equal if both are null, or if they refer to arrays that contain the same number of elements and all corresponding pairs of elements in the two arrays are deeply equal.
Two possibly null elements e1 and e2 are deeply equal if any of the following conditions hold:
If either of the specified arrays contain themselves as elements either directly or indirectly through one or more levels of arrays, the behavior of this method is undefined.
public static String toString |
(long[] a) |
public static String toString |
(int[] a) |
public static String toString |
(short[] a) |
public static String toString |
(char[] a) |
public static String toString |
(byte[] a) |
public static String toString |
(boolean[] a) |
public static String toString |
(float[] a) |
public static String toString |
(double[] a) |
public static String toString |
(Object[] a) |
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.
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.
public static <T> void setAll |
If the generator function throws an exception, it is relayed to the caller and the array is left in an indeterminate state.
public static <T> void parallelSetAll |
If the generator function throws an exception, an unchecked exception is thrown from parallelSetAll and the array is left in an indeterminate state.
public 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.
public 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.
public 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.
public 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.
public 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.
public 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.
(T[] array) |
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
public static Spliterator.OfInt spliterator |
(int[] array) |
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
public static Spliterator.OfInt spliterator |
(int[] array, int startInclusive, int endExclusive) |
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
public static Spliterator.OfLong spliterator |
(long[] array) |
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
public static Spliterator.OfLong spliterator |
(long[] array, int startInclusive, int endExclusive) |
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
public static Spliterator.OfDouble spliterator |
(double[] array) |
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
public static Spliterator.OfDouble spliterator |
(double[] array, int startInclusive, int endExclusive) |
The spliterator reports Spliterator.SIZED, Spliterator.SUBSIZED, Spliterator.ORDERED, and Spliterator.IMMUTABLE.
(T[] array) |
public static IntStream stream |
(int[] array) |
public static IntStream stream |
(int[] array, int startInclusive, int endExclusive) |
public static LongStream stream |
(long[] array) |
public static LongStream stream |
(long[] array, int startInclusive, int endExclusive) |
public static DoubleStream stream |
(double[] array) |
public static DoubleStream stream |
(double[] array, int startInclusive, int endExclusive) |
public static int compare |
(boolean[] a, boolean[] b) |
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)
public static int compare |
(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex) |
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)
public static int compare |
(byte[] a, byte[] b) |
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)
public static int compare |
(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex) |
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)
public static int compareUnsigned |
(byte[] a, byte[] b) |
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.
public static int compareUnsigned |
(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex) |
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.)
public static int compare |
(short[] a, short[] b) |
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)
public static int compare |
(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex) |
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)
public static int compareUnsigned |
(short[] a, short[] b) |
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.
public static int compareUnsigned |
(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex) |
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.)
public static int compare |
(char[] a, char[] b) |
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)
public static int compare |
(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex) |
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)
public static int compare |
(int[] a, int[] b) |
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)
public static int compare |
(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex) |
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)
public static int compareUnsigned |
(int[] a, int[] b) |
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.
public static int compareUnsigned |
(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex) |
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.)
public static int compare |
(long[] a, long[] b) |
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)
public static int compare |
(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex) |
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)
public static int compareUnsigned |
(long[] a, long[] b) |
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.
public static int compareUnsigned |
(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex) |
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.)
public static int compare |
(float[] a, float[] b) |
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)
public static int compare |
(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex) |
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)
public static int compare |
(double[] a, double[] b) |
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)
public static int compare |
(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex) |
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)
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)
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)
public static <T> int compare |
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.
public static <T> int compare |
(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp) |
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.)
public static int mismatch |
(boolean[] a, boolean[] b) |
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))
public static int mismatch |
(boolean[] a, int aFromIndex, int aToIndex, boolean[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
(byte[] a, byte[] b) |
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))
public static int mismatch |
(byte[] a, int aFromIndex, int aToIndex, byte[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
(char[] a, char[] b) |
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))
public static int mismatch |
(char[] a, int aFromIndex, int aToIndex, char[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
(short[] a, short[] b) |
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))
public static int mismatch |
(short[] a, int aFromIndex, int aToIndex, short[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
(int[] a, int[] b) |
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))
public static int mismatch |
(int[] a, int aFromIndex, int aToIndex, int[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
(long[] a, long[] b) |
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))
public static int mismatch |
(long[] a, int aFromIndex, int aToIndex, long[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
(float[] a, float[] b) |
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))
public static int mismatch |
(float[] a, int aFromIndex, int aToIndex, float[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
(double[] a, double[] b) |
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))
public static int mismatch |
(double[] a, int aFromIndex, int aToIndex, double[] b, int bFromIndex, int bToIndex) |
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))
public static int mismatch |
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))
public static int mismatch |
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))
public static <T> int mismatch |
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)
public static <T> int mismatch |
(T[] a, int aFromIndex, int aToIndex, T[] b, int bFromIndex, int bToIndex, Comparator<? super T> cmp) |
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)
|
FlexDoc/Javadoc 2.0 Demo Java Doc |