Package0.4.1Data Structures
heaps
Asymptotically optimal Brodal/Okasaki heaps.
- Version0.4.1
- CategoryData Structures
- LicenceBSD-3-Clause
- AuthorEdward A. Kmett
- MaintainerEdward A. Kmett <ekmett@gmail.com>
- Homepagegithub.com/ekmett/heaps
- Pinned byhackage heaps 0.4.1
- Sourcehackage.haskell.org/package/heaps-0.4.1
Modules
- Data.HeapAn efficient, asymptotically optimal, implementation of a priority queues
Description
Asymptotically optimal Brodal/Okasaki bootstrapped skew-binomial heaps from the paper "Optimal Purely Functional Priority Queues", extended with a Foldable interface.
Depends on
1 package- base-4.23.0.0with GHC