A library of efficient, purely-functional data structures (API) http://rwd.rdockins.name/edison/home/

Version on this page:1.3.1
Stackage Nightly 2017-07-25:1.3.1
LTS Haskell 9.1:1.3.1
Stackage Nightly 2017-07-25:1.3.1
Latest on Hackage:1.3.1
MIT licensed by Chris Okasaki
Maintained by robdockins AT fastmail DOT fm

Edison is a library of purely functional data structures written by Chris Okasaki. It is named after Thomas Alva Edison and for the mnemonic value EDiSon (Efficient Data Structures). Edison provides several families of abstractions, each with multiple implementations. The main abstractions provided by Edison are: Sequences such as stacks, queues, and dequeues; Collections such as sets, bags and heaps; and Associative Collections such as finite maps and priority queues where the priority and element are distinct.

Depends on:
comments powered byDisqus