EdisonCore

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

http://rwd.rdockins.name/edison/home/

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

See all snapshots EdisonCore appears in

MIT licensed by Chris Okasaki
Maintained by robdockins AT fastmail DOT fm
This version can be pinned in stack with:EdisonCore-1.3.2.1@sha256:9681809e8389320ee9389f480b7d2104a7e0f895ee8cdb016778310c86b04759,2426

Module documentation for 1.3.2.1

  • Data
    • Data.Edison
      • Data.Edison.Assoc
        • Data.Edison.Assoc.AssocList
        • Data.Edison.Assoc.Defaults
        • Data.Edison.Assoc.PatriciaLoMap
        • Data.Edison.Assoc.StandardMap
        • Data.Edison.Assoc.TernaryTrie
      • Data.Edison.Coll
        • Data.Edison.Coll.Defaults
        • Data.Edison.Coll.EnumSet
        • 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.UnbalancedSet
      • Data.Edison.Concrete
        • Data.Edison.Concrete.FingerTree
      • Data.Edison.Seq
        • Data.Edison.Seq.BankersQueue
        • Data.Edison.Seq.BinaryRandList
        • Data.Edison.Seq.BraunSeq
        • Data.Edison.Seq.Defaults
        • 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
Used by 1 package in nightly-2018-08-01(full list with versions):
Agda

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.