Uses of Class
org.jheaps.tree.BinaryTreeSoftAddressableHeap.RootListNode
-
Packages that use BinaryTreeSoftAddressableHeap.RootListNode Package Description org.jheaps.tree Heaps using an explicit "pointer-based" tree representation -
-
Uses of BinaryTreeSoftAddressableHeap.RootListNode in org.jheaps.tree
Fields in org.jheaps.tree declared as BinaryTreeSoftAddressableHeap.RootListNode Modifier and Type Field Description (package private) BinaryTreeSoftAddressableHeap.RootListNode<K,V>
BinaryTreeSoftAddressableHeap.RootList. head
(package private) BinaryTreeSoftAddressableHeap.RootListNode<K,V>
BinaryTreeSoftAddressableHeap.RootListNode. next
(package private) BinaryTreeSoftAddressableHeap.RootListNode<K,V>
BinaryTreeSoftAddressableHeap.RootListNode. prev
(package private) BinaryTreeSoftAddressableHeap.RootListNode<K,V>
BinaryTreeSoftAddressableHeap.RootListNode. suffixMin
(package private) BinaryTreeSoftAddressableHeap.RootListNode<K,V>
BinaryTreeSoftAddressableHeap.RootList. tail
Methods in org.jheaps.tree with parameters of type BinaryTreeSoftAddressableHeap.RootListNode Modifier and Type Method Description private void
BinaryTreeSoftAddressableHeap. delete(BinaryTreeSoftAddressableHeap.RootListNode<K,V> n)
Delete a node from the root list.private void
BinaryTreeSoftAddressableHeap. mergeInto(BinaryTreeSoftAddressableHeap.RootListNode<K,V> head, BinaryTreeSoftAddressableHeap.RootListNode<K,V> tail)
Merge a list into the root list.private void
BinaryTreeSoftAddressableHeap. updateSuffixMin(BinaryTreeSoftAddressableHeap.RootListNode<K,V> t)
Update all suffix minimum pointers for a node and all its predecessors in the root list.
-