Application: gvSIG desktop

    @Override

    public String[] getRequiredFieldNames() {

        FeatureAttributeEmulator emulator = this.getFeatureAttributeEmulator();

        if( emulator==null ) {

            return null;

        }

        return emulator.getRequiredFieldNames();

    }

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

import org.gvsig.fmap.dal.DataFactory;

import org.gvsig.fmap.dal.DataFactoryUnit;

import org.gvsig.fmap.dal.spi.AbstractDataFactory;

import org.gvsig.tools.dynobject.DynObject;

import org.gvsig.tools.service.spi.Services;

public class GeometryIndexProviderFactory 

        extends AbstractDataFactory

        implements DataFactory 

    {

    private static final String NAME = "GeometryIndex";

    public GeometryIndexProviderFactory() {

        super(NAME, "");

    }

    @Override

    public DataFactoryUnit create(DynObject parameters, Services services) {

        return new GeometryIndexProvider();

    }

    @Override

    public DynObject createParameters() {

        return null;

    }

}

/**

 * gvSIG. Desktop Geographic Information System.

 *

 * Copyright (C) 2007-2013 gvSIG Association.

 *

 * This program is free software; you can redistribute it and/or

 * modify it under the terms of the GNU General Public License

 * as published by the Free Software Foundation; either version 3

 * of the License, or (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,

 * MA  02110-1301, USA.

 *

 * For any additional information, do not hesitate to contact us

 * at info AT gvsig.com, or visit our website www.gvsig.com.

 */

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

import java.util.List;

import org.gvsig.fmap.dal.exception.DataException;

import org.gvsig.fmap.dal.feature.exception.FeatureIndexException;

import org.gvsig.fmap.dal.feature.spi.FeatureReferenceProviderServices;

import org.gvsig.fmap.dal.feature.spi.index.AbstractFeatureIndexProvider;

import org.gvsig.fmap.geom.Geometry;

import org.gvsig.fmap.geom.primitive.Envelope;

import java.util.Iterator;

import org.apache.commons.collections4.IteratorUtils;

import org.gvsig.fmap.geom.SpatialIndex;

public class GeometryIndexProvider extends AbstractFeatureIndexProvider {

	private SpatialIndex index = null;

	public GeometryIndexProvider() {

	}

    @Override

    public void initialize() {

    }

    protected Envelope getEnvelope(Object value) {

        Envelope env = null;

        if (value instanceof Envelope) {

            env = (Envelope) value;

        } else

            if (value instanceof Geometry) {

                env = ((Geometry) value).getEnvelope();

            }

        return env;

    }

    @Override

    public void insert(Object value, FeatureReferenceProviderServices fref) {

        this.index.insert(getEnvelope(value), fref);

    }

    @Override

    public void delete(Object value, FeatureReferenceProviderServices fref) {

        this.index.remove(getEnvelope(value), fref);

    }

    @Override

    public List match(Object value) throws FeatureIndexException {

        return this.index.queryAsList(getEnvelope(value));

    }

    @Override

    public List nearest(int count, Object value) {

        if( !this.index.getFactory().isNearestQuerySupported() ) {

            throw new UnsupportedOperationException();

        }

        if (value == null) {

            throw new IllegalArgumentException("value is null");

        }

        Iterator x = this.index.queryNearest(getEnvelope(value), count);

        return IteratorUtils.toList(x);

    }

    @Override

    public boolean isMatchSupported() {

        return true;

    }

    @Override

    public boolean isNearestSupported() {

        return this.index.getFactory().isNearestQuerySupported();

    }

    @Override

    public boolean isNearestToleranceSupported() {

        return false;

    }

    @Override

    public boolean isRangeSupported() {

        return false;

    }

    @Override

    public List nearest(int count, Object value, Object tolerance)

        throws FeatureIndexException {

        throw new UnsupportedOperationException();

    }

    @Override

    public List range(Object value1, Object value2)

        throws FeatureIndexException {

        throw new UnsupportedOperationException();

    }

    @Override

    public void clear() throws DataException {

        this.index.removeAll();

    }

 }

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

import org.gvsig.fmap.dal.DALLocator;

import org.gvsig.fmap.dal.DataFactory;

import org.gvsig.fmap.dal.DataFactoryUnit;

import org.gvsig.fmap.dal.DataTypes;

import org.gvsig.fmap.dal.impl.DefaultDataManager;

import org.gvsig.fmap.dal.spi.AbstractDataFactory;

import org.gvsig.tools.dynobject.DynObject;

import org.gvsig.tools.service.spi.Services;

public class MemoryDoubleIndexProviderFactory 

    extends AbstractDataFactory

    implements DataFactory 

    {

    public static final String NAME = "MemoryDoubleIndexProvider";

    public MemoryDoubleIndexProviderFactory() {

        super(NAME, "");

    }

    @Override

    public DataFactoryUnit create(DynObject parameters, Services services) {

        return new MemoryBasicTypesIndexProvider<Double>();

    }

    @Override

    public DynObject createParameters() {

        return null;

    }

    public static void selfRegister() {

        DefaultDataManager dataManager = (DefaultDataManager) DALLocator.getDataManager();

        if( !dataManager.getFeatureIndexRegister().exits(NAME) ) {

            dataManager.getFeatureIndexRegister().register(new MemoryDoubleIndexProviderFactory());

            dataManager.setDefaultFeatureIndexProviderName(

                    DataTypes.DOUBLE, 

                    NAME

            );

        }        

    }

}

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

import org.gvsig.fmap.dal.DALLocator;

import org.gvsig.fmap.dal.DataFactory;

import org.gvsig.fmap.dal.DataFactoryUnit;

import org.gvsig.fmap.dal.DataTypes;

import org.gvsig.fmap.dal.impl.DefaultDataManager;

import org.gvsig.fmap.dal.spi.AbstractDataFactory;

import org.gvsig.tools.dynobject.DynObject;

import org.gvsig.tools.service.spi.Services;

public class MemoryIntIndexProviderFactory 

    extends AbstractDataFactory

    implements DataFactory 

    {

    public static final String NAME = "MemoryIntIndexProvider";

    public MemoryIntIndexProviderFactory() {

        super(NAME, "");

    }

    @Override

    public DataFactoryUnit create(DynObject parameters, Services services) {

        return new MemoryBasicTypesIndexProvider<Integer>();

    }

    @Override

    public DynObject createParameters() {

        return null;

    }

    public static void selfRegister() {

        DefaultDataManager dataManager = (DefaultDataManager) DALLocator.getDataManager();

        if( !dataManager.getFeatureIndexRegister().exits(NAME) ) {

            dataManager.getFeatureIndexRegister().register(new MemoryIntIndexProviderFactory());

            dataManager.setDefaultFeatureIndexProviderName(

                    DataTypes.INT, 

                    NAME

            );

        }        

    }

}

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);

        }

    }

    public Long[] toArray() {

        return toArray(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