List interface.See: Description
| Class | Description | 
|---|---|
| AbstractLinkedList<E> | 
 An abstract implementation of a linked list which provides numerous points for
 subclasses to override. 
 | 
| AbstractListDecorator<E> | 
 Decorates another  
List to provide additional behaviour. | 
| AbstractSerializableListDecorator<E> | 
 Serializable subclass of AbstractListDecorator. 
 | 
| CursorableLinkedList<E> | 
 A  
List implementation with a ListIterator that
 allows concurrent modifications to the underlying list. | 
| CursorableLinkedList.Cursor<E> | 
 An extended  
ListIterator that allows concurrent changes to
 the underlying list. | 
| FixedSizeList<E> | 
 Decorates another  
List to fix the size preventing add/remove. | 
| GrowthList<E> | 
 Decorates another  
List to make it seamlessly grow when
 indices larger than the list size are used on add and set,
 avoiding most IndexOutOfBoundsExceptions. | 
| LazyList<E> | 
 Decorates another  
List to create objects in the list on demand. | 
| NodeCachingLinkedList<E> | 
 A  
List implementation that stores a cache of internal Node objects
 in an effort to reduce wasteful object creation. | 
| PredicatedList<E> | 
 Decorates another  
List to validate that all additions
 match a specified predicate. | 
| SetUniqueList<E> | 
 Decorates a  
List to ensure that no duplicates are present much
 like a Set. | 
| TransformedList<E> | 
 Decorates another  
List to transform objects that are added. | 
| TreeList<E> | 
 A  
List implementation that is optimised for fast insertions and
 removals at any index in the list. | 
| UnmodifiableList<E> | 
 Decorates another  
List to ensure it can't be altered. | 
List interface.
 The following implementations are provided in the package:
The following decorators are provided in the package:
Copyright © 2010 - 2023 Adobe. All Rights Reserved