IntegerArrayList.java

Go to the documentation of this file.

/*
 * Copyright (c) 2010, 2014, Oracle and/or its affiliates.
 * All rights reserved. Use is subject to license terms.
 *
 * This file is available and licensed under the following license:
 *
 * 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 Oracle Corporation 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 eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj;
 
 
import java.util.AbstractList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;
import java.util.NoSuchElementException;
import java.util.RandomAccess;
import java.util.Vector;
 
 
// TODO: Auto-generated Javadoc
public class IntegerArrayList extends AbstractList<Integer>
        implements List<Integer>, RandomAccess, Cloneable, java.io.Serializable {
 
    private transient int[] elementData;
 
    private int size;
 
    public IntegerArrayList(int initialCapacity) {
        super();
        if (initialCapacity < 0) {
            throw new IllegalArgumentException(
                    "Illegal Capacity: " +
                            initialCapacity);
        }
        this.elementData = new int[initialCapacity];
    }
 
    public IntegerArrayList() {
        this(10);
    }
 
    public IntegerArrayList(Collection<? extends Integer> c) {
        elementData = new int[c.size()];
        int i = 0;
        for (Integer d : c) {
            elementData[i] = d;
            i++;
        }
        size = elementData.length;
    }
 
    public void trimToSize() {
        modCount++;
        int oldCapacity = elementData.length;
        if (size < oldCapacity) {
            elementData = Arrays.copyOf(elementData, size);
        }
    }
 
    public void ensureCapacity(int minCapacity) {
        if (minCapacity > 0) {
            ensureCapacityInternal(minCapacity);
        }
    }
 
    private void ensureCapacityInternal(int minCapacity) {
        modCount++;
        // overflow-conscious code
        if (minCapacity - elementData.length > 0) {
            grow(minCapacity);
        }
    }
 
    private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
 
    private void grow(int minCapacity) {
        // overflow-conscious code
        int oldCapacity = elementData.length;
        int newCapacity = oldCapacity + (oldCapacity >> 1);
        if (newCapacity - minCapacity < 0)
            newCapacity = minCapacity;
        if (newCapacity - MAX_ARRAY_SIZE > 0)
            newCapacity = hugeCapacity(minCapacity);
        // minCapacity is usually close to size, so this is a win:
        elementData = Arrays.copyOf(elementData, newCapacity);
    }
 
    private static int hugeCapacity(int minCapacity) {
        if (minCapacity < 0) // overflow
            throw new OutOfMemoryError();
        return (minCapacity > MAX_ARRAY_SIZE) ?
                Integer.MAX_VALUE :
                MAX_ARRAY_SIZE;
    }
 
    @Override public int size() {
        return size;
    }
 
    @Override public boolean isEmpty() {
        return size == 0;
    }
 
    @Override public boolean contains(Object o) {
        return indexOf(o) >= 0;
    }
 
    @Override public int indexOf(Object o) {
        if (o instanceof Integer) {
            for (int i = 0; i < size; i++) {
                if (o.equals(elementData[i])) {
                    return i;
                }
            }
        }
        return -1;
    }
 
    @Override public int lastIndexOf(Object o) {
        if (o instanceof Integer) {
            for (int i = size - 1; i >= 0; i--)
                if (o.equals(elementData[i]))
                    return i;
        }
        return -1;
    }
 
    @Override public Object clone() {
        try {
            @SuppressWarnings("unchecked")
            IntegerArrayList v = (IntegerArrayList) super.clone();
            v.elementData = Arrays.copyOf(elementData, size);
            v.modCount = 0;
            return v;
        } catch (CloneNotSupportedException e) {
            // this shouldn't happen, since we are Cloneable
            throw new InternalError();
        }
    }
 
    @Override public Object[] toArray() {
        Integer[] array = new Integer[size];
        for (int i = 0; i < size; i++) {
            array[i] = elementData[i];
        }
        return array;
    }
 
    @SuppressWarnings("unchecked")
    @Override public <T> T[] toArray(T[] a) {
        if (a.length < size) {
            // Make a new array of a's runtime type, but my contents:
            return (T[]) Arrays.copyOf(toArray(), size, a.getClass());
        }
        System.arraycopy(elementData, 0, a, 0, size);
        if (a.length > size)
            a[size] = null;
        return a;
    }
 
    public int[] toIntArray() {
        int[] res = new int[size];
        System.arraycopy(elementData, 0, res, 0, size);
        return res;
    }
 
    // Positional Access Operations
 
    @SuppressWarnings("unchecked") Integer elementData(int index) {
        return (Integer) elementData[index];
    }
 
    @Override public Integer get(int index) {
        rangeCheck(index);
 
        return elementData(index);
    }
 
    @Override public Integer set(int index, Integer element) {
        rangeCheck(index);
 
        Integer oldValue = elementData(index);
        elementData[index] = element;
        return oldValue;
    }
 
    @Override public boolean add(Integer e) {
        ensureCapacityInternal(size + 1);  // Increments modCount!!
        elementData[size++] = e;
        return true;
    }
 
    @Override public void add(int index, Integer element) {
        rangeCheckForAdd(index);
 
        ensureCapacityInternal(size + 1);  // Increments modCount!!
        System.arraycopy(
                elementData, index, elementData, index + 1,
                size - index);
        elementData[index] = element;
        size++;
    }
 
    @Override public Integer remove(int index) {
        rangeCheck(index);
 
        modCount++;
        Integer oldValue = elementData(index);
 
        int numMoved = size - index - 1;
        if (numMoved > 0)
            System.arraycopy(
                    elementData, index + 1, elementData, index,
                    numMoved);
        elementData[--size] = 0; // Forget the item completely
 
        return oldValue;
    }
 
    @Override public boolean remove(Object o) {
        if (o instanceof Integer) {
            for (int index = 0; index < size; index++)
                if (o.equals(elementData[index])) {
                    fastRemove(index);
                    return true;
                }
        }
        return false;
    }
 
    /*
     * Private remove method that skips bounds checking and does not
     * return the value removed.
     */
    private void fastRemove(int index) {
        modCount++;
        int numMoved = size - index - 1;
        if (numMoved > 0)
            System.arraycopy(
                    elementData, index + 1, elementData, index,
                    numMoved);
        elementData[--size] = 0; // Forget the item completely
    }
 
    @Override public void clear() {
        modCount++;
 
        // Forget the items completely
        for (int i = 0; i < size; i++)
            elementData[i] = 0;
 
        size = 0;
    }
 
    @Override public boolean addAll(Collection<? extends Integer> c) {
        Object[] a = c.toArray();
        int numNew = a.length;
        ensureCapacityInternal(size + numNew);  // Increments modCount
        System.arraycopy(a, 0, elementData, size, numNew);
        size += numNew;
        return numNew != 0;
    }
 
    @Override public boolean addAll(int index, Collection<? extends Integer> c) {
        rangeCheckForAdd(index);
 
        Object[] a = c.toArray();
        int numNew = a.length;
        ensureCapacityInternal(size + numNew);  // Increments modCount
 
        int numMoved = size - index;
        if (numMoved > 0)
            System.arraycopy(
                    elementData, index, elementData, index + numNew,
                    numMoved);
 
        System.arraycopy(a, 0, elementData, index, numNew);
        size += numNew;
        return numNew != 0;
    }
 
    @Override protected void removeRange(int fromIndex, int toIndex) {
        modCount++;
        int numMoved = size - toIndex;
        System.arraycopy(
                elementData, toIndex, elementData, fromIndex,
                numMoved);
 
        // Forget the item completely
        int newSize = size - (toIndex - fromIndex);
        while (size != newSize)
            elementData[--size] = 0;
    }
 
    private void rangeCheck(int index) {
        if (index >= size)
            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
    }
 
    private void rangeCheckForAdd(int index) {
        if (index > size || index < 0)
            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
    }
 
    private String outOfBoundsMsg(int index) {
        return "Index: " + index + ", Size: " + size;
    }
 
    @Override public boolean removeAll(Collection<?> c) {
        return batchRemove(c, false);
    }
 
    @Override public boolean retainAll(Collection<?> c) {
        return batchRemove(c, true);
    }
 
    private boolean batchRemove(Collection<?> c, boolean complement) {
        final int[] elementData = this.elementData;
        int r = 0, w = 0;
        boolean modified = false;
        try {
            for (; r < size; r++)
                if (c.contains(elementData[r]) == complement)
                    elementData[w++] = elementData[r];
        } finally {
            // Preserve behavioral compatibility with AbstractCollection,
            // even if c.contains() throws.
            if (r != size) {
                System.arraycopy(
                        elementData, r,
                        elementData, w,
                        size - r);
                w += size - r;
            }
            if (w != size) {
                for (int i = w; i < size; i++)
                    elementData[i] = 0;
                modCount += size - w;
                size = w;
                modified = true;
            }
        }
        return modified;
    }
 
    private void writeObject(java.io.ObjectOutputStream s)
            throws java.io.IOException {
        // Write out element count, and any hidden stuff
        int expectedModCount = modCount;
        s.defaultWriteObject();
 
        // Write out array length
        s.writeInt(elementData.length);
 
        // Write out all elements in the proper order.
        for (int i = 0; i < size; i++)
            s.writeObject(elementData[i]);
 
        if (modCount != expectedModCount) {
            throw new ConcurrentModificationException();
        }
 
    }
 
    private void readObject(java.io.ObjectInputStream s)
            throws java.io.IOException, ClassNotFoundException {
        // Read in size, and any hidden stuff
        s.defaultReadObject();
 
        // Read in array length and allocate array
        int arrayLength = s.readInt();
        int[] a = elementData = new int[arrayLength];
 
        // Read in all elements in the proper order.
        for (int i = 0; i < size; i++)
            a[i] = (Integer) s.readObject();
    }
 
    @Override public ListIterator<Integer> listIterator(int index) {
        if (index < 0 || index > size)
            throw new IndexOutOfBoundsException("Index: " + index);
        return new ListItr(index);
    }
 
    @Override public ListIterator<Integer> listIterator() {
        return new ListItr(0);
    }
 
    @Override public Iterator<Integer> iterator() {
        return new Itr();
    }
 
    private class Itr implements Iterator<Integer> {
        
        int cursor;       // index of next element to return
        
        int lastRet = -1; // index of last element returned; -1 if no such
        
        int expectedModCount = modCount;
 
        /* (non-Javadoc)
         * @see java.util.Iterator#hasNext()
         */
        @Override public boolean hasNext() {
            return cursor != size;
        }
 
        /* (non-Javadoc)
         * @see java.util.Iterator#next()
         */
        @SuppressWarnings("unchecked")
        @Override public Integer next() {
            checkForComodification();
            int i = cursor;
            if (i >= size)
                throw new NoSuchElementException();
            int[] elementData = IntegerArrayList.this.elementData;
            if (i >= elementData.length)
                throw new ConcurrentModificationException();
            cursor = i + 1;
            return (Integer) elementData[lastRet = i];
        }
 
        /* (non-Javadoc)
         * @see java.util.Iterator#remove()
         */
        @Override public void remove() {
            if (lastRet < 0)
                throw new IllegalStateException();
            checkForComodification();
 
            try {
                IntegerArrayList.this.remove(lastRet);
                cursor = lastRet;
                lastRet = -1;
                expectedModCount = modCount;
            } catch (IndexOutOfBoundsException ex) {
                throw new ConcurrentModificationException();
            }
        }
 
        final void checkForComodification() {
            if (modCount != expectedModCount)
                throw new ConcurrentModificationException();
        }
    }
 
    private class ListItr extends Itr implements ListIterator<Integer> {
        
        ListItr(int index) {
            super();
            cursor = index;
        }
 
        /* (non-Javadoc)
         * @see java.util.ListIterator#hasPrevious()
         */
        @Override public boolean hasPrevious() {
            return cursor != 0;
        }
 
        /* (non-Javadoc)
         * @see java.util.ListIterator#nextIndex()
         */
        @Override public int nextIndex() {
            return cursor;
        }
 
        /* (non-Javadoc)
         * @see java.util.ListIterator#previousIndex()
         */
        @Override public int previousIndex() {
            return cursor - 1;
        }
 
        /* (non-Javadoc)
         * @see java.util.ListIterator#previous()
         */
        @SuppressWarnings("unchecked")
        @Override public Integer previous() {
            checkForComodification();
            int i = cursor - 1;
            if (i < 0)
                throw new NoSuchElementException();
            int[] elementData = IntegerArrayList.this.elementData;
            if (i >= elementData.length)
                throw new ConcurrentModificationException();
            cursor = i;
            return (Integer) elementData[lastRet = i];
        }
 
        /* (non-Javadoc)
         * @see java.util.ListIterator#set(java.lang.Object)
         */
        @Override public void set(Integer e) {
            if (lastRet < 0)
                throw new IllegalStateException();
            checkForComodification();
 
            try {
                IntegerArrayList.this.set(lastRet, e);
            } catch (IndexOutOfBoundsException ex) {
                throw new ConcurrentModificationException();
            }
        }
 
        /* (non-Javadoc)
         * @see java.util.ListIterator#add(java.lang.Object)
         */
        @Override public void add(Integer e) {
            checkForComodification();
 
            try {
                int i = cursor;
                IntegerArrayList.this.add(i, e);
                cursor = i + 1;
                lastRet = -1;
                expectedModCount = modCount;
            } catch (IndexOutOfBoundsException ex) {
                throw new ConcurrentModificationException();
            }
        }
    }
 
    @Override public List<Integer> subList(int fromIndex, int toIndex) {
        subListRangeCheck(fromIndex, toIndex, size);
        return new IntegerArrayList.SubList(this, 0, fromIndex, toIndex);
    }
 
    static void subListRangeCheck(int fromIndex, int toIndex, int size) {
        if (fromIndex < 0)
            throw new IndexOutOfBoundsException("fromIndex = " + fromIndex);
        if (toIndex > size)
            throw new IndexOutOfBoundsException("toIndex = " + toIndex);
        if (fromIndex > toIndex)
            throw new IllegalArgumentException(
                    "fromIndex(" + fromIndex +
                            ") > toIndex(" + toIndex + ")");
    }
 
    private class SubList extends IntegerArrayList implements RandomAccess {
        
        private final IntegerArrayList parent;
        
        private final int parentOffset;
        
        private final int offset;
        
        int size;
 
        SubList(
                IntegerArrayList parent,
                int offset, int fromIndex, int toIndex) {
            this.parent = parent;
            this.parentOffset = fromIndex;
            this.offset = offset + fromIndex;
            this.size = toIndex - fromIndex;
            this.modCount = IntegerArrayList.this.modCount;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#toIntArray()
         */
        @Override
        public int[] toIntArray() {
            int[] res = new int[size];
            System.arraycopy(elementData, offset, res, 0, size);
            return res;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#set(int, java.lang.Integer)
         */
        @Override public Integer set(int index, Integer e) {
            rangeCheck(index);
            checkForComodification();
            Integer oldValue = IntegerArrayList.this.elementData(offset + index);
            IntegerArrayList.this.elementData[offset + index] = e;
            return oldValue;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#get(int)
         */
        @Override public Integer get(int index) {
            rangeCheck(index);
            checkForComodification();
            return IntegerArrayList.this.elementData(offset + index);
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#size()
         */
        @Override public int size() {
            checkForComodification();
            return this.size;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#add(int, java.lang.Integer)
         */
        @Override public void add(int index, Integer e) {
            rangeCheckForAdd(index);
            checkForComodification();
            parent.add(parentOffset + index, e);
            this.modCount = parent.modCount;
            this.size++;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#remove(int)
         */
        @Override public Integer remove(int index) {
            rangeCheck(index);
            checkForComodification();
            Integer result = parent.remove(parentOffset + index);
            this.modCount = parent.modCount;
            this.size--;
            return result;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#removeRange(int, int)
         */
        @Override protected void removeRange(int fromIndex, int toIndex) {
            checkForComodification();
            parent.removeRange(
                    parentOffset + fromIndex,
                    parentOffset + toIndex);
            this.modCount = parent.modCount;
            this.size -= toIndex - fromIndex;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#addAll(java.util.Collection)
         */
        @Override public boolean addAll(Collection<? extends Integer> c) {
            return addAll(this.size, c);
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#addAll(int, java.util.Collection)
         */
        @Override public boolean addAll(int index, Collection<? extends Integer> c) {
            rangeCheckForAdd(index);
            int cSize = c.size();
            if (cSize == 0)
                return false;
 
            checkForComodification();
            parent.addAll(parentOffset + index, c);
            this.modCount = parent.modCount;
            this.size += cSize;
            return true;
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#iterator()
         */
        @Override public Iterator<Integer> iterator() {
            return listIterator();
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#listIterator(int)
         */
        @Override public ListIterator<Integer> listIterator(final int index) {
            checkForComodification();
            rangeCheckForAdd(index);
            final int offset = this.offset;
 
            return new ListIterator<Integer>() {
                int cursor = index;
                int lastRet = -1;
                int expectedModCount = IntegerArrayList.this.modCount;
 
                @Override public boolean hasNext() {
                    return cursor != IntegerArrayList.SubList.this.size;
                }
 
                @SuppressWarnings("unchecked")
                @Override public Integer next() {
                    checkForComodification();
                    int i = cursor;
                    if (i >= IntegerArrayList.SubList.this.size)
                        throw new NoSuchElementException();
                    int[] elementData = IntegerArrayList.this.elementData;
                    if (offset + i >= elementData.length)
                        throw new ConcurrentModificationException();
                    cursor = i + 1;
                    return (Integer) elementData[offset + (lastRet = i)];
                }
 
                @Override public boolean hasPrevious() {
                    return cursor != 0;
                }
 
                @SuppressWarnings("unchecked")
                @Override public Integer previous() {
                    checkForComodification();
                    int i = cursor - 1;
                    if (i < 0)
                        throw new NoSuchElementException();
                    int[] elementData = IntegerArrayList.this.elementData;
                    if (offset + i >= elementData.length)
                        throw new ConcurrentModificationException();
                    cursor = i;
                    return (Integer) elementData[offset + (lastRet = i)];
                }
 
                @Override public int nextIndex() {
                    return cursor;
                }
 
                @Override public int previousIndex() {
                    return cursor - 1;
                }
 
                @Override public void remove() {
                    if (lastRet < 0)
                        throw new IllegalStateException();
                    checkForComodification();
 
                    try {
                        IntegerArrayList.SubList.this.remove(lastRet);
                        cursor = lastRet;
                        lastRet = -1;
                        expectedModCount = IntegerArrayList.this.modCount;
                    } catch (IndexOutOfBoundsException ex) {
                        throw new ConcurrentModificationException();
                    }
                }
 
                @Override public void set(Integer e) {
                    if (lastRet < 0)
                        throw new IllegalStateException();
                    checkForComodification();
 
                    try {
                        IntegerArrayList.this.set(offset + lastRet, e);
                    } catch (IndexOutOfBoundsException ex) {
                        throw new ConcurrentModificationException();
                    }
                }
 
                @Override public void add(Integer e) {
                    checkForComodification();
 
                    try {
                        int i = cursor;
                        IntegerArrayList.SubList.this.add(i, e);
                        cursor = i + 1;
                        lastRet = -1;
                        expectedModCount = IntegerArrayList.this.modCount;
                    } catch (IndexOutOfBoundsException ex) {
                        throw new ConcurrentModificationException();
                    }
                }
 
                final void checkForComodification() {
                    if (expectedModCount != IntegerArrayList.this.modCount)
                        throw new ConcurrentModificationException();
                }
            };
        }
 
        /* (non-Javadoc)
         * @see eu.mihosoft.vrl.v3d.ext.openjfx.importers.obj.IntegerArrayList#subList(int, int)
         */
        @Override public List<Integer> subList(int fromIndex, int toIndex) {
            subListRangeCheck(fromIndex, toIndex, size);
            return new IntegerArrayList.SubList(this, offset, fromIndex, toIndex);
        }
 
        private void rangeCheck(int index) {
            if (index < 0 || index >= this.size)
                throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
        }
 
        private void rangeCheckForAdd(int index) {
            if (index < 0 || index > this.size)
                throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
        }
 
        private String outOfBoundsMsg(int index) {
            return "Index: " + index + ", Size: " + this.size;
        }
 
        private void checkForComodification() {
            if (IntegerArrayList.this.modCount != this.modCount)
                throw new ConcurrentModificationException();
        }
    }
}