Uses of Class
org.jheaps.tree.BinaryTreeSoftAddressableHeap.TreeNode
-
Packages that use BinaryTreeSoftAddressableHeap.TreeNode Package Description org.jheaps.tree Heaps using an explicit "pointer-based" tree representation -
-
Uses of BinaryTreeSoftAddressableHeap.TreeNode in org.jheaps.tree
Fields in org.jheaps.tree declared as BinaryTreeSoftAddressableHeap.TreeNode Modifier and Type Field Description (package private) BinaryTreeSoftAddressableHeap.TreeNode<K,V>
BinaryTreeSoftAddressableHeap.TreeNode. left
(package private) BinaryTreeSoftAddressableHeap.TreeNode<K,V>
BinaryTreeSoftAddressableHeap.TreeNode. right
(package private) BinaryTreeSoftAddressableHeap.TreeNode<K,V>
BinaryTreeSoftAddressableHeap.RootListNode. root
(package private) BinaryTreeSoftAddressableHeap.TreeNode<K,V>
BinaryTreeSoftAddressableHeap.SoftHandle. tree
Methods in org.jheaps.tree that return BinaryTreeSoftAddressableHeap.TreeNode Modifier and Type Method Description private BinaryTreeSoftAddressableHeap.TreeNode<K,V>
BinaryTreeSoftAddressableHeap. combine(BinaryTreeSoftAddressableHeap.TreeNode<K,V> x, BinaryTreeSoftAddressableHeap.TreeNode<K,V> y)
Combine two trees into a new tree.Methods in org.jheaps.tree with parameters of type BinaryTreeSoftAddressableHeap.TreeNode Modifier and Type Method Description private BinaryTreeSoftAddressableHeap.TreeNode<K,V>
BinaryTreeSoftAddressableHeap. combine(BinaryTreeSoftAddressableHeap.TreeNode<K,V> x, BinaryTreeSoftAddressableHeap.TreeNode<K,V> y)
Combine two trees into a new tree.private void
BinaryTreeSoftAddressableHeap. sift(BinaryTreeSoftAddressableHeap.TreeNode<K,V> x)
Sift elements from children nodes until the current node has enough elements in its list.Constructors in org.jheaps.tree with parameters of type BinaryTreeSoftAddressableHeap.TreeNode Constructor Description RootListNode(BinaryTreeSoftAddressableHeap.TreeNode<K,V> tree)
-