|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use AbstractPositionalCollection | |
---|---|
goldman.collection.positional | 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. |
Uses of AbstractPositionalCollection in goldman.collection.positional |
---|
Subclasses of AbstractPositionalCollection in goldman.collection.positional | |
---|---|
class |
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. |
class |
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. |
class |
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 . |
class |
DynamicArray<E>
This array-based data structure provides space for a fixed number of elements, which are stored in an underlying Java primitive array. |
class |
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. |
class |
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. |
class |
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. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |