Uses of Class
org.jheaps.tree.CostlessMeldPairingHeap.Node

Packages that use CostlessMeldPairingHeap.Node

Package	Description
org.jheaps.tree	Heaps using an explicit "pointer-based" tree representation

Uses of CostlessMeldPairingHeap.Node in org.jheaps.tree

Fields in org.jheaps.tree declared as CostlessMeldPairingHeap.Node

Modifier and Type	Field	Description
private CostlessMeldPairingHeap.Node<K,V>[]	CostlessMeldPairingHeap.decreasePool	The decrease pool
(package private) CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.Node.o_c
(package private) CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.Node.o_s
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.root	The root of the pairing heap
(package private) CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.Node.y_s

Fields in org.jheaps.tree with type parameters of type CostlessMeldPairingHeap.Node

Modifier and Type	Field	Description
private java.util.Comparator<CostlessMeldPairingHeap.Node<K,V>>	CostlessMeldPairingHeap.decreasePoolComparator	Comparator for nodes in the decrease pool.

Methods in org.jheaps.tree that return CostlessMeldPairingHeap.Node

Modifier and Type	Method	Description
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.combine(CostlessMeldPairingHeap.Node<K,V> l)	Two pass pair and compute root.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.cutChildren(CostlessMeldPairingHeap.Node<K,V> n)	Cut the children of a node and return the list.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.cutOldestChild(CostlessMeldPairingHeap.Node<K,V> n)	Cut the oldest child of a node.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.link(CostlessMeldPairingHeap.Node<K,V> f, CostlessMeldPairingHeap.Node<K,V> s)
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.linkWithComparator(CostlessMeldPairingHeap.Node<K,V> f, CostlessMeldPairingHeap.Node<K,V> s)

Methods in org.jheaps.tree with parameters of type CostlessMeldPairingHeap.Node

Modifier and Type	Method	Description
private void	CostlessMeldPairingHeap.addPool(CostlessMeldPairingHeap.Node<K,V> n, boolean updateMinimum)	Append to decrease pool.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.combine(CostlessMeldPairingHeap.Node<K,V> l)	Two pass pair and compute root.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.cutChildren(CostlessMeldPairingHeap.Node<K,V> n)	Cut the children of a node and return the list.
private void	CostlessMeldPairingHeap.cutFromParent(CostlessMeldPairingHeap.Node<K,V> n)	Cut a node from its parent.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.cutOldestChild(CostlessMeldPairingHeap.Node<K,V> n)	Cut the oldest child of a node.
private void	CostlessMeldPairingHeap.decreaseKey(CostlessMeldPairingHeap.Node<K,V> n, K newKey)
private void	CostlessMeldPairingHeap.delete(CostlessMeldPairingHeap.Node<K,V> n)	Delete a node.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.link(CostlessMeldPairingHeap.Node<K,V> f, CostlessMeldPairingHeap.Node<K,V> s)
private void	CostlessMeldPairingHeap.linkInPlace(CostlessMeldPairingHeap.Node<K,V> orphan, CostlessMeldPairingHeap.Node<K,V> n)	Put an orphan node into the position of another node.
private CostlessMeldPairingHeap.Node<K,V>	CostlessMeldPairingHeap.linkWithComparator(CostlessMeldPairingHeap.Node<K,V> f, CostlessMeldPairingHeap.Node<K,V> s)