EdisonCore-1.3.1.1: A library of efficent, purely-functional data structures (Core Implementations)

# EdisonCore-1.3.1.1: A library of efficent, purely-functional data structures (Core Implementations)

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.

Modules

- Data
  - Edison
    - Assoc
      - Data.Edison.Assoc.AssocList
      - Data.Edison.Assoc.Defaults
      - Data.Edison.Assoc.PatriciaLoMap
      - Data.Edison.Assoc.StandardMap
      - Data.Edison.Assoc.TernaryTrie
    - 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
    - Concrete
      - Data.Edison.Concrete.FingerTree
    - 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