Uses of Class
org.jheaps.tree.DaryTreeAddressableHeap.Node
Packages that use DaryTreeAddressableHeap.Node
-
Uses of DaryTreeAddressableHeap.Node in org.jheaps.tree
Fields in org.jheaps.tree declared as DaryTreeAddressableHeap.NodeModifier and TypeFieldDescriptionprivate DaryTreeAddressableHeap<K,
V>.Node[] DaryTreeAddressableHeap.aux
Auxiliary for swapping children.(package private) DaryTreeAddressableHeap<K,
V>.Node[] DaryTreeAddressableHeap.Node.children
(package private) DaryTreeAddressableHeap<K,
V>.Node DaryTreeAddressableHeap.Node.parent
private DaryTreeAddressableHeap<K,
V>.Node DaryTreeAddressableHeap.root
Root node of the heapMethods in org.jheaps.tree that return DaryTreeAddressableHeap.NodeModifier and TypeMethodDescriptionprivate DaryTreeAddressableHeap<K,
V>.Node DaryTreeAddressableHeap.findNode
(long node) Start at the root and traverse the tree in order to find a particular node based on its numbering on a level-order traversal of the tree.Methods in org.jheaps.tree with parameters of type DaryTreeAddressableHeap.NodeModifier and TypeMethodDescriptionprivate void
DaryTreeAddressableHeap.fixdown
(DaryTreeAddressableHeap<K, V>.Node n) private void
DaryTreeAddressableHeap.fixup
(DaryTreeAddressableHeap<K, V>.Node n) private void
DaryTreeAddressableHeap.swap
(DaryTreeAddressableHeap<K, V>.Node a, DaryTreeAddressableHeap<K, V>.Node b) Swap two nodes