|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use TrieLeafNode | |
---|---|
goldman.collection.ordered.digitized | A digitized ordered collection is an untagged algorithmically positioned collection whose elements can each be viewed as a sequence of digits (e.g., bit string, character string). |
Uses of TrieLeafNode in goldman.collection.ordered.digitized |
---|
Classes in goldman.collection.ordered.digitized that implement TrieLeafNode | |
---|---|
class |
AbstractTrieLeafNode<E>
The AbstractTrieLeafNode class implements methods that can be shared by all implementations of a trie leaf node. |
protected class |
CompressedTrie.LeafNode
|
protected class |
PatriciaTrie.Node
|
protected class |
Trie.LeafNode
|
Methods in goldman.collection.ordered.digitized that return TrieLeafNode | |
---|---|
protected TrieLeafNode<E> |
Trie.insert(E element)
|
protected TrieLeafNode<E> |
PatriciaTrie.insert(E element)
|
protected TrieLeafNode<E> |
TernarySearchTrie.newLeafNode(E element,
int level)
|
TrieLeafNode<E> |
TrieLeafNode.next()
Returns a reference to the next leaf node in the ordered leaf chain. |
TrieLeafNode<E> |
AbstractTrieLeafNode.next()
|
TrieLeafNode<E> |
TrieLeafNode.prev()
Returns a reference to previous leaf node in the ordered leaf chain. |
TrieLeafNode<E> |
AbstractTrieLeafNode.prev()
|
protected TrieLeafNode<E> |
Trie.Tracker.skipRemovedElements(TrieLeafNode<E> ptr)
Similar to the path compression performed by the union-find data structure (Section~\ref{sec:union-find}), this method performs the optimization of compressing the path of the redirect chain by updating all next pointers to refer directly to the returned element. |
Methods in goldman.collection.ordered.digitized with parameters of type TrieLeafNode | |
---|---|
void |
TrieLeafNode.addAfter(TrieLeafNode<E> ptr)
The TrieLeafNode interface must be supported by any
class defining objects to be used as leaf nodes in a trie. |
void |
AbstractTrieLeafNode.addAfter(TrieLeafNode<E> ptr)
|
void |
TrieLeafNode.setNext(TrieLeafNode<E> newNode)
Sets the next element in the ordered leaf chain to the leaf node referenced by newNode . |
void |
AbstractTrieLeafNode.setNext(TrieLeafNode<E> nextNode)
|
void |
TrieLeafNode.setPrev(TrieLeafNode<E> prevNode)
Sets the previous element in the ordered leaf chain to prevNode . |
void |
AbstractTrieLeafNode.setPrev(TrieLeafNode<E> prevNode)
|
protected TrieLeafNode<E> |
Trie.Tracker.skipRemovedElements(TrieLeafNode<E> ptr)
Similar to the path compression performed by the union-find data structure (Section~\ref{sec:union-find}), this method performs the optimization of compressing the path of the redirect chain by updating all next pointers to refer directly to the returned element. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |