Class CircularList<E>

java.lang.Object
java.util.AbstractCollection<E>
java.util.AbstractList<E>
jmt.framework.data.CircularList<E>
All Implemented Interfaces:
Serializable, Cloneable, Iterable<E>, Collection<E>, List<E>, RandomAccess, SequencedCollection<E>

public class CircularList<E> extends AbstractList<E> implements List<E>, RandomAccess, Cloneable, Serializable

Name: CircularList

Description: A random access circular list based on an array, optimized for speed in append and remove operations in the head or tail of the list. The array is able to grow when internal capacity is finished, with an O(n) complexity.
CircularQueue is optimized to have O(1) complexity on each get operation and in add and remove operations at the beginning and at the end of the list. Other operations are O(n). This implementation is good for unordered, unbounded LIFO/FIFO queues.

Date: 10/giu/2009 Time: 19:22:03

Version:
1.0
Author:
Bertoli Marco
See Also: