Index

*	TypeLevel.Singletons
*.	TypeLevel.Singletons
+
1 (Type/Class)	TypeLevel.Singletons
2 (Type/Class)	TypeLevel.Nat
+.	TypeLevel.Singletons
-.	TypeLevel.Singletons
:-
1 (Data Constructor)	TypeLevel.Singletons
2 (Data Constructor)	Data.Queue.Indexed.List
3 (Data Constructor)	Data.Queue.Indexed.Binomial
4 (Data Constructor)	Data.Queue.Binomial
:<
1 (Data Constructor)	Data.Queue.Indexed.Binomial
2 (Data Constructor)	Data.Queue.Binomial
<=	TypeLevel.Singletons
<=.	TypeLevel.Singletons
Binomial
1 (Type/Class)	Data.Queue.Indexed.Binomial
2 (Type/Class)	Data.Queue.Binomial
Braun
1 (Type/Class)	Data.Queue.Indexed.Braun
2 (Type/Class)	Data.Queue.Braun
3 (Data Constructor)	Data.Queue.Braun
cmpQueue	Data.Queue.Class
DiffList
1 (Type/Class)	Data.Queue.Indexed.List
2 (Data Constructor)	Data.Queue.Indexed.List
drawBinaryTree	Data.BinaryTree
E
1 (Data Constructor)	Data.Queue.Indexed.Pairing
2 (Data Constructor)	Data.Queue.Pairing
Empty	Data.Queue.Indexed.Skew
empty
1 (Function)	Data.Queue.Indexed.Class
2 (Function)	Data.Queue.Class
eqQueue	Data.Queue.Class
ErasedSize
1 (Type/Class)	Data.Queue.Indexed.Erased
2 (Data Constructor)	Data.Queue.Indexed.Erased
Even	Data.Queue.Indexed.Braun
Falsy	TypeLevel.Singletons
foldTree	Data.BinaryTree
fromFoldable	Data.Queue.Class
fromList	Data.Queue.Class
HCons	Data.Queue.Indexed.Pairing
heapSort	Data.Queue.Class
HNil	Data.Queue.Indexed.Pairing
HVec	Data.Queue.Indexed.Pairing
IfThenElse	TypeLevel.Bool
ifThenElse	TypeLevel.Bool
IndexedQueue	Data.Queue.Indexed.Class
insert
1 (Function)	Data.Queue.Indexed.Class
2 (Function)	Data.Queue.Class
isHeap	Data.BinaryTree
KnownSing	TypeLevel.Singletons
Leaf
1 (Data Constructor)	Data.Queue.Indexed.Leftist
2 (Data Constructor)	Data.Queue.Indexed.Splay
3 (Data Constructor)	Data.Queue.Indexed.Braun
4 (Data Constructor)	Data.Queue.Leftist
5 (Data Constructor)	Data.BinaryTree
Lean	Data.Queue.Indexed.Braun
Leftist
1 (Type/Class)	Data.Queue.Indexed.Leftist
2 (Type/Class)	Data.Queue.Leftist
liftParts	Data.Traversable.Parts
List	Data.Queue.Indexed.List
MeldableIndexedQueue	Data.Queue.Indexed.Class
MeldableQueue	Data.Queue.Class
merge
1 (Function)	Data.Queue.Indexed.Class
2 (Function)	Data.Queue.Class
minView
1 (Function)	Data.Queue.Indexed.Class
2 (Function)	Data.Queue.Class
minViewMay	Data.Queue.Indexed.Class
Nat
1 (Type/Class)	TypeLevel.Singletons
2 (Type/Class)	TypeLevel.Nat
Nil
1 (Data Constructor)	Data.Queue.Indexed.List
2 (Data Constructor)	Data.Queue.Indexed.Binomial
3 (Data Constructor)	Data.Queue.Binomial
NilN
1 (Data Constructor)	Data.Queue.Indexed.Binomial
2 (Data Constructor)	Data.Queue.Binomial
Nily	TypeLevel.Singletons
Node
1 (Data Constructor)	Data.Queue.Indexed.Leftist
2 (Data Constructor)	Data.Queue.Indexed.Skew
3 (Data Constructor)	Data.Queue.Indexed.Splay
4 (Data Constructor)	Data.Queue.Indexed.Braun
5 (Type/Class)	Data.Queue.Indexed.Binomial
6 (Data Constructor)	Data.Queue.Leftist
7 (Type/Class)	Data.Queue.Binomial
8 (Data Constructor)	Data.BinaryTree
Offset	Data.Queue.Indexed.Braun
Pairing
1 (Type/Class)	Data.Queue.Indexed.Pairing
2 (Type/Class)	Data.Queue.Pairing
Parts
1 (Type/Class)	Data.Traversable.Parts
2 (Data Constructor)	Data.Traversable.Parts
plusAssoc	TypeLevel.Nat.Proofs
plusSuccDistrib	TypeLevel.Nat.Proofs
plusZeroNeutral	TypeLevel.Nat.Proofs
Queue	Data.Queue.Class
queueTraversable	Data.Traversable.Parts
queueTraversal	Data.Traversable.Parts
readPrecQueue	Data.Queue.Class
replicateA
1 (Function)	Data.Tree.Replicate
2 (Function)	Data.BinaryTree
replicateTree
1 (Function)	Data.Tree.Replicate
2 (Function)	Data.BinaryTree
reverseTraversable	Data.Queue.Indexed.List
reverseTraversal	Data.Queue.Indexed.List
Root
1 (Data Constructor)	Data.Queue.Indexed.Binomial
2 (Data Constructor)	Data.Queue.Binomial
runBraun	Data.Queue.Braun
runDiffList	Data.Queue.Indexed.List
runErasedSize	Data.Queue.Indexed.Erased
runParts	Data.Traversable.Parts
runPartsWith	Data.Traversable.Parts
runSkew	Data.Queue.Skew
runSplay	Data.Queue.Splay
S	TypeLevel.Nat
showsPrecQueue	Data.Queue.Class
sing	TypeLevel.Singletons
singleton
1 (Function)	Data.Queue.Indexed.Class
2 (Function)	Data.Queue.Class
Skew
1 (Type/Class)	Data.Queue.Indexed.Skew
2 (Type/Class)	Data.Queue.Skew
3 (Data Constructor)	Data.Queue.Skew
Skip
1 (Data Constructor)	Data.Queue.Indexed.Binomial
2 (Data Constructor)	Data.Queue.Binomial
Splay
1 (Type/Class)	Data.Queue.Indexed.Splay
2 (Type/Class)	Data.Queue.Splay
3 (Data Constructor)	Data.Queue.Splay
Sy	TypeLevel.Nat
T
1 (Data Constructor)	Data.Queue.Indexed.Pairing
2 (Data Constructor)	Data.Queue.Pairing
The	TypeLevel.Singletons, TypeLevel.Nat
toList	Data.Queue.Class
totalOrder	TypeLevel.Singletons
transformTraversable	Data.Traversable.Parts
transformTraversal	Data.Traversable.Parts
Tree
1 (Type/Class)	Data.Queue.Indexed.Binomial
2 (Type/Class)	Data.Queue.Binomial
3 (Type/Class)	Data.BinaryTree
treeFromList	Data.BinaryTree
Truey	TypeLevel.Singletons
unfoldTree	Data.BinaryTree
WithDict
1 (Type/Class)	Data.Queue.WithDict
2 (Data Constructor)	Data.Queue.WithDict
Z	TypeLevel.Nat
Zy	TypeLevel.Nat
zygoLeftist	Data.Queue.Leftist
zygoTree	Data.BinaryTree
^	TypeLevel.Singletons
^.	TypeLevel.Singletons