Uses of Class org.drip.graph.softheap.KaplanZwickTree

Packages that use KaplanZwickTree
Package	Description
org.drip.graph.softheap	Soft Heap - Approximate Priority Queue

Uses of KaplanZwickTree in org.drip.graph.softheap

Methods in org.drip.graph.softheap that return KaplanZwickTree
Modifier and Type	Method	Description
`static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickTree<KEY,ITEM>`	KaplanZwickTree.`EquiRankTreeMerge(KaplanZwickTree<KEY,ITEM> tree1, KaplanZwickTree<KEY,ITEM> tree2)`	Merge Two Trees with Identical Ranks
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickPriorityQueue.`head()`	Retrieve the Head of the List of Trees
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickTreeMelder.`head()`	Retrieve the Head of the Melded Tree
`static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickTree<KEY,ITEM>`	KaplanZwickTree.`Initial(boolean minHeap, int r, PriorityQueueEntry<KEY,ITEM> entry)`	Construct an Initial Tree with a single Entry
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickTree.`next()`	Retrieve the Next Tree in the List
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickTree.`prev()`	Retrieve the Previous Tree in the List
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickTree.`rootTree()`	Generate a Stand-alone Tree with the Root Node alone in its List
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickTree.`suffixExtremum()`	Retrieve the Extremum ckey Tree among those following this in the List
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickPriorityQueue.`tail()`	Retrieve the Tail of the List of Trees
`KaplanZwickTree<KEY,ITEM>`	KaplanZwickTreeMelder.`tail()`	Retrieve the Tail of the Melded Tree

Methods in org.drip.graph.softheap with parameters of type KaplanZwickTree
Modifier and Type	Method	Description
`boolean`	KaplanZwickTreeMelder.`appendToTail(KaplanZwickTree<KEY,ITEM> tail)`	Append to the Tail using the New Tail
`static <KEY extends java.lang.Comparable<KEY>, ITEM> KaplanZwickTree<KEY,ITEM>`	KaplanZwickTree.`EquiRankTreeMerge(KaplanZwickTree<KEY,ITEM> tree1, KaplanZwickTree<KEY,ITEM> tree2)`	Merge Two Trees with Identical Ranks
`boolean`	KaplanZwickTree.`setNext(KaplanZwickTree<KEY,ITEM> next)`	(Re-)set the Next Tree
`boolean`	KaplanZwickTree.`setPrev(KaplanZwickTree<KEY,ITEM> prev)`	(Re-)set the Previous Tree
`boolean`	KaplanZwickTree.`setSuffixExtremum(KaplanZwickTree<KEY,ITEM> suffixExtremum)`	(Re-)set the Suffix Extremum Tree
`static <KEY extends java.lang.Comparable<KEY>, ITEM> boolean`	KaplanZwickTree.`UpdateSuffixExtremum(KaplanZwickTree<KEY,ITEM> tree)`	Update the Suffix Extremum of all Trees at and preceding the specified Tree

Constructors in org.drip.graph.softheap with parameters of type KaplanZwickTree
Constructor	Description
`KaplanZwickPriorityQueue(boolean minHeap, int r, KaplanZwickTree<KEY,ITEM> head, KaplanZwickTree<KEY,ITEM> tail)`	KaplanZwickPriorityQueue Constructor
`KaplanZwickTreeMelder(KaplanZwickTree<KEY,ITEM> mergedTreeList)`	KaplanZwickTreeMelder Constructor