001/*
002 * Copyright (C) 2007 The Guava Authors
003 *
004 * Licensed under the Apache License, Version 2.0 (the "License");
005 * you may not use this file except in compliance with the License.
006 * You may obtain a copy of the License at
007 *
008 * http://www.apache.org/licenses/LICENSE-2.0
009 *
010 * Unless required by applicable law or agreed to in writing, software
011 * distributed under the License is distributed on an "AS IS" BASIS,
012 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
013 * See the License for the specific language governing permissions and
014 * limitations under the License.
015 */
016
017package com.google.common.collect;
018
019import static com.google.common.base.Preconditions.checkPositionIndexes;
020
021import com.google.common.annotations.GwtCompatible;
022import com.google.common.annotations.GwtIncompatible;
023import com.google.errorprone.annotations.CanIgnoreReturnValue;
024import java.lang.reflect.Array;
025import java.util.Arrays;
026import java.util.Collection;
027import javax.annotation.Nullable;
028
029/**
030 * Static utility methods pertaining to object arrays.
031 *
032 * @author Kevin Bourrillion
033 * @since 2.0
034 */
035@GwtCompatible(emulated = true)
036public final class ObjectArrays {
037  static final Object[] EMPTY_ARRAY = new Object[0];
038
039  private ObjectArrays() {}
040
041  /**
042   * Returns a new array of the given length with the specified component type.
043   *
044   * @param type the component type
045   * @param length the length of the new array
046   */
047  @GwtIncompatible // Array.newInstance(Class, int)
048  @SuppressWarnings("unchecked")
049  public static <T> T[] newArray(Class<T> type, int length) {
050    return (T[]) Array.newInstance(type, length);
051  }
052
053  /**
054   * Returns a new array of the given length with the same type as a reference
055   * array.
056   *
057   * @param reference any array of the desired type
058   * @param length the length of the new array
059   */
060  public static <T> T[] newArray(T[] reference, int length) {
061    return Platform.newArray(reference, length);
062  }
063
064  /**
065   * Returns a new array that contains the concatenated contents of two arrays.
066   *
067   * @param first the first array of elements to concatenate
068   * @param second the second array of elements to concatenate
069   * @param type the component type of the returned array
070   */
071  @GwtIncompatible // Array.newInstance(Class, int)
072  public static <T> T[] concat(T[] first, T[] second, Class<T> type) {
073    T[] result = newArray(type, first.length + second.length);
074    System.arraycopy(first, 0, result, 0, first.length);
075    System.arraycopy(second, 0, result, first.length, second.length);
076    return result;
077  }
078
079  /**
080   * Returns a new array that prepends {@code element} to {@code array}.
081   *
082   * @param element the element to prepend to the front of {@code array}
083   * @param array the array of elements to append
084   * @return an array whose size is one larger than {@code array}, with
085   *     {@code element} occupying the first position, and the
086   *     elements of {@code array} occupying the remaining elements.
087   */
088  public static <T> T[] concat(@Nullable T element, T[] array) {
089    T[] result = newArray(array, array.length + 1);
090    result[0] = element;
091    System.arraycopy(array, 0, result, 1, array.length);
092    return result;
093  }
094
095  /**
096   * Returns a new array that appends {@code element} to {@code array}.
097   *
098   * @param array the array of elements to prepend
099   * @param element the element to append to the end
100   * @return an array whose size is one larger than {@code array}, with
101   *     the same contents as {@code array}, plus {@code element} occupying the
102   *     last position.
103   */
104  public static <T> T[] concat(T[] array, @Nullable T element) {
105    T[] result = Arrays.copyOf(array, array.length + 1);
106    result[array.length] = element;
107    return result;
108  }
109
110  /**
111   * Returns an array containing all of the elements in the specified
112   * collection; the runtime type of the returned array is that of the specified
113   * array. If the collection fits in the specified array, it is returned
114   * therein. Otherwise, a new array is allocated with the runtime type of the
115   * specified array and the size of the specified collection.
116   *
117   * <p>If the collection fits in the specified array with room to spare (i.e.,
118   * the array has more elements than the collection), the element in the array
119   * immediately following the end of the collection is set to {@code null}.
120   * This is useful in determining the length of the collection <i>only</i> if
121   * the caller knows that the collection does not contain any null elements.
122   *
123   * <p>This method returns the elements in the order they are returned by the
124   * collection's iterator.
125   *
126   * <p>TODO(kevinb): support concurrently modified collections?
127   *
128   * @param c the collection for which to return an array of elements
129   * @param array the array in which to place the collection elements
130   * @throws ArrayStoreException if the runtime type of the specified array is
131   *     not a supertype of the runtime type of every element in the specified
132   *     collection
133   */
134  static <T> T[] toArrayImpl(Collection<?> c, T[] array) {
135    int size = c.size();
136    if (array.length < size) {
137      array = newArray(array, size);
138    }
139    fillArray(c, array);
140    if (array.length > size) {
141      array[size] = null;
142    }
143    return array;
144  }
145
146  /**
147   * Implementation of {@link Collection#toArray(Object[])} for collections backed by an object
148   * array. the runtime type of the returned array is that of the specified array. If the collection
149   * fits in the specified array, it is returned therein. Otherwise, a new array is allocated with
150   * the runtime type of the specified array and the size of the specified collection.
151   *
152   * <p>If the collection fits in the specified array with room to spare (i.e., the array has more
153   * elements than the collection), the element in the array immediately following the end of the
154   * collection is set to {@code null}. This is useful in determining the length of the collection
155   * <i>only</i> if the caller knows that the collection does not contain any null elements.
156   */
157  static <T> T[] toArrayImpl(Object[] src, int offset, int len, T[] dst) {
158    checkPositionIndexes(offset, offset + len, src.length);
159    if (dst.length < len) {
160      dst = newArray(dst, len);
161    } else if (dst.length > len) {
162      dst[len] = null;
163    }
164    System.arraycopy(src, offset, dst, 0, len);
165    return dst;
166  }
167
168  /**
169   * Returns an array containing all of the elements in the specified
170   * collection. This method returns the elements in the order they are returned
171   * by the collection's iterator. The returned array is "safe" in that no
172   * references to it are maintained by the collection. The caller is thus free
173   * to modify the returned array.
174   *
175   * <p>This method assumes that the collection size doesn't change while the
176   * method is running.
177   *
178   * <p>TODO(kevinb): support concurrently modified collections?
179   *
180   * @param c the collection for which to return an array of elements
181   */
182  static Object[] toArrayImpl(Collection<?> c) {
183    return fillArray(c, new Object[c.size()]);
184  }
185
186  /**
187   * Returns a copy of the specified subrange of the specified array that is literally an Object[],
188   * and not e.g. a {@code String[]}.
189   */
190  static Object[] copyAsObjectArray(Object[] elements, int offset, int length) {
191    checkPositionIndexes(offset, offset + length, elements.length);
192    if (length == 0) {
193      return EMPTY_ARRAY;
194    }
195    Object[] result = new Object[length];
196    System.arraycopy(elements, offset, result, 0, length);
197    return result;
198  }
199
200  @CanIgnoreReturnValue
201  private static Object[] fillArray(Iterable<?> elements, Object[] array) {
202    int i = 0;
203    for (Object element : elements) {
204      array[i++] = element;
205    }
206    return array;
207  }
208
209  /**
210   * Swaps {@code array[i]} with {@code array[j]}.
211   */
212  static void swap(Object[] array, int i, int j) {
213    Object temp = array[i];
214    array[i] = array[j];
215    array[j] = temp;
216  }
217
218  @CanIgnoreReturnValue
219  static Object[] checkElementsNotNull(Object... array) {
220    return checkElementsNotNull(array, array.length);
221  }
222
223  @CanIgnoreReturnValue
224  static Object[] checkElementsNotNull(Object[] array, int length) {
225    for (int i = 0; i < length; i++) {
226      checkElementNotNull(array[i], i);
227    }
228    return array;
229  }
230
231  // We do this instead of Preconditions.checkNotNull to save boxing and array
232  // creation cost.
233  @CanIgnoreReturnValue
234  static Object checkElementNotNull(Object element, int index) {
235    if (element == null) {
236      throw new NullPointerException("at index " + index);
237    }
238    return element;
239  }
240}