|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.apache.commons.collections4.list.AbstractLinkedList<E>
org.apache.commons.collections4.list.NodeCachingLinkedList<E>
public class NodeCachingLinkedList<E>
A 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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class org.apache.commons.collections4.list.AbstractLinkedList |
---|
AbstractLinkedList.LinkedListIterator<E>, AbstractLinkedList.LinkedSubList<E>, AbstractLinkedList.LinkedSubListIterator<E>, AbstractLinkedList.Node<E> |
Constructor Summary | |
---|---|
NodeCachingLinkedList()
Constructor that creates. |
|
NodeCachingLinkedList(Collection<E> coll)
Constructor that copies the specified collection |
|
NodeCachingLinkedList(int maximumCacheSize)
Constructor that species the maximum cache size. |
Method Summary | |
---|---|
protected void |
addNodeToCache(AbstractLinkedList.Node<E> node)
Adds a node to the cache, if the cache isn't full. |
protected AbstractLinkedList.Node<E> |
createNode(E value)
Creates a new node, either by reusing one from the cache or creating a new one. |
protected int |
getMaximumCacheSize()
Gets the maximum size of the cache. |
protected AbstractLinkedList.Node<E> |
getNodeFromCache()
Gets a node from the cache. |
protected boolean |
isCacheFull()
Checks whether the cache is full. |
protected void |
removeAllNodes()
Removes all the nodes from the list, storing as many as required in the cache for reuse. |
protected void |
removeNode(AbstractLinkedList.Node<E> node)
Removes the node from the list, storing it in the cache for reuse if the cache is not yet full. |
protected void |
setMaximumCacheSize(int maximumCacheSize)
Sets the maximum size of the cache. |
protected void |
shrinkCacheToMaximumSize()
Reduce the size of the cache to the maximum, if necessary. |
Methods inherited from class org.apache.commons.collections4.list.AbstractLinkedList |
---|
add, add, addAll, addAll, addFirst, addLast, addNode, addNodeAfter, addNodeBefore, clear, contains, containsAll, createHeaderNode, createSubListIterator, createSubListListIterator, doReadObject, doWriteObject, equals, get, getFirst, getLast, getNode, hashCode, indexOf, init, isEmpty, isEqualValue, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeFirst, removeLast, retainAll, set, size, subList, toArray, toArray, toString, updateNode |
Methods inherited from class java.lang.Object |
---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public NodeCachingLinkedList()
public NodeCachingLinkedList(Collection<E> coll)
coll
- the collection to copypublic NodeCachingLinkedList(int maximumCacheSize)
maximumCacheSize
- the maximum cache sizeMethod Detail |
---|
protected int getMaximumCacheSize()
protected void setMaximumCacheSize(int maximumCacheSize)
maximumCacheSize
- the new maximum cache sizeprotected void shrinkCacheToMaximumSize()
protected AbstractLinkedList.Node<E> getNodeFromCache()
cacheSize
is decreased accordingly. The node that is returned
will have null
values for next, previous and element.
null
if there are no nodes in the cache.protected boolean isCacheFull()
protected void addNodeToCache(AbstractLinkedList.Node<E> node)
node
- the node to add to the cacheprotected AbstractLinkedList.Node<E> createNode(E value)
createNode
in class AbstractLinkedList<E>
value
- value of the new node
protected void removeNode(AbstractLinkedList.Node<E> node)
removeNode
in class AbstractLinkedList<E>
node
- the node to removeprotected void removeAllNodes()
removeAllNodes
in class AbstractLinkedList<E>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |