| // Protocol Buffers - Google's data interchange format |
| // Copyright 2008 Google Inc. All rights reserved. |
| // https://developers.google.com/protocol-buffers/ |
| // |
| // Redistribution and use in source and binary forms, with or without |
| // modification, are permitted provided that the following conditions are |
| // met: |
| // |
| // * Redistributions of source code must retain the above copyright |
| // notice, this list of conditions and the following disclaimer. |
| // * Redistributions in binary form must reproduce the above |
| // copyright notice, this list of conditions and the following disclaimer |
| // in the documentation and/or other materials provided with the |
| // distribution. |
| // * Neither the name of Google Inc. nor the names of its |
| // contributors may be used to endorse or promote products derived from |
| // this software without specific prior written permission. |
| // |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| |
| package com.google.protobuf; |
| |
| import com.google.protobuf.Internal.ProtobufList; |
| import java.util.Arrays; |
| import java.util.RandomAccess; |
| |
| /** Implements {@link ProtobufList} for non-primitive and {@link String} types. */ |
| final class ProtobufArrayList<E> extends AbstractProtobufList<E> implements RandomAccess { |
| |
| private static final ProtobufArrayList<Object> EMPTY_LIST = |
| new ProtobufArrayList<Object>(new Object[0], 0); |
| |
| static { |
| EMPTY_LIST.makeImmutable(); |
| } |
| |
| @SuppressWarnings("unchecked") // Guaranteed safe by runtime. |
| public static <E> ProtobufArrayList<E> emptyList() { |
| return (ProtobufArrayList<E>) EMPTY_LIST; |
| } |
| |
| private E[] array; |
| private int size; |
| |
| @SuppressWarnings("unchecked") |
| ProtobufArrayList() { |
| this((E[]) new Object[DEFAULT_CAPACITY], 0); |
| } |
| |
| private ProtobufArrayList(E[] array, int size) { |
| this.array = array; |
| this.size = size; |
| } |
| |
| @Override |
| public ProtobufArrayList<E> mutableCopyWithCapacity(int capacity) { |
| if (capacity < size) { |
| throw new IllegalArgumentException(); |
| } |
| |
| E[] newArray = Arrays.copyOf(array, capacity); |
| |
| return new ProtobufArrayList<E>(newArray, size); |
| } |
| |
| @Override |
| public boolean add(E element) { |
| ensureIsMutable(); |
| |
| if (size == array.length) { |
| // Resize to 1.5x the size |
| int length = ((size * 3) / 2) + 1; |
| E[] newArray = Arrays.copyOf(array, length); |
| |
| array = newArray; |
| } |
| |
| array[size++] = element; |
| modCount++; |
| |
| return true; |
| } |
| |
| @Override |
| public void add(int index, E element) { |
| ensureIsMutable(); |
| |
| if (index < 0 || index > size) { |
| throw new IndexOutOfBoundsException(makeOutOfBoundsExceptionMessage(index)); |
| } |
| |
| if (size < array.length) { |
| // Shift everything over to make room |
| System.arraycopy(array, index, array, index + 1, size - index); |
| } else { |
| // Resize to 1.5x the size |
| int length = ((size * 3) / 2) + 1; |
| E[] newArray = createArray(length); |
| |
| // Copy the first part directly |
| System.arraycopy(array, 0, newArray, 0, index); |
| |
| // Copy the rest shifted over by one to make room |
| System.arraycopy(array, index, newArray, index + 1, size - index); |
| array = newArray; |
| } |
| |
| array[index] = element; |
| size++; |
| modCount++; |
| } |
| |
| @Override |
| public E get(int index) { |
| ensureIndexInRange(index); |
| return array[index]; |
| } |
| |
| @Override |
| public E remove(int index) { |
| ensureIsMutable(); |
| ensureIndexInRange(index); |
| |
| E value = array[index]; |
| if (index < size - 1) { |
| System.arraycopy(array, index + 1, array, index, size - index - 1); |
| } |
| |
| size--; |
| modCount++; |
| return value; |
| } |
| |
| @Override |
| public E set(int index, E element) { |
| ensureIsMutable(); |
| ensureIndexInRange(index); |
| |
| E toReturn = array[index]; |
| array[index] = element; |
| |
| modCount++; |
| return toReturn; |
| } |
| |
| @Override |
| public int size() { |
| return size; |
| } |
| |
| @SuppressWarnings("unchecked") |
| private static <E> E[] createArray(int capacity) { |
| return (E[]) new Object[capacity]; |
| } |
| |
| private void ensureIndexInRange(int index) { |
| if (index < 0 || index >= size) { |
| throw new IndexOutOfBoundsException(makeOutOfBoundsExceptionMessage(index)); |
| } |
| } |
| |
| private String makeOutOfBoundsExceptionMessage(int index) { |
| return "Index:" + index + ", Size:" + size; |
| } |
| } |