Application: gvSIG desktop

package org.gvsig.fmap.dal.feature.impl.indexes.memorybasictypes;

import java.util.AbstractList;

import java.util.Arrays;

import java.util.BitSet;

import java.util.Collection;

import java.util.Collections;

import java.util.Comparator;

import java.util.ConcurrentModificationException;

import java.util.Iterator;

import java.util.List;

import java.util.ListIterator;

import java.util.NoSuchElementException;

import java.util.Objects;

import java.util.RandomAccess;

import java.util.Spliterator;

import java.util.function.Consumer;

import java.util.function.Predicate;

import java.util.function.UnaryOperator;

/**

 *

 * @author jjdelcerro

 */

public class ArrayListOfLong extends AbstractList<Long>

        implements ListOfLong, RandomAccess, Cloneable {

    private static final long serialVersionUID = 8683452581122892189L;

    /**

     * Default initial capacity.

     */

    private static final int DEFAULT_CAPACITY = 10;

    /**

     * Shared empty array instance used for empty instances.

     */

    private static final long[] EMPTY_ELEMENTDATA = {};

    /**

     * Shared empty array instance used for default sized empty instances. We

     * distinguish this from EMPTY_ELEMENTDATA to know how much to inflate when

     * first element is added.

     */

    private static final long[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};

    /**

     * The array buffer into which the elements of the ArrayList are stored.

     * The capacity of the ArrayList is the length of this array buffer. Any

     * empty ArrayList with elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA

     * will be expanded to DEFAULT_CAPACITY when the first element is added.

     */

    transient long[] elementData; // non-private to simplify nested class access

    /**

     * The size of the ArrayList (the number of elements it contains).

     *

     * @serial

     */

    private int size;

    /**

     * Constructs an empty list with the specified initial capacity.

     *

     * @param  initialCapacity  the initial capacity of the list

     * @throws IllegalArgumentException if the specified initial capacity

     *         is negative

     */

    public ArrayListOfLong(int initialCapacity) {

        if (initialCapacity > 0) {

            this.elementData = new long[initialCapacity];

        } else if (initialCapacity == 0) {

            this.elementData = EMPTY_ELEMENTDATA;

        } else {

            throw new IllegalArgumentException("Illegal Capacity: "+

                                               initialCapacity);

        }

    }

    /**

     * Constructs an empty list with an initial capacity of ten.

     */

    public ArrayListOfLong() {

        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;

    }

    /**

     * Constructs a list containing the elements of the specified

     * collection, in the order they are returned by the collection's

     * iterator.

     *

     * @param c the collection whose elements are to be placed into this list

     * @throws NullPointerException if the specified collection is null

     */

    public ArrayListOfLong(Collection<? extends Long> c) {

        if ((size = c.size()) != 0) {

            this.grow(c.size());

            int i=0;

            for (Long e : c) {

                this.elementData[i++] = e;

            }

        } else {

            // replace with empty array.

            this.elementData = EMPTY_ELEMENTDATA;

        }

    }

    /**

     * Trims the capacity of this <tt>ArrayList</tt> instance to be the

     * list's current size.  An application can use this operation to minimize

     * the storage of an <tt>ArrayList</tt> instance.

     */

    public void trimToSize() {

        modCount++;

        if (size < elementData.length) {

            elementData = (size == 0)

              ? EMPTY_ELEMENTDATA

              : Arrays.copyOf(elementData, size);

        }

    }

    /**

     * Increases the capacity of this <tt>ArrayList</tt> instance, if

     * necessary, to ensure that it can hold at least the number of elements

     * specified by the minimum capacity argument.

     *

     * @param   minCapacity   the desired minimum capacity

     */

    public void ensureCapacity(int minCapacity) {

        int minExpand = (elementData != DEFAULTCAPACITY_EMPTY_ELEMENTDATA)

            // any size if not default element table

            ? 0

            // larger than default for default empty table. It's already

            // supposed to be at default size.

            : DEFAULT_CAPACITY;

        if (minCapacity > minExpand) {

            ensureExplicitCapacity(minCapacity);

        }

    }

    private static int calculateCapacity(long[] elementData, int minCapacity) {

        if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {

            return Math.max(DEFAULT_CAPACITY, minCapacity);

        }

        return minCapacity;

    }

    private void ensureCapacityInternal(int minCapacity) {

        ensureExplicitCapacity(calculateCapacity(elementData, minCapacity));

    }

    private void ensureExplicitCapacity(int minCapacity) {

        modCount++;

        // overflow-conscious code

        if (minCapacity - elementData.length > 0)

            grow(minCapacity);

    }

    /**

     * The maximum size of array to allocate.

     * Some VMs reserve some header words in an array.

     * Attempts to allocate larger arrays may result in

     * OutOfMemoryError: Requested array size exceeds VM limit

     */

    private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;

    /**

     * Increases the capacity to ensure that it can hold at least the

     * number of elements specified by the minimum capacity argument.

     *

     * @param minCapacity the desired minimum capacity

     */

    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;

    }

    /**

     * Returns the number of elements in this list.

     *

     * @return the number of elements in this list

     */

    public int size() {

        return size;

    }

    /**

     * Returns <tt>true</tt> if this list contains no elements.

     *

     * @return <tt>true</tt> if this list contains no elements

     */

    public boolean isEmpty() {

        return size == 0;

    }

    /**

     * Returns <tt>true</tt> if this list contains the specified element.

     * More formally, returns <tt>true</tt> if and only if this list contains

     * at least one element <tt>e</tt> such that

     * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>.

     *

     * @param o element whose presence in this list is to be tested

     * @return <tt>true</tt> if this list contains the specified element

     */

    public boolean contains(Object o) {

        return indexOf(o) >= 0;

    }

    /**

     * Returns the index of the first occurrence of the specified element

     * in this list, or -1 if this list does not contain the element.

     * More formally, returns the lowest index <tt>i</tt> such that

     * <tt>(o==null&nbsp;?&nbsp;get(i)==null&nbsp;:&nbsp;o.equals(get(i)))</tt>,

     * or -1 if there is no such index.

     */

    public int indexOf(Object o) {

        if (o == null) {

            return -1;

        } else {

            for (int i = 0; i < size; i++)

                if (o.equals(elementData[i]))

                    return i;

        }

        return -1;

    }

    /**

     * Returns the index of the last occurrence of the specified element

     * in this list, or -1 if this list does not contain the element.

     * More formally, returns the highest index <tt>i</tt> such that

     * <tt>(o==null&nbsp;?&nbsp;get(i)==null&nbsp;:&nbsp;o.equals(get(i)))</tt>,

     * or -1 if there is no such index.

     */

    public int lastIndexOf(Object o) {

        if (o == null) {

            return -1;

        } else {

            for (int i = size-1; i >= 0; i--)

                if (o.equals(elementData[i]))

                    return i;

        }

        return -1;

    }

    /**

     * Returns a shallow copy of this <tt>ArrayList</tt> instance.  (The

     * elements themselves are not copied.)

     *

     * @return a clone of this <tt>ArrayList</tt> instance

     */

    public Object clone() {

        try {

            ArrayListOfLong v = (ArrayListOfLong) 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(e);

        }

    }

    @Override

    public Long[] toArray() {

        return toArray((Long[])null);

    }

    public Long[] toArray(Long[] a) {

        if (a==null || a.length < size) {

            a = new Long[size];

        }

        for (int i = 0; i < size; i++) {

            a[i] = this.elementData[i];            

        }

        return a;

    }

    // Positional Access Operations

    @SuppressWarnings("unchecked")

    long elementData(int index) {

        return elementData[index];

    }

    public Long get(int index) {

        return this.getLong(index);

    }

    public long getLong(int index) {

        rangeCheck(index);

        return elementData(index);

    }

    /**

     * Replaces the element at the specified position in this list with

     * the specified element.

     *

     * @param index index of the element to replace

     * @param element element to be stored at the specified position

     * @return the element previously at the specified position

     * @throws IndexOutOfBoundsException {@inheritDoc}

     */

    public Long set(int index, Long element) {

        rangeCheck(index);

        Long oldValue = elementData(index);

        elementData[index] = element;

        return oldValue;

    }

    public boolean add(Long e) {

        return this.add((long)e);

    }

    public boolean add(long e) {

        ensureCapacityInternal(size + 1);  // Increments modCount!!

        elementData[size++] = e;

        return true;

    }

    public void add(int index, Long element) {

        this.add(index, (long)element);

    }

    public void add(int index, long element) {

        rangeCheckForAdd(index);

        ensureCapacityInternal(size + 1);  // Increments modCount!!

        System.arraycopy(elementData, index, elementData, index + 1,

                         size - index);

        elementData[index] = element;

        size++;

    }

    public Long remove(int index) {

        rangeCheck(index);

        modCount++;

        Long oldValue = elementData(index);

        int numMoved = size - index - 1;

        if (numMoved > 0)

            System.arraycopy(elementData, index+1, elementData, index,

                             numMoved);

        return oldValue;

    }

    public boolean remove(Object o) {

        if (o == null) {

            return true;

        }

        return this.removeLong((long)o);

    }

    public boolean removeLong(long o) {

        for (int index = 0; index < size; index++)

            if (o == elementData[index]) {

                this.remove(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);

    }

    /**

     * Removes all of the elements from this list.  The list will

     * be empty after this call returns.

     */

    public void clear() {

        modCount++;

        size = 0;

    }

    /**

     * Appends all of the elements in the specified collection to the end of

     * this list, in the order that they are returned by the

     * specified collection's Iterator.  The behavior of this operation is

     * undefined if the specified collection is modified while the operation

     * is in progress.  (This implies that the behavior of this call is

     * undefined if the specified collection is this list, and this

     * list is nonempty.)

     *

     * @param c collection containing elements to be added to this list

     * @return <tt>true</tt> if this list changed as a result of the call

     * @throws NullPointerException if the specified collection is null

     */

    public boolean addAll(Collection<? extends Long> 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;

    }

    /**

     * Inserts all of the elements in the specified collection into this

     * list, starting at the specified position.  Shifts the element

     * currently at that position (if any) and any subsequent elements to

     * the right (increases their indices).  The new elements will appear

     * in the list in the order that they are returned by the

     * specified collection's iterator.

     *

     * @param index index at which to insert the first element from the

     *              specified collection

     * @param c collection containing elements to be added to this list

     * @return <tt>true</tt> if this list changed as a result of the call

     * @throws IndexOutOfBoundsException {@inheritDoc}

     * @throws NullPointerException if the specified collection is null

     */

    public boolean addAll(int index, Collection<? extends Long> 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;

    }

    /**

     * Removes from this list all of the elements whose index is between

     * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.

     * Shifts any succeeding elements to the left (reduces their index).

     * This call shortens the list by {@code (toIndex - fromIndex)} elements.

     * (If {@code toIndex==fromIndex}, this operation has no effect.)

     *

     * @throws IndexOutOfBoundsException if {@code fromIndex} or

     *         {@code toIndex} is out of range

     *         ({@code fromIndex < 0 ||

     *          fromIndex >= size() ||

     *          toIndex > size() ||

     *          toIndex < fromIndex})

     */

    protected void removeRange(int fromIndex, int toIndex) {

        modCount++;

        int numMoved = size - toIndex;

        System.arraycopy(elementData, toIndex, elementData, fromIndex,

                         numMoved);

        int newSize = size - (toIndex-fromIndex);

        size = newSize;

    }

    /**

     * Checks if the given index is in range.  If not, throws an appropriate

     * runtime exception.  This method does *not* check if the index is

     * negative: It is always used immediately prior to an array access,

     * which throws an ArrayIndexOutOfBoundsException if index is negative.

     */

    private void rangeCheck(int index) {

        if (index >= size)

            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));

    }

    /**

     * A version of rangeCheck used by add and addAll.

     */

    private void rangeCheckForAdd(int index) {

        if (index > size || index < 0)

            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));

    }

    /**

     * Constructs an IndexOutOfBoundsException detail message.

     * Of the many possible refactorings of the error handling code,

     * this "outlining" performs best with both server and client VMs.

     */

    private String outOfBoundsMsg(int index) {

        return "Index: "+index+", Size: "+size;

    }

    /**

     * Removes from this list all of its elements that are contained in the

     * specified collection.

     *

     * @param c collection containing elements to be removed from this list

     * @return {@code true} if this list changed as a result of the call

     * @throws ClassCastException if the class of an element of this list

     *         is incompatible with the specified collection

     * (<a href="Collection.html#optional-restrictions">optional</a>)

     * @throws NullPointerException if this list contains a null element and the

     *         specified collection does not permit null elements

     * (<a href="Collection.html#optional-restrictions">optional</a>),

     *         or if the specified collection is null

     * @see Collection#contains(Object)

     */

    public boolean removeAll(Collection<?> c) {

        Objects.requireNonNull(c);

        return batchRemove(c, false);

    }

    /**

     * Retains only the elements in this list that are contained in the

     * specified collection.  In other words, removes from this list all

     * of its elements that are not contained in the specified collection.

     *

     * @param c collection containing elements to be retained in this list

     * @return {@code true} if this list changed as a result of the call

     * @throws ClassCastException if the class of an element of this list

     *         is incompatible with the specified collection

     * (<a href="Collection.html#optional-restrictions">optional</a>)

     * @throws NullPointerException if this list contains a null element and the

     *         specified collection does not permit null elements

     * (<a href="Collection.html#optional-restrictions">optional</a>),

     *         or if the specified collection is null

     * @see Collection#contains(Object)

     */

    public boolean retainAll(Collection<?> c) {

        Objects.requireNonNull(c);

        return batchRemove(c, true);

    }

    private boolean batchRemove(Collection<?> c, boolean complement) {

        final long[] 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) {

                modCount += size - w;

                size = w;

                modified = true;

            }

        }

        return modified;

    }

    /**

     * Returns a list iterator over the elements in this list (in proper

     * sequence), starting at the specified position in the list.

     * The specified index indicates the first element that would be

     * returned by an initial call to {@link ListIterator#next next}.

     * An initial call to {@link ListIterator#previous previous} would

     * return the element with the specified index minus one.

     *

     * <p>The returned list iterator is <a href="#fail-fast"><i>fail-fast</i></a>.

     *

     * @throws IndexOutOfBoundsException {@inheritDoc}

     */

    public ListIterator<Long> listIterator(int index) {

        if (index < 0 || index > size)

            throw new IndexOutOfBoundsException("Index: "+index);

        return new ListItr(index);

    }

    /**

     * Returns a list iterator over the elements in this list (in proper

     * sequence).

     *

     * <p>The returned list iterator is <a href="#fail-fast"><i>fail-fast</i></a>.

     *

     * @see #listIterator(int)

     */

    public ListIterator<Long> listIterator() {

        return new ListItr(0);

    }

    /**

     * Returns an iterator over the elements in this list in proper sequence.

     *

     * <p>The returned iterator is <a href="#fail-fast"><i>fail-fast</i></a>.

     *

     * @return an iterator over the elements in this list in proper sequence

     */

    public Iterator<Long> iterator() {

        return new Itr();

    }

    /**

     * An optimized version of AbstractList.Itr

     */

    private class Itr implements Iterator<Long> {

        int cursor;       // index of next element to return

        int lastRet = -1; // index of last element returned; -1 if no such

        int expectedModCount = modCount;

        Itr() {}

        public boolean hasNext() {

            return cursor != size;

        }

        @SuppressWarnings("unchecked")

        public Long next() {

            checkForComodification();

            int i = cursor;

            if (i >= size)

                throw new NoSuchElementException();

            long[] elementData = ArrayListOfLong.this.elementData;

            if (i >= elementData.length)

                throw new ConcurrentModificationException();

            cursor = i + 1;

            return (Long) elementData[lastRet = i];

        }

        public void remove() {

            if (lastRet < 0)

                throw new IllegalStateException();

            checkForComodification();

            try {

                ArrayListOfLong.this.remove(lastRet);

                cursor = lastRet;

                lastRet = -1;

                expectedModCount = modCount;

            } catch (IndexOutOfBoundsException ex) {

                throw new ConcurrentModificationException();

            }

        }

        @Override

        @SuppressWarnings("unchecked")

        public void forEachRemaining(Consumer<? super Long> consumer) {

            Objects.requireNonNull(consumer);

            final int size = ArrayListOfLong.this.size;

            int i = cursor;

            if (i >= size) {

                return;

            }

            final long[] elementData = ArrayListOfLong.this.elementData;

            if (i >= elementData.length) {

                throw new ConcurrentModificationException();

            }

            while (i != size && modCount == expectedModCount) {

                consumer.accept((Long) elementData[i++]);

            }

            // update once at end of iteration to reduce heap write traffic

            cursor = i;

            lastRet = i - 1;

            checkForComodification();

        }

        final void checkForComodification() {

            if (modCount != expectedModCount)

                throw new ConcurrentModificationException();

        }

    }

    /**

     * An optimized version of AbstractList.ListItr

     */

    private class ListItr extends Itr implements ListIterator<Long> {

        ListItr(int index) {

            super();

            cursor = index;

        }

        public boolean hasPrevious() {

            return cursor != 0;

        }

        public int nextIndex() {

            return cursor;

        }

        public int previousIndex() {

            return cursor - 1;

        }

        @SuppressWarnings("unchecked")

        public Long previous() {

            checkForComodification();

            int i = cursor - 1;

            if (i < 0)

                throw new NoSuchElementException();

            long[] elementData = ArrayListOfLong.this.elementData;

            if (i >= elementData.length)

                throw new ConcurrentModificationException();

            cursor = i;

            return (Long) elementData[lastRet = i];

        }

        public void set(Long e) {

            if (lastRet < 0)

                throw new IllegalStateException();

            checkForComodification();

            try {

                ArrayListOfLong.this.set(lastRet, e);

            } catch (IndexOutOfBoundsException ex) {

                throw new ConcurrentModificationException();

            }

        }

        public void add(Long e) {

            checkForComodification();

            try {

                int i = cursor;

                ArrayListOfLong.this.add(i, e);

                cursor = i + 1;

                lastRet = -1;

                expectedModCount = modCount;

            } catch (IndexOutOfBoundsException ex) {

                throw new ConcurrentModificationException();

            }

        }

    }

    /**

     * Returns a view of the portion of this list between the specified

     * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.  (If

     * {@code fromIndex} and {@code toIndex} are equal, the returned list is

     * empty.)  The returned list is backed by this list, so non-structural

     * changes in the returned list are reflected in this list, and vice-versa.

     * The returned list supports all of the optional list operations.

     *

     * <p>This method eliminates the need for explicit range operations (of

     * the sort that commonly exist for arrays).  Any operation that expects

     * a list can be used as a range operation by passing a subList view

     * instead of a whole list.  For example, the following idiom

     * removes a range of elements from a list:

     * <pre>

     *      list.subList(from, to).clear();

     * </pre>

     * Similar idioms may be constructed for {@link #indexOf(Object)} and

     * {@link #lastIndexOf(Object)}, and all of the algorithms in the

     * {@link Collections} class can be applied to a subList.

     *

     * <p>The semantics of the list returned by this method become undefined if

     * the backing list (i.e., this list) is <i>structurally modified</i> in

     * any way other than via the returned list.  (Structural modifications are

     * those that change the size of this list, or otherwise perturb it in such

     * a fashion that iterations in progress may yield incorrect results.)

     *

     * @throws IndexOutOfBoundsException {@inheritDoc}

     * @throws IllegalArgumentException {@inheritDoc}

     */

    public List<Long> subList(int fromIndex, int toIndex) {

        subListRangeCheck(fromIndex, toIndex, size);

        return new 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 ArrayListOfLong implements RandomAccess {

        private final ArrayListOfLong parent;

        private final int parentOffset;

        private final int offset;

        int size;

        SubList(ArrayListOfLong parent,

                int offset, int fromIndex, int toIndex) {

            this.parent = parent;

            this.parentOffset = fromIndex;

            this.offset = offset + fromIndex;

            this.size = toIndex - fromIndex;

            this.modCount = ArrayListOfLong.this.modCount;

        }

        public Long set(int index, Long e) {

            rangeCheck(index);

            checkForComodification();

            Long oldValue = ArrayListOfLong.this.elementData(offset + index);

            ArrayListOfLong.this.elementData[offset + index] = e;

            return oldValue;

        }

        public Long get(int index) {

            rangeCheck(index);

            checkForComodification();

            return ArrayListOfLong.this.elementData(offset + index);

        }

        public int size() {

            checkForComodification();

            return this.size;

        }

        public void add(int index, Long e) {

            rangeCheckForAdd(index);

            checkForComodification();

            parent.add(parentOffset + index, e);

            this.modCount = parent.modCount;

            this.size++;

        }

        public Long remove(int index) {

            rangeCheck(index);

            checkForComodification();

            Long result = parent.remove(parentOffset + index);

            this.modCount = parent.modCount;

            this.size--;

            return result;

        }

        protected void removeRange(int fromIndex, int toIndex) {

            checkForComodification();

            parent.removeRange(parentOffset + fromIndex,

                               parentOffset + toIndex);

            this.modCount = parent.modCount;

            this.size -= toIndex - fromIndex;

        }

        public boolean addAll(Collection<? extends Long> c) {

            return addAll(this.size, c);

        }

        public boolean addAll(int index, Collection<? extends Long> 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;

        }

        public Iterator<Long> iterator() {

            return listIterator();

        }

        public ListIterator<Long> listIterator(final int index) {

            checkForComodification();

            rangeCheckForAdd(index);

            final int offset = this.offset;

            return new ListIterator<Long>() {

                int cursor = index;

                int lastRet = -1;

                int expectedModCount = ArrayListOfLong.this.modCount;

                public boolean hasNext() {

                    return cursor != SubList.this.size;

                }

                @SuppressWarnings("unchecked")

                public Long next() {

                    checkForComodification();

                    int i = cursor;

                    if (i >= SubList.this.size)

                        throw new NoSuchElementException();

                    long[] elementData = ArrayListOfLong.this.elementData;

                    if (offset + i >= elementData.length)

                        throw new ConcurrentModificationException();

                    cursor = i + 1;

                    return (Long) elementData[offset + (lastRet = i)];

                }

                public boolean hasPrevious() {

                    return cursor != 0;

                }

                @SuppressWarnings("unchecked")

                public Long previous() {

                    checkForComodification();

                    int i = cursor - 1;

                    if (i < 0)

                        throw new NoSuchElementException();

                    long[] elementData = ArrayListOfLong.this.elementData;

                    if (offset + i >= elementData.length)

                        throw new ConcurrentModificationException();

                    cursor = i;

                    return (Long) elementData[offset + (lastRet = i)];

                }

                @SuppressWarnings("unchecked")

                public void forEachRemaining(Consumer<? super Long> consumer) {

                    Objects.requireNonNull(consumer);

                    final int size = SubList.this.size;

                    int i = cursor;

                    if (i >= size) {

                        return;

                    }

                    final long[] elementData = ArrayListOfLong.this.elementData;

                    if (offset + i >= elementData.length) {

                        throw new ConcurrentModificationException();

                    }

                    while (i != size && modCount == expectedModCount) {

                        consumer.accept((Long) elementData[offset + (i++)]);

                    }

                    // update once at end of iteration to reduce heap write traffic

                    lastRet = cursor = i;

                    checkForComodification();

                }

                public int nextIndex() {

                    return cursor;

                }

                public int previousIndex() {

                    return cursor - 1;

                }

                public void remove() {

                    if (lastRet < 0)

                        throw new IllegalStateException();

                    checkForComodification();

                    try {

                        SubList.this.remove(lastRet);

                        cursor = lastRet;

                        lastRet = -1;

                        expectedModCount = ArrayListOfLong.this.modCount;

                    } catch (IndexOutOfBoundsException ex) {

                        throw new ConcurrentModificationException();

                    }

                }

                public void set(Long e) {

                    if (lastRet < 0)

                        throw new IllegalStateException();

                    checkForComodification();

                    try {

                        ArrayListOfLong.this.set(offset + lastRet, e);

                    } catch (IndexOutOfBoundsException ex) {

                        throw new ConcurrentModificationException();

                    }

                }

                public void add(Long e) {

                    checkForComodification();

                    try {

                        int i = cursor;

                        SubList.this.add(i, e);

                        cursor = i + 1;

                        lastRet = -1;

                        expectedModCount = ArrayListOfLong.this.modCount;

                    } catch (IndexOutOfBoundsException ex) {

                        throw new ConcurrentModificationException();

                    }

                }

                final void checkForComodification() {

                    if (expectedModCount != ArrayListOfLong.this.modCount)

                        throw new ConcurrentModificationException();

                }

            };

        }

        public List<Long> subList(int fromIndex, int toIndex) {

            subListRangeCheck(fromIndex, toIndex, size);

            return new 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 (ArrayListOfLong.this.modCount != this.modCount)

                throw new ConcurrentModificationException();

        }

        public Spliterator<Long> spliterator() {

            checkForComodification();

            return new ArrayListSpliterator(ArrayListOfLong.this, offset,

                                               offset + this.size, this.modCount);

        }

    }

    @Override

    public void forEach(Consumer<? super Long> action) {

        Objects.requireNonNull(action);

        final int expectedModCount = modCount;

        @SuppressWarnings("unchecked")

        final long[] elementData = this.elementData;

        final int size = this.size;

        for (int i=0; modCount == expectedModCount && i < size; i++) {

            action.accept(elementData[i]);

        }

        if (modCount != expectedModCount) {

            throw new ConcurrentModificationException();

        }

    }

    /**

     * Creates a <em><a href="Spliterator.html#binding">late-binding</a></em>

     * and <em>fail-fast</em> {@link Spliterator} over the elements in this

     * list.

     *

     * <p>The {@code Spliterator} reports {@link Spliterator#SIZED},

     * {@link Spliterator#SUBSIZED}, and {@link Spliterator#ORDERED}.

     * Overriding implementations should document the reporting of additional

     * characteristic values.

     *

     * @return a {@code Spliterator} over the elements in this list

     * @since 1.8

     */

    @Override

    public Spliterator<Long> spliterator() {

        return new ArrayListSpliterator(this, 0, -1, 0);

    }

    static final class ArrayListSpliterator implements Spliterator<Long> {

        private final ArrayListOfLong list;

        private int index; // current index, modified on advance/split

        private int fence; // -1 until used; then one past last index

        private int expectedModCount; // initialized when fence set

        /** Create new spliterator covering the given  range */

        ArrayListSpliterator(ArrayListOfLong list, int origin, int fence,

                             int expectedModCount) {

            this.list = list; // OK if null unless traversed

            this.index = origin;

            this.fence = fence;

            this.expectedModCount = expectedModCount;

        }

        private int getFence() { // initialize fence to size on first use

            int hi; // (a specialized variant appears in method forEach)

            ArrayListOfLong lst;

            if ((hi = fence) < 0) {

                if ((lst = list) == null)

                    hi = fence = 0;

                else {

                    expectedModCount = lst.modCount;

                    hi = fence = lst.size;

                }

            }

            return hi;

        }

        public ArrayListSpliterator trySplit() {

            int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;

            return (lo >= mid) ? null : // divide range in half unless too small

                new ArrayListSpliterator(list, lo, index = mid,

                                            expectedModCount);

        }

        public boolean tryAdvance(Consumer<? super Long> action) {

            if (action == null)

                throw new NullPointerException();

            int hi = getFence(), i = index;

            if (i < hi) {

                index = i + 1;

                Long e = list.elementData[i];

                action.accept(e);

                if (list.modCount != expectedModCount)

                    throw new ConcurrentModificationException();

                return true;

            }

            return false;

        }

        public void forEachRemaining(Consumer<? super Long> action) {

            int i, hi, mc; // hoist accesses and checks from loop

            ArrayListOfLong lst; long[] a;

            if (action == null)

                throw new NullPointerException();

            if ((lst = list) != null && (a = lst.elementData) != null) {

                if ((hi = fence) < 0) {

                    mc = lst.modCount;

                    hi = lst.size;

                }

                else

                    mc = expectedModCount;

                if ((i = index) >= 0 && (index = hi) <= a.length) {

                    for (; i < hi; ++i) {

                        action.accept(a[i]);

                    }

                    if (lst.modCount == mc)

                        return;

                }

            }

            throw new ConcurrentModificationException();

        }

        public long estimateSize() {

            return (long) (getFence() - index);

        }

        public int characteristics() {

            return Spliterator.ORDERED | Spliterator.SIZED | Spliterator.SUBSIZED;

        }

    }

    @Override

    public boolean removeIf(Predicate<? super Long> filter) {

        Objects.requireNonNull(filter);

        // figure out which elements are to be removed

        // any exception thrown from the filter predicate at this stage

        // will leave the collection unmodified

        int removeCount = 0;

        final BitSet removeSet = new BitSet(size);

        final int expectedModCount = modCount;

        final int size = this.size;

        for (int i=0; modCount == expectedModCount && i < size; i++) {

            @SuppressWarnings("unchecked")

            final Long element = (Long) elementData[i];

            if (filter.test(element)) {

                removeSet.set(i);

                removeCount++;

            }

        }

        if (modCount != expectedModCount) {

            throw new ConcurrentModificationException();

        }

        // shift surviving elements left over the spaces left by removed elements

        final boolean anyToRemove = removeCount > 0;

        if (anyToRemove) {

            final int newSize = size - removeCount;

            for (int i=0, j=0; (i < size) && (j < newSize); i++, j++) {

                i = removeSet.nextClearBit(i);

                elementData[j] = elementData[i];

            }

            this.size = newSize;

            if (modCount != expectedModCount) {

                throw new ConcurrentModificationException();

            }

            modCount++;

        }

        return anyToRemove;

    }

    @Override

    @SuppressWarnings("unchecked")

    public void replaceAll(UnaryOperator<Long> operator) {

        Objects.requireNonNull(operator);

        final int expectedModCount = modCount;

        final int size = this.size;

        for (int i=0; modCount == expectedModCount && i < size; i++) {

            elementData[i] = operator.apply((Long) elementData[i]);

        }

        if (modCount != expectedModCount) {

            throw new ConcurrentModificationException();

        }

        modCount++;

    }

    @Override

    @SuppressWarnings("unchecked")

    public void sort(Comparator<? super Long> c) {

        final int expectedModCount = modCount;

        Arrays.sort(elementData);

//        Arrays.sort(elementData, 0, size, c);

        if (modCount != expectedModCount) {

            throw new ConcurrentModificationException();

        }

        modCount++;

    }

}