llrbtree-0.1.1: Purely functional sets and heaps

Index

=== 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
B 
1 (Data Constructor)Data.Set.LLRBTree
2 (Data Constructor)Data.Set.RBTree
BlackHeight 
1 (Type/Class)Data.Set.LLRBTree
2 (Type/Class)Data.Set.RBTree
Color 
1 (Type/Class)Data.Set.LLRBTree
2 (Type/Class)Data.Set.RBTree
delete 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.WBTree
4 (Function)Data.Set.LLRBTree
5 (Function)Data.Set.RBTree
deleteMax 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.WBTree
4 (Function)Data.Set.LLRBTree
5 (Function)Data.Set.RBTree
deleteMin 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
difference 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.WBTree
4 (Function)Data.Set.LLRBTree
5 (Function)Data.Set.RBTree
empty 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
fromList 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
Heap 
1 (Type/Class)Data.Heap.Binominal
2 (Data Constructor)Data.Heap.Binominal
3 (Type/Class)Data.Heap.Splay
heapSort 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
insert 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
intersection 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.WBTree
4 (Function)Data.Set.LLRBTree
5 (Function)Data.Set.RBTree
join 
1 (Function)Data.Set.WBTree
2 (Function)Data.Set.LLRBTree
3 (Function)Data.Set.RBTree
Leaf 
1 (Data Constructor)Data.Heap.Splay
2 (Data Constructor)Data.Heap.Leftist
3 (Data Constructor)Data.Heap.Skew
4 (Data Constructor)Data.Set.BUSplay
5 (Data Constructor)Data.Set.Splay
6 (Data Constructor)Data.Set.WBTree
7 (Data Constructor)Data.Set.LLRBTree
8 (Data Constructor)Data.Set.RBTree
LeftistData.Heap.Leftist
maximum 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.WBTree
4 (Function)Data.Set.LLRBTree
5 (Function)Data.Set.RBTree
member 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.WBTree
4 (Function)Data.Set.LLRBTree
5 (Function)Data.Set.RBTree
merge 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.WBTree
6 (Function)Data.Set.LLRBTree
7 (Function)Data.Set.RBTree
minimum 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
Node 
1 (Data Constructor)Data.Heap.Binominal
2 (Data Constructor)Data.Heap.Splay
3 (Data Constructor)Data.Heap.Leftist
4 (Data Constructor)Data.Heap.Skew
5 (Data Constructor)Data.Set.BUSplay
6 (Data Constructor)Data.Set.Splay
7 (Data Constructor)Data.Set.WBTree
8 (Data Constructor)Data.Set.LLRBTree
9 (Data Constructor)Data.Set.RBTree
NoneData.Heap.Splay
null 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
partitionData.Heap.Splay
printHeapData.Heap.Splay
printSet 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.LLRBTree
4 (Function)Data.Set.RBTree
R 
1 (Data Constructor)Data.Set.LLRBTree
2 (Data Constructor)Data.Set.RBTree
Rank 
1 (Type/Class)Data.Heap.Binominal
2 (Type/Class)Data.Heap.Leftist
RBTree 
1 (Type/Class)Data.Set.LLRBTree
2 (Type/Class)Data.Set.RBTree
showHeapData.Heap.Splay
showSet 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.LLRBTree
4 (Function)Data.Set.RBTree
singleton 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
SizeData.Set.WBTree
sizeData.Set.WBTree
SkewData.Heap.Skew
SomeData.Heap.Splay
Splay 
1 (Type/Class)Data.Heap.Splay
2 (Type/Class)Data.Set.BUSplay
3 (Type/Class)Data.Set.Splay
split 
1 (Function)Data.Set.Splay
2 (Function)Data.Set.WBTree
3 (Function)Data.Set.LLRBTree
4 (Function)Data.Set.RBTree
toList 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
TreeData.Heap.Binominal
union 
1 (Function)Data.Set.BUSplay
2 (Function)Data.Set.Splay
3 (Function)Data.Set.WBTree
4 (Function)Data.Set.LLRBTree
5 (Function)Data.Set.RBTree
valid 
1 (Function)Data.Heap.Binominal
2 (Function)Data.Heap.Splay
3 (Function)Data.Heap.Leftist
4 (Function)Data.Heap.Skew
5 (Function)Data.Set.BUSplay
6 (Function)Data.Set.Splay
7 (Function)Data.Set.WBTree
8 (Function)Data.Set.LLRBTree
9 (Function)Data.Set.RBTree
WBTreeData.Set.WBTree