|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
PositionalCollection<E> | Often an application needs to maintain a collection of elements that are accessed via their position in a line (with 0 being the position of the first element in the line) or via their location relative to other elements in the line. |
PositionalCollectionLocator<E> | The PositionalCollectionLocator interface
extends the Locator interface to add methods that are
specific to a positional collection. |
Class Summary | |
---|---|
AbstractPositionalCollection<E> | The AbstractPositionalCollection provides
a basis for defining concrete positional collections by defining a useful
set of methods that can be implemented for
any positional collection in terms of the public methods from the
PositionalCollection interface. |
Array<E> | The simplest of the positional collections, Array provides space for a fixed number of elements, which are stored in an underlying Java primitive array. |
Buffer<E> | For many applications, elements need only be added or removed from the front or back end of the collection. |
CircularArray<E> | This array-based data structure allows element 0 of the positional collection to be in any slot of the underlying array, with the range of underlying indices wrapping around as needed. |
DoublyLinkedList<E> | The doubly linked list is the only positional collection data structure
that provides amortized constant time methods for all of the
PositionalCollectionLocator methods except getCurrentPosition . |
DoublyLinkedList.DLListItem<E> | |
DynamicArray<E> | This array-based data structure provides space for a fixed number of elements, which are stored in an underlying Java primitive array. |
DynamicCircularArray<E> | This array-based data structure allows element 0 of the positional collection to be in any slot of the underlying array, with the range of underlying indices wrapping around as needed, and also performs automatic resizing. |
Queue<E> | A queue is a more specialized abstraction than a buffer that maintains a first-in, first-out (FIFO) line. |
SinglyLinkedList<E> | The simplest of the list-based positional collections, SinglyLinkedList maintains a linked list where each list node only references the next element in the list. |
SinglyLinkedList.ListItem<E> | The ListItem interface must be supported by any
class defining objects to be used in a singly linked list or a
doubly linked list. |
Stack<E> | More specialized than a buffer, a stack is natural for applications that insert and remove elements only at one end of the buffer. |
TrackedArray<E> | This array-based data structure can wrap any of the other array-based data structures to create a tracked implementation of the wrapped data structure. |
Exception Summary | |
---|---|
PositionOutOfBoundsException | A PositionOutOfBoundsException is thrown when there is an
attempt to access a position that does not exists (i.e., < 0 or
≥ size ). |
A positional collection is a manually positioned collection in which elements are accessed via their position in a line (with 0 being the position of the first element in the line) or via their location relative to other elements in the line. In a positional collection, the iteration order is given by: position 0, position 1, ..., position n-1.
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |