|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object org.apache.commons.collections.list.AbstractLinkedList<E> org.apache.commons.collections.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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class org.apache.commons.collections.list.AbstractLinkedList |
---|
AbstractLinkedList.LinkedListIterator<E>, AbstractLinkedList.LinkedSubList<E>, AbstractLinkedList.LinkedSubListIterator<E>, AbstractLinkedList.Node<T> |
Field Summary | |
---|---|
protected int |
cacheSize
The size of the cache. |
protected static int |
DEFAULT_MAXIMUM_CACHE_SIZE
The default value for maximumCacheSize . |
protected AbstractLinkedList.Node<E> |
firstCachedNode
The first cached node, or null if no nodes are cached. |
protected int |
maximumCacheSize
The maximum size of the cache. |
Fields inherited from class org.apache.commons.collections.list.AbstractLinkedList |
---|
header, modCount, size |
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.collections.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 |
Field Detail |
---|
protected static final int DEFAULT_MAXIMUM_CACHE_SIZE
maximumCacheSize
.
protected transient AbstractLinkedList.Node<E> firstCachedNode
null
if no nodes are cached.
Cached nodes are stored in a singly-linked list with
next
pointing to the next element.
protected transient int cacheSize
protected int maximumCacheSize
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 |