creditmonad-1.0.0: Reasoning about amortized time complexity

Index - L

lastTest.Credit.Finger
Lazy 
1 (Type/Class)Control.Monad.Credit
2 (Data Constructor)Control.Monad.Credit
lazymatchControl.Monad.Credit
LazyPairingTest.Credit.Heap.LazyPairing
lazyqueueTest.Credit.Queue.Bankers
Leaf 
1 (Data Constructor)Test.Credit.RandomAccess.Binary
2 (Data Constructor)Test.Credit.RandomAccess.Zeroless
lenf 
1 (Function)Test.Credit.Deque.Realtime
2 (Function)Test.Credit.Deque.Bankers
lenfmTest.Credit.Queue.Bootstrapped
lengthTest.Credit.Finger
lenr 
1 (Function)Test.Credit.Deque.Realtime
2 (Function)Test.Credit.Deque.Bankers
3 (Function)Test.Credit.Queue.Bootstrapped
linearTest.Credit
linearizeControl.Monad.Credit
LinkTest.Credit.Heap.LazyPairing
link 
1 (Function)Test.Credit.Heap.Binomial
2 (Function)Test.Credit.Heap.LazyPairing
3 (Function)Test.Credit.Heap.Pairing
4 (Function)Test.Credit.Heap.Scheduled
5 (Function)Test.Credit.Deque.Catenable
6 (Function)Test.Credit.RandomAccess.Binary
7 (Function)Test.Credit.RandomAccess.Zeroless
LinkAllTest.Credit.Deque.Catenable
linkAllTest.Credit.Deque.Catenable
log2Test.Credit
logstarTest.Credit
LookupTest.Credit.RandomAccess.Base
lookupTest.Credit.RandomAccess.Base
lookupTree 
1 (Function)Test.Credit.RandomAccess.Binary
2 (Function)Test.Credit.RandomAccess.Zeroless
3 (Function)Test.Credit.Finger