A library of efficient, purely-functional data structures (API)


Version on this page:1.3.1
LTS Haskell 12.26:1.3.1
Stackage Nightly 2018-09-28:1.3.1
Latest on Hackage:

See all snapshots EdisonAPI appears in

MIT licensed by Chris Okasaki
Maintained by robdockins AT fastmail DOT fm
This version can be pinned in stack with:EdisonAPI-1.3.1@sha256:ac4d38682db0448b6f358f32e951a294bc3aa23def164740037bae36566b4f73,1554
Depends on 2 packages(full list with versions):
Used by 1 package in lts-12.26(full list with versions):

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.