The EdisonCore package (version 1.2.1)
This package provides the core Edison data structure implementations,
including multiple sequence, set, bag, and finite map concrete
implementations with various performance characteristics. The
implementations in this package have no dependencies other than
those commonly bundled with Haskell compilers.
| Other versions | 1.2.1.1, 1.2.1.2 |
|---|
| Dependencies | base (>=1.0), EdisonAPI (==1.2.1), haskell98 (>=1.0), mtl (>=1.0), QuickCheck (==1.0) |
|---|
| License | OtherLicense |
|---|
| Author | Chris Okasaki |
|---|
| Maintainer | robdockins AT fastmail DOT fm |
|---|
| Stability | stable |
|---|
| Category | Data Structures |
|---|
| Exposed modules | Data.Edison.Assoc.Defaults, Data.Edison.Assoc.AssocList, Data.Edison.Assoc.PatriciaLoMap, Data.Edison.Assoc.StandardMap, Data.Edison.Assoc.TernaryTrie, Data.Edison.Concrete.FingerTree, Data.Edison.Coll.Defaults, Data.Edison.Coll.LazyPairingHeap, Data.Edison.Coll.LeftistHeap, Data.Edison.Coll.MinHeap, Data.Edison.Coll.SkewHeap, Data.Edison.Coll.SplayHeap, Data.Edison.Coll.StandardSet, Data.Edison.Coll.EnumSet, Data.Edison.Coll.UnbalancedSet, Data.Edison.Seq.Defaults, Data.Edison.Seq.BankersQueue, Data.Edison.Seq.BinaryRandList, Data.Edison.Seq.BraunSeq, Data.Edison.Seq.FingerSeq, Data.Edison.Seq.JoinList, Data.Edison.Seq.MyersStack, Data.Edison.Seq.RandList, Data.Edison.Seq.RevSeq, Data.Edison.Seq.SimpleQueue, Data.Edison.Seq.SizedSeq |
|---|
| Upload date | Mon Feb 19 20:17:38 PST 2007 |
|---|
| Uploaded by | RobertDockins |
|---|
| Built on | ghc-6.6 |
|---|
Downloads
