|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object net.sf.collections15.list.AbstractLinkedList<E>
public abstract class AbstractLinkedList<E>
An abstract implementation of a linked list which provides numerous points for subclasses to override.
Overridable methods are provided to change the storage node and to change how nodes are added to and removed. Hopefully, all you need for unusual subclasses is here.
Nested Class Summary | |
---|---|
protected static class |
AbstractLinkedList.LinkedListIterator<T>
A list iterator over the linked list. |
protected static class |
AbstractLinkedList.LinkedSubList<T>
The sublist implementation for AbstractLinkedList. |
protected static class |
AbstractLinkedList.LinkedSubListIterator<T>
A list iterator over the linked sub list. |
protected static class |
AbstractLinkedList.Node<T>
A node within the linked list. |
Field Summary | |
---|---|
protected AbstractLinkedList.Node<E> |
header
A AbstractLinkedList.Node which indicates the start and end of the list and does not
hold a value. |
protected int |
modCount
Modification count for iterators |
protected int |
size
The size of the list |
Constructor Summary | |
---|---|
protected |
AbstractLinkedList()
Constructor that does nothing intended for deserialization. |
protected |
AbstractLinkedList(java.util.Collection<? extends E> coll)
Constructs a list copying data from the specified collection. |
Method Summary | ||
---|---|---|
boolean |
add(E value)
|
|
void |
add(int index,
E value)
|
|
boolean |
addAll(java.util.Collection<? extends E> coll)
|
|
boolean |
addAll(int index,
java.util.Collection<? extends E> coll)
|
|
boolean |
addFirst(E o)
|
|
boolean |
addLast(E o)
|
|
protected void |
addNode(AbstractLinkedList.Node<E> nodeToInsert,
AbstractLinkedList.Node<E> insertBeforeNode)
Inserts a new node into the list. |
|
protected void |
addNodeAfter(AbstractLinkedList.Node<E> node,
E value)
Creates a new node with the specified object as its value and inserts it after node . |
|
protected void |
addNodeBefore(AbstractLinkedList.Node<E> node,
E value)
Creates a new node with the specified object as its value and inserts it before node . |
|
void |
clear()
|
|
boolean |
contains(java.lang.Object value)
|
|
boolean |
containsAll(java.util.Collection<?> coll)
|
|
protected AbstractLinkedList.Node<E> |
createHeaderNode()
Creates a new node with previous, next and element all set to null. |
|
protected AbstractLinkedList.Node<E> |
createNode(E value)
Creates a new node with the specified properties. |
|
protected java.util.Iterator<E> |
createSubListIterator(AbstractLinkedList.LinkedSubList<E> subList)
Creates an iterator for the sublist. |
|
protected java.util.ListIterator<E> |
createSubListListIterator(AbstractLinkedList.LinkedSubList<E> subList,
int fromIndex)
Creates a list iterator for the sublist. |
|
protected void |
doReadObject(java.io.ObjectInputStream inputStream)
Deserializes the data held in this object to the stream specified. |
|
protected void |
doWriteObject(java.io.ObjectOutputStream outputStream)
Serializes the data held in this object to the stream specified. |
|
boolean |
equals(java.lang.Object obj)
|
|
E |
get(int index)
|
|
E |
getFirst()
|
|
E |
getLast()
|
|
protected AbstractLinkedList.Node<E> |
getNode(int index,
boolean endMarkerAllowed)
Gets the node at a particular index. |
|
int |
hashCode()
|
|
int |
indexOf(java.lang.Object value)
|
|
protected void |
init()
The equivalent of a default constructor, broken out so it can be called by any constructor and by readObject . |
|
boolean |
isEmpty()
|
|
protected boolean |
isEqualValue(java.lang.Object value1,
java.lang.Object value2)
Compares two values for equals. |
|
java.util.Iterator<E> |
iterator()
|
|
int |
lastIndexOf(java.lang.Object value)
|
|
java.util.ListIterator<E> |
listIterator()
|
|
java.util.ListIterator<E> |
listIterator(int fromIndex)
|
|
E |
remove(int index)
|
|
boolean |
remove(java.lang.Object value)
|
|
boolean |
removeAll(java.util.Collection<?> coll)
|
|
protected void |
removeAllNodes()
Removes all nodes by resetting the circular list marker. |
|
E |
removeFirst()
|
|
E |
removeLast()
|
|
protected void |
removeNode(AbstractLinkedList.Node<E> node)
Removes the specified node from the list. |
|
boolean |
retainAll(java.util.Collection<?> coll)
|
|
E |
set(int index,
E value)
|
|
int |
size()
|
|
java.util.List<E> |
subList(int fromIndexInclusive,
int toIndexExclusive)
Gets a sublist of the main list. |
|
java.lang.Object[] |
toArray()
|
|
|
toArray(T[] array)
|
|
java.lang.String |
toString()
|
|
protected void |
updateNode(AbstractLinkedList.Node<E> node,
E value)
Updates the node with a new value. |
Methods inherited from class java.lang.Object |
---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
protected transient AbstractLinkedList.Node<E> header
AbstractLinkedList.Node
which indicates the start and end of the list and does not
hold a value. The value of next
is the first item in the
list. The value of of previous
is the last item in the list.
protected transient int size
protected transient int modCount
Constructor Detail |
---|
protected AbstractLinkedList()
If this constructor is used by a serializable subclass then the init() method must be called.
protected AbstractLinkedList(java.util.Collection<? extends E> coll)
coll
- the collection to copyMethod Detail |
---|
protected void init()
readObject
.
Subclasses which override this method should make sure they call super,
so the list is initialised properly.
public int size()
size
in interface java.util.Collection<E>
size
in interface java.util.List<E>
public boolean isEmpty()
isEmpty
in interface java.util.Collection<E>
isEmpty
in interface java.util.List<E>
public E get(int index)
get
in interface java.util.List<E>
public java.util.Iterator<E> iterator()
iterator
in interface java.lang.Iterable<E>
iterator
in interface java.util.Collection<E>
iterator
in interface java.util.List<E>
public java.util.ListIterator<E> listIterator()
listIterator
in interface java.util.List<E>
public java.util.ListIterator<E> listIterator(int fromIndex)
listIterator
in interface java.util.List<E>
public int indexOf(java.lang.Object value)
indexOf
in interface java.util.List<E>
public int lastIndexOf(java.lang.Object value)
lastIndexOf
in interface java.util.List<E>
public boolean contains(java.lang.Object value)
contains
in interface java.util.Collection<E>
contains
in interface java.util.List<E>
public boolean containsAll(java.util.Collection<?> coll)
containsAll
in interface java.util.Collection<E>
containsAll
in interface java.util.List<E>
public java.lang.Object[] toArray()
toArray
in interface java.util.Collection<E>
toArray
in interface java.util.List<E>
public <T> T[] toArray(T[] array)
toArray
in interface java.util.Collection<E>
toArray
in interface java.util.List<E>
public java.util.List<E> subList(int fromIndexInclusive, int toIndexExclusive)
subList
in interface java.util.List<E>
fromIndexInclusive
- the index to start fromtoIndexExclusive
- the index to end at
public boolean add(E value)
add
in interface java.util.Collection<E>
add
in interface java.util.List<E>
public void add(int index, E value)
add
in interface java.util.List<E>
public boolean addAll(java.util.Collection<? extends E> coll)
addAll
in interface java.util.Collection<E>
addAll
in interface java.util.List<E>
public boolean addAll(int index, java.util.Collection<? extends E> coll)
addAll
in interface java.util.List<E>
public E remove(int index)
remove
in interface java.util.List<E>
public boolean remove(java.lang.Object value)
remove
in interface java.util.Collection<E>
remove
in interface java.util.List<E>
public boolean removeAll(java.util.Collection<?> coll)
removeAll
in interface java.util.Collection<E>
removeAll
in interface java.util.List<E>
public boolean retainAll(java.util.Collection<?> coll)
retainAll
in interface java.util.Collection<E>
retainAll
in interface java.util.List<E>
public E set(int index, E value)
set
in interface java.util.List<E>
public void clear()
clear
in interface java.util.Collection<E>
clear
in interface java.util.List<E>
public E getFirst()
public E getLast()
public boolean addFirst(E o)
public boolean addLast(E o)
public E removeFirst()
public E removeLast()
public boolean equals(java.lang.Object obj)
equals
in interface java.util.Collection<E>
equals
in interface java.util.List<E>
equals
in class java.lang.Object
public int hashCode()
hashCode
in interface java.util.Collection<E>
hashCode
in interface java.util.List<E>
hashCode
in class java.lang.Object
public java.lang.String toString()
toString
in class java.lang.Object
protected boolean isEqualValue(java.lang.Object value1, java.lang.Object value2)
value1
- the first value to compare, may be nullvalue2
- the second value to compare, may be null
protected void updateNode(AbstractLinkedList.Node<E> node, E value)
node
- node to updatevalue
- new value of the nodeprotected AbstractLinkedList.Node<E> createHeaderNode()
protected AbstractLinkedList.Node<E> createNode(E value)
value
- value of the new nodeprotected void addNodeBefore(AbstractLinkedList.Node<E> node, E value)
value
and inserts it before node
.
This implementation uses createNode(Object)
and
addNode(AbstractLinkedList.Node,AbstractLinkedList.Node)
.
node
- node to insert beforevalue
- value of the newly added node
java.lang.NullPointerException
- if node
is nullprotected void addNodeAfter(AbstractLinkedList.Node<E> node, E value)
value
and inserts it after node
.
This implementation uses createNode(Object)
and
addNode(AbstractLinkedList.Node,AbstractLinkedList.Node)
.
node
- node to insert aftervalue
- value of the newly added node
java.lang.NullPointerException
- if node
is nullprotected void addNode(AbstractLinkedList.Node<E> nodeToInsert, AbstractLinkedList.Node<E> insertBeforeNode)
nodeToInsert
- new node to insertinsertBeforeNode
- node to insert before
java.lang.NullPointerException
- if either node is nullprotected void removeNode(AbstractLinkedList.Node<E> node)
node
- the node to remove
java.lang.NullPointerException
- if node
is nullprotected void removeAllNodes()
protected AbstractLinkedList.Node<E> getNode(int index, boolean endMarkerAllowed) throws java.lang.IndexOutOfBoundsException
index
- the index, starting from 0endMarkerAllowed
- whether or not the end marker can be returned if
startIndex is set to the list's size
java.lang.IndexOutOfBoundsException
- if the index is less than 0; equal to
the size of the list and endMakerAllowed is false; or greater than the
size of the listprotected java.util.Iterator<E> createSubListIterator(AbstractLinkedList.LinkedSubList<E> subList)
subList
- the sublist to get an iterator forprotected java.util.ListIterator<E> createSubListListIterator(AbstractLinkedList.LinkedSubList<E> subList, int fromIndex)
subList
- the sublist to get an iterator forfromIndex
- the index to start from, relative to the sublistprotected void doWriteObject(java.io.ObjectOutputStream outputStream) throws java.io.IOException
The first serializable subclass must call this method from
writeObject
.
java.io.IOException
protected void doReadObject(java.io.ObjectInputStream inputStream) throws java.io.IOException, java.lang.ClassNotFoundException
The first serializable subclass must call this method from
readObject
.
java.io.IOException
java.lang.ClassNotFoundException
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |