Android购物APP

package com.ta.common; import java.io.Serializable; import java.lang.reflect.Array; import java.util.AbstractList; import java.util.Comparator; import java.util.List; import java.util.RandomAccess; /** * {@code Arrays} contains static methods which operate on arrays. * * @since 1.2 */ public class Arrays { private static class ArrayList<E> extends AbstractList<E> implements List<E>, Serializable, RandomAccess { private static final long serialVersionUID = -2764017481108945198L; private final E[] a; ArrayList(E[] storage) { if (storage == null) { throw new NullPointerException(); } a = storage; } @Override public boolean contains(Object object) { if (object != null) { for (E element : a) { if (object.equals(element)) { return true; } } } else { for (E element : a) { if (element == null) { return true; } } } return false; } @Override public E get(int location) { try { return a[location]; } catch (ArrayIndexOutOfBoundsException e) { // throw // java.util.ArrayList.throwIndexOutOfBoundsException(location, // a.length); throw e; } } @Override public int indexOf(Object object) { if (object != null) { for (int i = 0; i < a.length; i++) { if (object.equals(a[i])) { return i; } } } else { for (int i = 0; i < a.length; i++) { if (a[i] == null) { return i; } } } return -1; } @Override public int lastIndexOf(Object object) { if (object != null) { for (int i = a.length - 1; i >= 0; i--) { if (object.equals(a[i])) { return i; } } } else { for (int i = a.length - 1; i >= 0; i--) { if (a[i] == null) { return i; } } } return -1; } @Override public E set(int location, E object) { E result = a[location]; a[location] = object; return result; } @Override public int size() { return a.length; } @Override public Object[] toArray() { return a.clone(); } @SuppressWarnings("unchecked") @Override public <T> T[] toArray(T[] contents) { int size = size(); if (size > contents.length) { Class<?> ct = contents.getClass().getComponentType(); contents = (T[]) Array.newInstance(ct, size); } System.arraycopy(a, 0, contents, 0, size); if (size < contents.length) { contents[size] = null; } return contents; } } private Arrays() { /* empty */ } /** * Returns a {@code List} of the objects in the specified array. The size of * the {@code List} cannot be modified, i.e. adding and removing are * unsupported, but the elements can be set. Setting an element modifies the * underlying array. * * @param array * the array. * @return a {@code List} of the elements of the specified array. */ public static <T> List<T> asList(T... array) { return new ArrayList<T>(array); } /** * Performs a binary search for {@code value} in the ascending sorted array * {@code array}. Searching in an unsorted array has an undefined result. * It's also undefined which element is found if there are multiple * occurrences of the same element. * * @param array * the sorted array to search. * @param value * the element to find. * @return the non-negative index of the element, or a negative index which * is {@code -index - 1} where the element would be inserted. */ public static int binarySearch(byte[] array, byte value) { return binarySearch(array, 0, array.length, value); } /** * Performs a binary search for {@code value} in the ascending sorted array * {@code array}, in the range specified by fromIndex (inclusive) and * toIndex (exclusive). Searching in an unsorted array has an undefined * result. It's also undefined which element is found if there are multiple * occurrences of the same element. * * @param array * the sorted array to search. * @param startIndex * the inclusive start index. * @param endIndex * the exclusive start index. * @param value * the element to find. * @return the non-negative index of the element, or a negative index which * is {@code -index - 1} where the element would be inserted. * @throws IllegalArgumentException * if {@code startIndex > endIndex} * @throws ArrayIndexOutOfBoundsException * if {@code startIndex < 0 || endIndex > array.length} * @since 1.6 */ public static int binarySearch(byte[] array, int startIndex, int endIndex, byte value) { checkBinarySearchBounds(startIndex, endIndex, array.length); int lo = startIndex; int hi = endIndex - 1; while (lo <= hi) { int mid = (lo + hi) >>> 1; byte midVal = array[mid]; if (midVal < value) { lo = mid + 1; } else if (midVal > value) { hi = mid - 1; } else { return mid; // value found } } return ~lo; // value not present } /** * Performs a binary search for {@code value} in the ascending sorted array * {@code array}. Searching in an unsorted array has an undefined result. * It's also undefined which element is found if there are multiple * occurrences of the same element. * * @param array * the sorted array to search. * @param value * the element to find. * @return the non-negative index of the element, or a negative index which * is {@code -index - 1} where the element would be inserted. */ public static int binarySearch(char[] array, char value) { return binarySearch(array, 0, array.length, value); } /** * Performs a binary search for {@code value} in the ascending sorted array * {@code array}, in the range specified by fromIndex (inclusive) and * toIndex (exclusive). Searching in an unsorted array has an undefined * result. It's also undefined which element is found if there are multiple * occurrences of the same element. * * @param array * the sorted array to search. * @param startIndex * the inclusive start index. * @param endIndex * the exclusive start index. * @param value * the element to find. * @return the non-negative index of the element, or a negative index which * is {@code -index - 1} where the element would be inserted. * @throws IllegalArgumentException * if {@code startIndex > endIndex} * @throws ArrayIndexOutOfBoundsException * if {@code startIndex < 0 || endIndex > array.length} * @since 1.6 */ public static int binarySearch(char[] array, int startIndex, int endIndex, char value) { checkBinarySearchBounds(startIndex, endIndex, array.length); int lo = startIndex; int hi = endIndex - 1; while (lo <= hi) { int mid = (lo + hi) >>> 1; char midVal = array[mid]; if (midVal < value) { lo = mid + 1; } else if (midVal > value) { hi = mid - 1; } else { return mid; // value found } } return ~lo; // value not present } /** * Performs a binary search for {@code value} in the ascending sorted array * {@code array}. Searching in an unsorted array has an undefined result. * It's also undefined which element is found if there are multiple * occurrences of the same element. * * @param array * the sorted array to search. * @param value * the element to find. * @return the non-negative index of the element, or a negative index which * is {@code -index - 1} where the element would be inserted. */ public static int binarySearch(double[] array, double value) { return binarySearch(array, 0, array.length, value); } /** * Performs a binary search for {@code value} in the ascending sorted array * {@code array}, in the