com.google.gwt.emul.java.util.ArrayList Maven / Gradle / Ivy
/*
* Copyright 2007 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
* use this file except in compliance with the License. You may obtain a copy of
* the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations under
* the License.
*/
package java.util;
import static com.google.gwt.core.shared.impl.InternalPreconditions.checkArgument;
import static com.google.gwt.core.shared.impl.InternalPreconditions.checkElementIndex;
import static com.google.gwt.core.shared.impl.InternalPreconditions.checkPositionIndex;
import static com.google.gwt.core.shared.impl.InternalPreconditions.checkPositionIndexes;
import com.google.gwt.lang.Array;
import java.io.Serializable;
/**
* Resizeable array implementation of the List interface. [Sun
* docs]
*
*
* This implementation differs from JDK 1.5 ArrayList in terms of
* capacity management. There is no speed advantage to pre-allocating array
* sizes in JavaScript, so this implementation does not include any of the
* capacity and "growth increment" concepts in the standard ArrayList class.
* Although ArrayList(int) accepts a value for the initial
* capacity of the array, this constructor simply delegates to
* ArrayList(). It is only present for compatibility with JDK
* 1.5's API.
*
*
* @param the element type.
*/
public class ArrayList extends AbstractList implements List,
Cloneable, RandomAccess, Serializable {
private static native void splice(Object[] array, int index, int deleteCount) /*-{
array.splice(index, deleteCount);
}-*/;
private static native void splice(Object[] array, int index, int deleteCount,
Object value) /*-{
array.splice(index, deleteCount, value);
}-*/;
private void insertAt(int index, Object[] values) {
Array.nativeArrayInsert(values, 0, array, index, values.length);
}
/**
* This field holds a JavaScript array.
*/
private transient E[] array = (E[]) new Object[0];
/**
* Ensures that RPC will consider type parameter E to be exposed. It will be
* pruned by dead code elimination.
*/
@SuppressWarnings("unused")
private E exposeElement;
public ArrayList() {
}
public ArrayList(Collection c) {
// Avoid calling overridable methods from constructors
insertAt(0, c.toArray());
}
public ArrayList(int initialCapacity) {
// Avoid calling overridable methods from constructors
checkArgument(initialCapacity >= 0, "Initial capacity must not be negative");
}
@Override
public boolean add(E o) {
array[array.length] = o;
return true;
}
@Override
public void add(int index, E o) {
checkPositionIndex(index, array.length);
splice(array, index, 0, o);
}
@Override
public boolean addAll(Collection c) {
Object[] cArray = c.toArray();
int len = cArray.length;
if (len == 0) {
return false;
}
insertAt(array.length, cArray);
return true;
}
@Override
public boolean addAll(int index, Collection c) {
checkPositionIndex(index, array.length);
Object[] cArray = c.toArray();
int len = cArray.length;
if (len == 0) {
return false;
}
insertAt(index, cArray);
return true;
}
@Override
public void clear() {
array = (E[]) new Object[0];
}
public Object clone() {
return new ArrayList(this);
}
@Override
public boolean contains(Object o) {
return (indexOf(o) != -1);
}
public void ensureCapacity(int ignored) {
// Ignored.
}
@Override
public E get(int index) {
checkElementIndex(index, array.length);
return array[index];
}
@Override
public int indexOf(Object o) {
return indexOf(o, 0);
}
@Override
public boolean isEmpty() {
return array.length == 0;
}
@Override
public int lastIndexOf(Object o) {
return lastIndexOf(o, size() - 1);
}
@Override
public E remove(int index) {
E previous = get(index);
splice(array, index, 1);
return previous;
}
@Override
public boolean remove(Object o) {
int i = indexOf(o);
if (i == -1) {
return false;
}
remove(i);
return true;
}
@Override
public E set(int index, E o) {
E previous = get(index);
array[index] = o;
return previous;
}
@Override
public int size() {
return array.length;
}
@Override
public Object[] toArray() {
return Array.cloneSubrange(array, 0, array.length);
}
/*
* Faster than the iterator-based implementation in AbstractCollection.
*/
@SuppressWarnings("unchecked")
@Override
public T[] toArray(T[] out) {
int size = array.length;
if (out.length < size) {
out = Array.createFrom(out, size);
}
for (int i = 0; i < size; ++i) {
out[i] = (T) array[i];
}
if (out.length > size) {
out[size] = null;
}
return out;
}
public void trimToSize() {
// We are always trimmed to size.
}
@Override
protected void removeRange(int fromIndex, int endIndex) {
checkPositionIndexes(fromIndex, endIndex, array.length);
int count = endIndex - fromIndex;
splice(array, fromIndex, count);
}
/**
* Used by Vector.
*/
int indexOf(Object o, int index) {
for (; index < array.length; ++index) {
if (Objects.equals(o, array[index])) {
return index;
}
}
return -1;
}
/**
* Used by Vector.
*/
int lastIndexOf(Object o, int index) {
for (; index >= 0; --index) {
if (Objects.equals(o, array[index])) {
return index;
}
}
return -1;
}
native void setSize(int newSize) /*-{
this.@ArrayList::array.length = newSize;
}-*/;
}