EdisonAPI: A library of efficent, purely-functional data structures (API)
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 (Efficent 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.
- EdisonAPI-1.2.2.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees
|Versions [RSS]||1.2.1, 1.2.2, 184.108.40.206, 1.3, 1.3.1, 1.3.3|
|Dependencies||base (>=2.0 && <4.13), mtl (>=1.0) [details]|
|Maintainer||robdockins AT fastmail DOT fm|
|Revised||Revision 1 made by AndreasAbel at 2022-04-28T10:17:08Z|
|Uploaded||by RobertDockins at 2013-01-23T02:13:37Z|
|Reverse Dependencies||5 direct, 8 indirect [details]|
|Downloads||16927 total (19 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]