List
implementation that stores a cache of internal Node objects in an effort to reduce wasteful object creation. A linked list creates one Node for each item of data added. This can result in a lot of object creation and garbage collection. This implementation seeks to avoid that by maintaining a store of cached nodes.
This implementation is suitable for long-lived lists where both add and remove are used. Short-lived lists, or lists which only grow will have worse performance using this class.
Note that this implementation is not synchronized. @since 3.0 @version $Id: NodeCachingLinkedList.java 1477772 2013-04-30 18:44:21Z tn $
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|