The code here is a Scala implementation of data structures and solutions to exercises from the great book "Purely Functional Data Structures" by Chris Okasaki.
We'll track progress against an expanded version of Haskell code ToC (App. A):
- Queues
- Batched
- Banker's
- Physicist's
- Real-time
- Hood-Melville
- Bootstrapped
- Implicit
- Deques
- Batched
- Banker's
- Real-time
- Catenable Lists
- Bootstrapped
- Catenable Deques
- Simple
- Implicit
- Random-Access Lists
- Binary
- Zeroless Binary
- Redundant Zeroless Binary
- Skew Binary
- Binary (alternative)
- Heaps
- Leftist
- Weight-Biased Leftist
- Binomial
- Splay
- Pairing
- Lazy Pairing
- Scheduled Binomial
- Segmented Binomial
- Skew Binomial
- Bootstrapped
- Sortable Collections
- Bottom-up Mergesort
- Sets
- Unbalanced
- Red-Black
- Finite Maps
- Trie
- Trie of Trees