Added contributors list
Updated copyright year
Accepted patch from Daniel Lyons
Added QuickCheck v2.1 build dependency
Converted from QuickCheck v1 to v2
Added QuickCheck dependency
purged email address from license
Added entry for PairingHeaps
Added tests for PairingHeaps
First draft implementation of pairing heaps
Better error messages
Basic quickcheck tests.
Added runtime stubs to AVL tree
Brought licensing information into agreement with itself -- BSD3
Changed .cabal to reflect repository location
Fixed warnings due to superfluous pattern matching in Binary and Splay.
Repaired non-exhaustive pattern matching in AVL.
Added type signature for `fromAscList` and `toList`
License file changed to reflect the Cabal file --> simplified BSD to …
Changed definition of fromList (get rid of ugly lambda). Fixed heap
comparison inside merge for Heap.Binary.
Flip args in insert for Data.Skew. Important cause now compilation
Strictness annotations for Binomial Heap.
Fixed a bug in `lookup`. Looking left when you should be looking right.
Made binary heap descendant counting strict.
Made AVL balance book keeping variables strict.
Added toAscList/fromAscList to AVL.
Added a slow implementation of toList for AVL trees.
Modified the heap interfaces such that insert is: a -> Heap -> Heap
Modified Splay interface to conform to Data.Map
Restructured the interface of AVL trees to conform to Data.Map. (I hope)
Remove actually works. Simplified some code. I still need 'toList' and 'toAscList' and so forth.
Two hours to Geneva. 48 minutes of battery left.
Fixed AVL insertion misbalancing.
Fixed BinomialHeap construction to be faster.
Added lies (AVLTree support) to .cabal
Fixed AVL `insert` following generalization of balance operations.
Silly branch merge.