Package org.drools.core.util
Class LinkedList<T extends LinkedListNode<T>>
- java.lang.Object
-
- org.drools.core.util.LinkedList<T>
-
- All Implemented Interfaces:
java.io.Externalizable
,java.io.Serializable
- Direct Known Subclasses:
EqualityKey
,SegmentMemory
public class LinkedList<T extends LinkedListNode<T>> extends java.lang.Object implements java.io.Externalizable
This is a simple linked linked implementation. Each node must implement LinkedListNodeso 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.remove() ) { }
Iterator that pops the first entry:for ( LinkedListNode node = list.removeFirst(); node != null; node = list.removeFirst() ) { }
- See Also:
- Serialized Form
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description static class
LinkedList.JavaUtilIterator<T extends LinkedListNode<T>>
static class
LinkedList.LinkedListFastIterator<K extends Entry<K>>
static class
LinkedList.LinkedListIterator<T extends LinkedListNode<T>>
Returns a list iterator
-
Field Summary
Fields Modifier and Type Field Description static FastIterator<Tuple>
fastIterator
-
Constructor Summary
Constructors Constructor Description LinkedList()
Construct an emptyLinkedList
LinkedList(T node)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
add(T node)
Add aLinkedListNode
to the list.void
addFirst(T node)
void
addLast(T node)
Add aLinkedListNode
to the end of the list.void
clear()
Iterates the list removing all the nodes until there are no more nodes to remove.boolean
contains(T node)
boolean
equals(java.lang.Object object)
FastIterator
fastIterator()
T
get(int i)
T
getFirst()
Return the first node in the listT
getLast()
Return the last node in the listint
hashCode()
void
insertAfter(T existingNode, T newNode)
boolean
isEmpty()
FastIterator
iterator()
java.util.Iterator<T>
javaUtilIterator()
void
readExternal(java.io.ObjectInput in)
void
remove(T node)
Removes aLinkedListNode
from the list.T
removeFirst()
Remove the first node from the list.T
removeLast()
Remove the last node from the list.int
size()
void
writeExternal(java.io.ObjectOutput out)
-
-
-
Field Detail
-
fastIterator
public static final FastIterator<Tuple> fastIterator
-
-
Constructor Detail
-
LinkedList
public LinkedList()
Construct an emptyLinkedList
-
LinkedList
public LinkedList(T node)
-
-
Method Detail
-
readExternal
public void readExternal(java.io.ObjectInput in) throws java.io.IOException, java.lang.ClassNotFoundException
- Specified by:
readExternal
in interfacejava.io.Externalizable
- Throws:
java.io.IOException
java.lang.ClassNotFoundException
-
writeExternal
public void writeExternal(java.io.ObjectOutput out) throws java.io.IOException
- Specified by:
writeExternal
in interfacejava.io.Externalizable
- Throws:
java.io.IOException
-
add
public void add(T node)
Add aLinkedListNode
to the list. If theLinkedList
is empty then the first and last nodes are set to the added node.- Parameters:
node
- TheLinkedListNode
to be added
-
addLast
public void addLast(T node)
Add aLinkedListNode
to the end of the list. If theLinkedList
is empty then the first and last nodes are set to the added node.- Parameters:
node
- TheLinkedListNode
to be added
-
addFirst
public void addFirst(T node)
-
remove
public void remove(T node)
Removes aLinkedListNode
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 callsremoveFirst()
. When the node to be removed is the last node it callsremoveLast()
.- Parameters:
node
- TheLinkedListNode
to be removed.
-
contains
public boolean contains(T node)
-
getFirst
public final T getFirst()
Return the first node in the list- Returns:
- The first
LinkedListNode
.
-
getLast
public final T getLast()
Return the last node in the list- Returns:
- The last
LinkedListNode
.
-
removeFirst
public T removeFirst()
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.- Returns:
- The first
LinkedListNode
.
-
removeLast
public T removeLast()
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.- Returns:
- The first
LinkedListNode
.
-
get
public T get(int i)
-
isEmpty
public final boolean isEmpty()
- Returns:
- boolean value indicating the empty status of the list
-
clear
public void clear()
Iterates the list removing all the nodes until there are no more nodes to remove.
-
size
public final int size()
- Returns:
- return size of the list as an int
-
hashCode
public int hashCode()
- Overrides:
hashCode
in classjava.lang.Object
-
equals
public boolean equals(java.lang.Object object)
- Overrides:
equals
in classjava.lang.Object
-
iterator
public FastIterator iterator()
-
fastIterator
public FastIterator fastIterator()
-
javaUtilIterator
public java.util.Iterator<T> javaUtilIterator()
-
-