|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface TrieLeafNode<E>
Method Summary | |
---|---|
void |
addAfter(TrieLeafNode<E> ptr)
The TrieLeafNode interface must be supported by any
class defining objects to be used as leaf nodes in a trie. |
boolean |
isDeleted()
Returns true if and only if this trie leaf node is not in use. |
void |
markDeleted()
Marks this trie leaf node as no longer in use. |
TrieLeafNode<E> |
next()
Returns a reference to the next leaf node in the ordered leaf chain. |
TrieLeafNode<E> |
prev()
Returns a reference to previous leaf node in the ordered leaf chain. |
void |
remove()
Removes this trie leaf node from the ordered leaf chain. |
void |
setNext(TrieLeafNode<E> newNode)
Sets the next element in the ordered leaf chain to the leaf node referenced by newNode . |
void |
setPrev(TrieLeafNode<E> prevNode)
Sets the previous element in the ordered leaf chain to prevNode . |
Methods inherited from interface goldman.collection.ordered.digitized.TrieNode |
---|
child, data, isLeaf, parent, setParent |
Method Detail |
---|
void addAfter(TrieLeafNode<E> ptr)
TrieLeafNode
interface must be supported by any
class defining objects to be used as leaf nodes in a trie.
Inserts
this trie leaf node into the ordered leaf chain
immediately after the trie leaf node referenced by ptr
.
boolean isDeleted()
void markDeleted()
TrieLeafNode<E> next()
TrieLeafNode<E> prev()
void remove()
void setNext(TrieLeafNode<E> newNode)
newNode
.
void setPrev(TrieLeafNode<E> prevNode)
prevNode
.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |