|
| |
|
| java.lang.Object
 org.drools.util.LinkedList
| LinkedList | | public class LinkedList implements Serializable(Code) | | This is a simple linked linked implementation. Each node must implement LinkedListNode so that it references
the node before and after it. This way a node can be removed without having to scan the list to find it. This class
does not provide an Iterator implementation as its designed for efficiency and not genericity. There are a number of
ways to iterate the list.
Simple iterator:
for ( LinkedListNode node = list.getFirst(); node != null; node = node.getNext() ) {
}
Iterator that pops the first entry:
for ( LinkedListNode node = list.removeFirst(); node != null; node = list.removeFirst() ) {
}
author:
Mark Proctor
author:
Bob McWhirter |
| LinkedList | | public LinkedList()(Code) | | Construct an empty LinkedList
|
| add | | public void add(LinkedListNode node)(Code) | | Add a LinkedListNode to the list. If the LinkedList is empty then the first and
last nodes are set to the added node.
Parameters:
node - The LinkedListNode to be added |
| clear | | public void clear()(Code) | | Iterates the list removing all the nodes until there are no more nodes to remove.
|
| getFirst | | final public LinkedListNode getFirst()(Code) | | Return the first node in the list
The first LinkedListNode. |
| getLast | | final public LinkedListNode getLast()(Code) | | Return the last node in the list
The last LinkedListNode. |
| hashCode | | public int hashCode()(Code) | | |
| isEmpty | | final public boolean isEmpty()(Code) | | boolean value indicating the empty status of the list |
| remove | | public void remove(LinkedListNode node)(Code) | | Removes a LinkedListNode from the list. This works by attach the previous reference to the child reference.
When the node to be removed is the first node it calls removeFirst(). When the node to be removed is the last node
it calls removeLast().
Parameters:
node - The LinkedListNode to be removed. |
| removeFirst | | public LinkedListNode removeFirst()(Code) | | Remove the first node from the list. The next node then becomes the first node. If this is the last
node then both first and last node references are set to null.
The first LinkedListNode. |
| removeLast | | public LinkedListNode removeLast()(Code) | | Remove the last node from the list. The previous node then becomes the last node. If this is the last
node then both first and last node references are set to null.
The first LinkedListNode. |
| size | | final public int size()(Code) | | return size of the list as an int |
|
|
|