Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright 2008 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 javaemul.internal.InternalPreconditions.checkElement;
import java.io.Serializable;
import java.util.function.Consumer;
import java.util.function.Predicate;
import java.util.function.UnaryOperator;
import jsinterop.annotations.JsNonNull;
/**
* To keep performance characteristics in line with Java community expectations,
* Vector is a wrapper around ArrayList.
* See
* the official Java API doc for details.
*
* @param element type.
*/
public class Vector extends AbstractList implements List,
RandomAccess, Cloneable, Serializable {
private transient ArrayList arrayList;
/**
* 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 Vector() {
arrayList = new ArrayList();
}
public Vector(Collection c) {
arrayList = new ArrayList();
addAll(c);
}
public Vector(int initialCapacity) {
arrayList = new ArrayList(initialCapacity);
}
/**
* Capacity increment is ignored.
*/
@SuppressWarnings("unused")
public Vector(int initialCapacity, int ignoredCapacityIncrement) {
this(initialCapacity);
}
@Override
public boolean add(E o) {
return arrayList.add(o);
}
@Override
public void add(int index, E o) {
checkArrayElementIndex(index, size() + 1);
arrayList.add(index, o);
}
@Override
public boolean addAll(Collection c) {
return arrayList.addAll(c);
}
@Override
public boolean addAll(int index, Collection c) {
checkArrayElementIndex(index, size() + 1);
return arrayList.addAll(index, c);
}
public void addElement(E o) {
add(o);
}
public int capacity() {
return arrayList.size();
}
@Override
public void clear() {
arrayList.clear();
}
public Object clone() {
return new Vector(this);
}
@Override
public boolean contains(Object elem) {
return arrayList.contains(elem);
}
@Override
public boolean containsAll(Collection c) {
return arrayList.containsAll(c);
}
public void copyInto(Object[] objs) {
int i = -1;
int n = size();
while (++i < n) {
objs[i] = get(i);
}
}
public E elementAt(int index) {
return get(index);
}
public Enumeration elements() {
return Collections.enumeration(arrayList);
}
public void ensureCapacity(int capacity) {
arrayList.ensureCapacity(capacity);
}
public E firstElement() {
checkElement(!isEmpty());
return get(0);
}
@Override
public void forEach(Consumer consumer) {
arrayList.forEach(consumer);
}
@Override
public E get(int index) {
checkArrayElementIndex(index, size());
return arrayList.get(index);
}
@Override
public int indexOf(Object elem) {
return arrayList.indexOf(elem);
}
public int indexOf(Object elem, int index) {
checkArrayIndexOutOfBounds(index >= 0, index);
return arrayList.indexOf(elem, index);
}
public void insertElementAt(E o, int index) {
add(index, o);
}
@Override
public boolean isEmpty() {
return (arrayList.size() == 0);
}
@Override
public Iterator iterator() {
return arrayList.iterator();
}
public E lastElement() {
checkElement(!isEmpty());
return get(size() - 1);
}
@Override
public int lastIndexOf(Object o) {
return arrayList.lastIndexOf(o);
}
public int lastIndexOf(Object o, int index) {
checkArrayIndexOutOfBounds(index < size(), index);
return arrayList.lastIndexOf(o, index);
}
@Override
public E remove(int index) {
checkArrayElementIndex(index, size());
return arrayList.remove(index);
}
@Override
public boolean removeAll(Collection c) {
return arrayList.removeAll(c);
}
public void removeAllElements() {
clear();
}
public boolean removeElement(Object o) {
return remove(o);
}
public void removeElementAt(int index) {
remove(index);
}
@Override
public boolean removeIf(Predicate filter) {
return arrayList.removeIf(filter);
}
@Override
public void replaceAll(UnaryOperator operator) {
arrayList.replaceAll(operator);
}
@Override
public E set(int index, E elem) {
checkArrayElementIndex(index, size());
return arrayList.set(index, elem);
}
public void setElementAt(E o, int index) {
set(index, o);
}
public void setSize(int size) {
checkArrayIndexOutOfBounds(size >= 0, size);
arrayList.setSize(size);
}
@Override
public int size() {
return arrayList.size();
}
@Override
public void sort(Comparator c) {
arrayList.sort(c);
}
@Override
@JsNonNull
public List subList(int fromIndex, int toIndex) {
return arrayList.subList(fromIndex, toIndex);
}
@Override
public Object[] toArray() {
return arrayList.toArray();
}
@Override
public T[] toArray(T[] a) {
return arrayList.toArray(a);
}
@Override
public String toString() {
return arrayList.toString();
}
public void trimToSize() {
arrayList.trimToSize();
}
@Override
protected void removeRange(int fromIndex, int endIndex) {
arrayList.removeRange(fromIndex, endIndex);
}
private static void checkArrayElementIndex(int index, int size) {
if (index < 0 || index >= size) {
throw new ArrayIndexOutOfBoundsException();
}
}
private static void checkArrayIndexOutOfBounds(boolean expression, int index) {
if (!expression) {
throw new ArrayIndexOutOfBoundsException(String.valueOf(index));
}
}
}
