Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
   /*
    * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
    * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
    *
    * This code is free software; you can redistribute it and/or modify it
    * under the terms of the GNU General Public License version 2 only, as
    * published by the Free Software Foundation.  Oracle designates this
    * particular file as subject to the "Classpath" exception as provided
    * by Oracle in the LICENSE file that accompanied this code.
   *
   * This code is distributed in the hope that it will be useful, but WITHOUT
   * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
   * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
   * version 2 for more details (a copy is included in the LICENSE file that
   * accompanied this code).
   *
   * You should have received a copy of the GNU General Public License version
   * 2 along with this work; if not, write to the Free Software Foundation,
   * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
   *
   * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   */
  
  package com.WazaBe.HoloEverywhere.util;
  
  import java.util.HashSet;
  import java.util.List;
  import java.util.Set;

This class contains various methods for manipulating arrays (such as sorting and searching). This class also contains a static factory that allows arrays to be viewed as lists.

The methods in this class all throw a NullPointerException, if the specified array reference is null, except where noted.

The documentation for the methods contained in this class includes briefs description of the implementations. Such descriptions should be regarded as implementation notes, rather than parts of the specification. Implementors should feel free to substitute other algorithms, so long as the specification itself is adhered to. (For example, the algorithm used by sort(Object[]) does not have to be a MergeSort, but it does have to be stable.)

This class is a member of the Java Collections Framework.

Author(s):
Josh Bloch
Neal Gafter
John Rose
Since:
1.2
  
  @SuppressWarnings({ "unchecked""rawtypes" })
  public class Arrays {

Serial:
include
  
  	private static class ArrayList<E> extends AbstractList<E> implements
  		private static final long serialVersionUID = -2764017481108945198L;
  		private final E[] a;
  
  		ArrayList(E[] array) {
  			if (array == null) {
  				throw new NullPointerException();
  			}
  			 = array;
  		}
  
  		public boolean contains(Object o) {
  			return indexOf(o) != -1;
  		}
  
  		public E get(int index) {
  			return [index];
  		}
  
  		public int indexOf(Object o) {
  			if (o == null) {
  				for (int i = 0; i < .i++) {
  					if ([i] == null) {
  						return i;
  					}
  				}
 			} else {
 				for (int i = 0; i < .i++) {
 					if (o.equals([i])) {
 						return i;
 					}
 				}
 			}
 			return -1;
 		}
 
 		public E set(int index, E element) {
 			E oldValue = [index];
 			[index] = element;
 			return oldValue;
 		}
 
 		public int size() {
 			return .;
 		}
 
 		public Object[] toArray() {
 			return .clone();
 		}
 
 		public <T> T[] toArray(T[] a) {
 			int size = size();
 			if (a.length < size) {
 				return Arrays.copyOf(this.size,
 						(Class<? extends T[]>) a.getClass());
 			}
 			System.arraycopy(this., 0, a, 0, size);
 			if (a.length > size) {
 				a[size] = null;
 			}
 			return a;
 		}
 	}
 
 	/*
 	 * Sorting of primitive type arrays.
 	 */

Old merge sort implementation can be selected (for compatibility with broken comparators) using a system property. Cannot be a static boolean in the enclosing class due to circular dependencies. To be removed in a future release.
 
 	static final class LegacyMergeSort {
 		private static final boolean userRequested = false;
 	}

Tuning parameter: list size at or below which insertion sort will be used in preference to mergesort. To be removed in a future release.
 
 	private static final int INSERTIONSORT_THRESHOLD = 7;

Returns a fixed-size list backed by the specified array. (Changes to the returned list "write through" to the array.) This method acts as bridge between array-based and collection-based APIs, in combination with java.util.Collection.toArray(). The returned list is serializable and implements java.util.RandomAccess.

This method also provides a convenient way to create a fixed-size list initialized to contain several elements:

 List<String> stooges = Arrays.asList("Larry", "Moe", "Curly");
 

Parameters:
a the array by which the list will be backed
Returns:
a list view of the specified array
 
 	public static <T> List<T> asList(T... a) {
 		return new ArrayList<T>(a);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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[] abyte key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(byte[] aint fromIndexint toIndex,
 			byte key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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[] achar key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(char[] aint fromIndexint toIndex,
 			char key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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[] adouble key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(double[] aint fromIndexint toIndex,
 			double key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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[] afloat key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(float[] aint fromIndexint toIndex,
 			float key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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[] aint key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(int[] aint fromIndexint toIndexint key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(long[] aint fromIndexint toIndex,
 			long key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}
 
 	/*
 	 * Sorting of complex type arrays.
 	 */

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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[] along key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}
 
 	/*
 	 * If this platform has an optimizing VM, check whether ComparableTimSort
 	 * offers any performance benefit over TimSort in conjunction with a
 	 * comparator that returns: {@code ((Comparable)first).compareTo(Second)}.
 	 * If not, you are better off deleting ComparableTimSort to eliminate the
 	 * code duplication. In other words, the commented out code below is the
 	 * preferable implementation for sorting arrays of Comparables if it offers
 	 * sufficient performance.
 	 */
 
 	// /**
 	// * A comparator that implements the natural ordering of a group of
 	// * mutually comparable elements. Using this comparator saves us
 	// * from duplicating most of the code in this file (one version for
 	// * Comparables, one for explicit Comparators).
 	// */
 	// private static final Comparator<Object> NATURAL_ORDER =
 	// new Comparator<Object>() {
 	// @SuppressWarnings("unchecked")
 	// public int compare(Object first, Object second) {
 	// return ((Comparable<Object>)first).compareTo(second);
 	// }
 	// };
 	//
 	// public static void sort(Object[] a) {
 	// sort(a, 0, a.length, NATURAL_ORDER);
 	// }
 	//
 	// public static void sort(Object[] a, int fromIndex, int toIndex) {
 	// sort(a, fromIndex, toIndex, NATURAL_ORDER);
 	// }
 
Searches a range of the specified array for the specified object using the binary search algorithm. The range must be sorted into ascending order according to the natural ordering of its elements (as by the sort(java.lang.Object[],int,int) method) prior to making this call. If it is not sorted, the results are undefined. (If the range contains elements that are not mutually comparable (for example, strings and integers), it cannot be sorted according to the natural ordering of its elements, hence results are undefined.) If the range contains multiple elements equal to the specified object, there is no guarantee which one will be found.

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.ClassCastException if the search key is not comparable to the elements of the array within the specified range.
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(Object[] aint fromIndexint toIndex,
 			Object key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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.
Throws:
java.lang.ClassCastException if the search key is not comparable to the elements of the array.
 
 	public static int binarySearch(Object[] aObject key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static int binarySearch(short[] aint fromIndexint toIndex,
 			short key) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkey);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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[] ashort key) {
 		return binarySearch0(a, 0, a.lengthkey);
 	}

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

Parameters:
a the array to be searched
fromIndex the index of the first element (inclusive) to be searched
toIndex the index of the last element (exclusive) to be searched
key the value to be searched for
c the comparator by which the array is ordered. A null value indicates that the elements' natural ordering should be used.
Returns:
index of the search key, if it is contained in the array within the specified range; otherwise, (-(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.
Throws:
java.lang.ClassCastException if the range contains elements that are not mutually comparable using the specified comparator, or the search key is not comparable to the elements in the range using this comparator.
java.lang.IllegalArgumentException if fromIndex > toIndex
java.lang.ArrayIndexOutOfBoundsException if fromIndex < 0 or toIndex > a.length
Since:
1.6
 
 	public static <T> int binarySearch(T[] aint fromIndexint toIndex,
 			T keyComparator<? super T> c) {
 		rangeCheck(a.lengthfromIndextoIndex);
 		return binarySearch0(afromIndextoIndexkeyc);
 	}

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

Parameters:
a the array to be searched
key the value to be searched for
c the comparator by which the array is ordered. A null value indicates that the elements' natural ordering should be used.
Returns:
index of the search key, if it is contained in the array; otherwise, (-(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.
Throws:
java.lang.ClassCastException if the array contains elements that are not mutually comparable using the specified comparator, or the search key is not comparable to the elements of the array using this comparator.
 
 	public static <T> int binarySearch(T[] a, T keyComparator<? super T> c) {
 		return binarySearch0(a, 0, a.lengthkeyc);
 	}
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(byte[] aint fromIndexint toIndex,
 			byte key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			byte midVal = a[mid];
 
 			if (midVal < key) {
 				low = mid + 1;
 			} else if (midVal > key) {
 				high = mid - 1;
 			} else {
 				return mid// key found
 			}
 		}
 		return -(low + 1); // key not found.
 	}
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(char[] aint fromIndexint toIndex,
 			char key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			char midVal = a[mid];
 
 			if (midVal < key) {
 				low = mid + 1;
 			} else if (midVal > key) {
 				high = mid - 1;
 			} else {
 				return mid// key found
 			}
 		}
 		return -(low + 1); // key not found.
 	}
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(double[] aint fromIndexint toIndex,
 			double key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			double midVal = a[mid];
 
 			if (midVal < key) {
 				low = mid + 1; // Neither val is NaN, thisVal is smaller
 			} else if (midVal > key) {
 				high = mid - 1; // Neither val is NaN, thisVal is larger
 			} else {
 				long midBits = Double.doubleToLongBits(midVal);
 				long keyBits = Double.doubleToLongBits(key);
 				if (midBits == keyBits) {
 					return mid// Key found
 				} else if (midBits < keyBits) {
 					low = mid + 1;
 				} else {
 					// (0.0, -0.0) or (NaN, !NaN)
 					high = mid - 1;
 				}
 			}
 		}
 		return -(low + 1); // key not found.
 	}
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(float[] aint fromIndexint toIndex,
 			float key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			float midVal = a[mid];
 
 			if (midVal < key) {
 				low = mid + 1; // Neither val is NaN, thisVal is smaller
 			} else if (midVal > key) {
 				high = mid - 1; // Neither val is NaN, thisVal is larger
 			} else {
 				int midBits = Float.floatToIntBits(midVal);
 				int keyBits = Float.floatToIntBits(key);
 				if (midBits == keyBits) {
 					return mid// Key found
 				} else if (midBits < keyBits) {
 					low = mid + 1;
 				} else {
 					// (0.0, -0.0) or (NaN, !NaN)
 					high = mid - 1;
 				}
 			}
 		}
 		return -(low + 1); // key not found.
 	}
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(int[] aint fromIndexint toIndex,
 			int key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			int midVal = a[mid];
 
 			if (midVal < key) {
 				low = mid + 1;
 			} else if (midVal > key) {
 				high = mid - 1;
 			} else {
 				return mid// key found
 			}
 		}
 		return -(low + 1); // key not found.
 	}
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(long[] aint fromIndexint toIndex,
 			long key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			long midVal = a[mid];
 
 			if (midVal < key) {
 				low = mid + 1;
 			} else if (midVal > key) {
 				high = mid - 1;
 			} else {
 				return mid// key found
 			}
 		}
 		return -(low + 1); // key not found.
 	}
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(Object[] aint fromIndexint toIndex,
 			Object key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			Comparable midVal = (Comparablea[mid];
 			int cmp = midVal.compareTo(key);
 
 			if (cmp < 0) {
 				low = mid + 1;
 			} else if (cmp > 0) {
 				high = mid - 1;
 			} else {
 				return mid// key found
 			}
 		}
 		return -(low + 1); // key not found.
 	}
 
 	// Searching
 
 	// Like public version, but without range checks.
 	private static int binarySearch0(short[] aint fromIndexint toIndex,
 			short key) {
 		int low = fromIndex;
 		int high = toIndex - 1;
 
 		while (low <= high) {
 			int mid = low + high >>> 1;
 			short midVal = a[mid];
 
 			if (midVal < key) {
 				low = mid + 1;
 			} else if (midVal > key) {
 				high = mid - 1;
 			} else {
 				return mid// key found
		return -(low + 1); // key not found.
	// Like public version, but without range checks.
	private static <T> int binarySearch0(T[] aint fromIndexint toIndex,
keyComparator<? super T> c) {
		if (c == null) {
			return binarySearch0(afromIndextoIndexkey);
		int low = fromIndex;
		int high = toIndex - 1;
		while (low <= high) {
			int mid = low + high >>> 1;
midVal = a[mid];
			int cmp = c.compare(midValkey);
			if (cmp < 0) {
				low = mid + 1;
else if (cmp > 0) {
				high = mid - 1;
else {
				return mid// key found
		return -(low + 1); // key not found.
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with false elements to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static boolean[] copyOf(boolean[] originalint newLength) {
		boolean[] copy = new boolean[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with zeros to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static byte[] copyOf(byte[] originalint newLength) {
		byte[] copy = new byte[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with null characters to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static char[] copyOf(char[] originalint newLength) {
		char[] copy = new char[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with zeros to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static double[] copyOf(double[] originalint newLength) {
		double[] copy = new double[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with zeros to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static float[] copyOf(float[] originalint newLength) {
		float[] copy = new float[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with zeros to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static int[] copyOf(int[] originalint newLength) {
		int[] copy = new int[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with zeros to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static long[] copyOf(long[] originalint newLength) {
		long[] copy = new long[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with zeros to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static short[] copyOf(short[] originalint newLength) {
		short[] copy = new short[newLength];
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
Returns:
a copy of the original array, truncated or padded with nulls to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
Since:
1.6
	public static <T> T[] copyOf(T[] originalint newLength) {
		return (T[]) copyOf(originalnewLengthoriginal.getClass());
	}

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

Parameters:
original the array to be copied
newLength the length of the copy to be returned
newType the class of the copy to be returned
Returns:
a copy of the original array, truncated or padded with nulls to obtain the specified length
Throws:
java.lang.NegativeArraySizeException if newLength is negative
java.lang.NullPointerException if original is null
java.lang.ArrayStoreException if an element copied from original is not of a runtime type that can be stored in an array of class newType
Since:
1.6
	public static <T, U> T[] copyOf(U[] originalint newLength,
			Class<? extends T[]> newType) {
		T[] copy = (ObjectnewType == (ObjectObject[].class ? (T[]) new Object[newLength]
				: (T[]) Array
						.newInstance(newType.getComponentType(), newLength);
		System.arraycopy(original, 0, copy, 0,
				Math.min(original.lengthnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with false elements to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static boolean[] copyOfRange(boolean[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		boolean[] copy = new boolean[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with zeros to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static byte[] copyOfRange(byte[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		byte[] copy = new byte[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with null characters to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static char[] copyOfRange(char[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		char[] copy = new char[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with zeros to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static double[] copyOfRange(double[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		double[] copy = new double[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with zeros to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static float[] copyOfRange(float[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		float[] copy = new float[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with zeros to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static int[] copyOfRange(int[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		int[] copy = new int[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with zeros to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static long[] copyOfRange(long[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		long[] copy = new long[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with zeros to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static short[] copyOfRange(short[] originalint fromint to) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		short[] copy = new short[newLength];
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

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

The resulting array is of exactly the same class as the original array.

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
Returns:
a new array containing the specified range from the original array, truncated or padded with nulls to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
Since:
1.6
	public static <T> T[] copyOfRange(T[] originalint fromint to) {
		return copyOfRange(originalfromto, (Class<T[]>) original.getClass());
	}

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

Parameters:
original the array from which a range is to be copied
from the initial index of the range to be copied, inclusive
to the final index of the range to be copied, exclusive. (This index may lie outside the array.)
newType the class of the copy to be returned
Returns:
a new array containing the specified range from the original array, truncated or padded with nulls to obtain the required length
Throws:
java.lang.ArrayIndexOutOfBoundsException if from < 0 or from > original.length
java.lang.IllegalArgumentException if from > to
java.lang.NullPointerException if original is null
java.lang.ArrayStoreException if an element copied from original is not of a runtime type that can be stored in an array of class newType.
Since:
1.6
	public static <T, U> T[] copyOfRange(U[] originalint fromint to,
			Class<? extends T[]> newType) {
		int newLength = to - from;
		if (newLength < 0) {
			throw new IllegalArgumentException(from + " > " + to);
		T[] copy = (ObjectnewType == (ObjectObject[].class ? (T[]) new Object[newLength]
				: (T[]) Array
						.newInstance(newType.getComponentType(), newLength);
		System.arraycopy(originalfromcopy, 0,
				Math.min(original.length - fromnewLength));
		return copy;
	}

Returns true if the two specified arrays are deeply equal to one another. Unlike the equals(java.lang.Object[],java.lang.Object[]) method, this method is appropriate for use with nested arrays of arbitrary depth.

Two array references are considered deeply equal if both are null, or if they refer to arrays that contain the same number of elements and all corresponding pairs of elements in the two arrays are deeply equal.

Two possibly null elements e1 and e2 are deeply equal if any of the following conditions hold:

  • e1 and e2 are both arrays of object reference types, and Arrays.deepEquals(e1, e2) would return true
  • e1 and e2 are arrays of the same primitive type, and the appropriate overloading of Arrays.equals(e1, e2) would return true.
  • e1 == e2
  • e1.equals(e2) would return true.
Note that this definition permits null elements at any depth.

If either of the specified arrays contain themselves as elements either directly or indirectly through one or more levels of arrays, the behavior of this method is undefined.

Parameters:
a1 one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
Since:
1.5
See also:
equals(java.lang.Object[],java.lang.Object[])
Objects#deepEquals(Object , Object )
	public static boolean deepEquals(Object[] a1Object[] a2) {
		if (a1 == a2) {
			return true;
		if (a1 == null || a2 == null) {
			return false;
		int length = a1.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			Object e1 = a1[i];
			Object e2 = a2[i];
			if (e1 == e2) {
				continue;
			if (e1 == null) {
				return false;
			// Figure out whether the two elements are equal
			boolean eq = deepEquals0(e1e2);
			if (!eq) {
				return false;
		return true;
	static boolean deepEquals0(Object e1Object e2) {
		assert e1 != null;
		boolean eq;
		if (e1 instanceof Object[] && e2 instanceof Object[]) {
			eq = deepEquals((Object[]) e1, (Object[]) e2);
else if (e1 instanceof byte[] && e2 instanceof byte[]) {
			eq = equals((byte[]) e1, (byte[]) e2);
else if (e1 instanceof short[] && e2 instanceof short[]) {
			eq = equals((short[]) e1, (short[]) e2);
else if (e1 instanceof int[] && e2 instanceof int[]) {
			eq = equals((int[]) e1, (int[]) e2);
else if (e1 instanceof long[] && e2 instanceof long[]) {
			eq = equals((long[]) e1, (long[]) e2);
else if (e1 instanceof char[] && e2 instanceof char[]) {
			eq = equals((char[]) e1, (char[]) e2);
else if (e1 instanceof float[] && e2 instanceof float[]) {
			eq = equals((float[]) e1, (float[]) e2);
else if (e1 instanceof double[] && e2 instanceof double[]) {
			eq = equals((double[]) e1, (double[]) e2);
else if (e1 instanceof boolean[] && e2 instanceof boolean[]) {
			eq = equals((boolean[]) e1, (boolean[]) e2);
else {
			eq = e1.equals(e2);
		return eq;
	}

Returns a hash code based on the "deep contents" of the specified array. If the array contains other arrays as elements, the hash code is based on their contents and so on, ad infinitum. It is therefore unacceptable to invoke this method on an array that contains itself as an element, either directly or indirectly through one or more levels of arrays. The behavior of such an invocation is undefined.

For any two arrays a and b such that Arrays.deepEquals(a, b), it is also the case that Arrays.deepHashCode(a) == Arrays.deepHashCode(b).

The computation of the value returned by this method is similar to that of the value returned by java.util.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.

Parameters:
a the array whose deep-content-based hash code to compute
Returns:
a deep-content-based hash code for a
Since:
1.5
See also:
hashCode(java.lang.Object[])
	public static int deepHashCode(Object a[]) {
		if (a == null) {
			return 0;
		int result = 1;
		for (Object element : a) {
			int elementHash = 0;
			if (element instanceof Object[]) {
				elementHash = deepHashCode((Object[]) element);
else if (element instanceof byte[]) {
				elementHash = hashCode((byte[]) element);
else if (element instanceof short[]) {
				elementHash = hashCode((short[]) element);
else if (element instanceof int[]) {
				elementHash = hashCode((int[]) element);
else if (element instanceof long[]) {
				elementHash = hashCode((long[]) element);
else if (element instanceof char[]) {
				elementHash = hashCode((char[]) element);
else if (element instanceof float[]) {
				elementHash = hashCode((float[]) element);
else if (element instanceof double[]) {
				elementHash = hashCode((double[]) element);
else if (element instanceof boolean[]) {
				elementHash = hashCode((boolean[]) element);
else if (element != null) {
				elementHash = element.hashCode();
			result = 31 * result + elementHash;
		return result;
	}

Returns a string representation of the "deep contents" of the specified array. If the array contains other arrays as elements, the string representation contains their contents and so on. This method is designed for converting multidimensional arrays to strings.

The string representation consists of a list of the array's elements, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (a comma followed by a space). Elements are converted to strings as by String.valueOf(Object), unless they are themselves arrays.

If an element e is an array of a primitive type, it is converted to a string as by invoking the appropriate overloading of Arrays.toString(e). If an element e is an array of a reference type, it is converted to a string as by invoking this method recursively.

To avoid infinite recursion, if the specified array contains itself as an element, or contains an indirect reference to itself through one or more levels of arrays, the 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.

Parameters:
a the array whose string representation to return
Returns:
a string representation of a
Since:
1.5
See also:
toString(java.lang.Object[])
	public static String deepToString(Object[] a) {
		if (a == null) {
			return "null";
		int bufLen = 20 * a.length;
		if (a.length != 0 && bufLen <= 0) {
			bufLen = .;
		StringBuilder buf = new StringBuilder(bufLen);
		deepToString(abufnew HashSet<Object[]>());
		return buf.toString();
	private static void deepToString(Object[] aStringBuilder buf,
			Set<Object[]> dejaVu) {
		if (a == null) {
			buf.append("null");
			return;
		int iMax = a.length - 1;
		if (iMax == -1) {
			buf.append("[]");
			return;
		dejaVu.add(a);
		buf.append('[');
		for (int i = 0;; i++) {
			Object element = a[i];
			if (element == null) {
				buf.append("null");
else {
				Class eClass = element.getClass();
				if (eClass.isArray()) {
					if (eClass == byte[].class) {
						buf.append(toString((byte[]) element));
else if (eClass == short[].class) {
						buf.append(toString((short[]) element));
else if (eClass == int[].class) {
						buf.append(toString((int[]) element));
else if (eClass == long[].class) {
						buf.append(toString((long[]) element));
else if (eClass == char[].class) {
						buf.append(toString((char[]) element));
else if (eClass == float[].class) {
						buf.append(toString((float[]) element));
else if (eClass == double[].class) {
						buf.append(toString((double[]) element));
else if (eClass == boolean[].class) {
						buf.append(toString((boolean[]) element));
else { // element is an array of object references
						if (dejaVu.contains(element)) {
							buf.append("[...]");
else {
							deepToString((Object[]) elementbufdejaVu);
else { // element is non-null and not an array
					buf.append(element.toString());
			if (i == iMax) {
				break;
			buf.append(", ");
		buf.append(']');
		dejaVu.remove(a);
	// Equality Testing
Returns true if the two specified arrays of booleans are equal to one another. Two arrays are considered equal if both arrays contain the same number of elements, and all corresponding pairs of elements in the two arrays are equal. In other words, two arrays are equal if they contain the same elements in the same order. Also, two array references are considered equal if both are null.

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
	public static boolean equals(boolean[] aboolean[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (a[i] != a2[i]) {
				return false;
		return true;
	}

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

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
	public static boolean equals(byte[] abyte[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (a[i] != a2[i]) {
				return false;
		return true;
	}

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

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
	public static boolean equals(char[] achar[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (a[i] != a2[i]) {
				return false;
		return true;
	}

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

Two doubles d1 and d2 are considered equal if:

 new Double(d1).equals(new Double(d2))
 
(Unlike the == operator, this method considers NaN equals to itself, and 0.0d unequal to -0.0d.)

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
See also:
java.lang.Double.equals(java.lang.Object)
	public static boolean equals(double[] adouble[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (Double.doubleToLongBits(a[i]) != Double.doubleToLongBits(a2[i])) {
				return false;
		return true;
	}

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

Two floats f1 and f2 are considered equal if:

 new Float(f1).equals(new Float(f2))
 
(Unlike the == operator, this method considers NaN equals to itself, and 0.0f unequal to -0.0f.)

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
See also:
java.lang.Float.equals(java.lang.Object)
	public static boolean equals(float[] afloat[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (Float.floatToIntBits(a[i]) != Float.floatToIntBits(a2[i])) {
				return false;
		return true;
	}

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

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
	public static boolean equals(int[] aint[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (a[i] != a2[i]) {
				return false;
		return true;
	}

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

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
	public static boolean equals(long[] along[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (a[i] != a2[i]) {
				return false;
		return true;
	}

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

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
	public static boolean equals(Object[] aObject[] a2) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			Object o1 = a[i];
			Object o2 = a2[i];
			if (!(o1 == null ? o2 == null : o1.equals(o2))) {
				return false;
		return true;
	}

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

Parameters:
a one array to be tested for equality
a2 the other array to be tested for equality
Returns:
true if the two arrays are equal
	public static boolean equals(short[] ashort a2[]) {
		if (a == a2) {
			return true;
		if (a == null || a2 == null) {
			return false;
		int length = a.length;
		if (a2.length != length) {
			return false;
		for (int i = 0; i < lengthi++) {
			if (a[i] != a2[i]) {
				return false;
		return true;
	// Filling
Assigns the specified boolean value to each element of the specified array of booleans.

Parameters:
a the array to be filled
val the value to be stored in all elements of the array
	public static void fill(boolean[] aboolean val) {
		for (int i = 0, len = a.lengthi < leni++) {