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.

Changes

Changes in 1.3.2.1 * Fix compile problems on GHC 7.10

Changes in 1.3.2 * Add Semigroup instances for all types that previously had Monoid instances. * Remove use of depreciated functions in Data.Edison.Assoc.StandardMap

Changes in 1.3.1 * Remove Arbitrary and Coarbitrary instances for Data.Set and Data.Map. These are now provided by QuickCheck >= 2.8.2

Changes in 1.2.1.3 * Minor fix to the StandardMap module to handle the API change in GHC 6.10

Changes in 1.2.1.2 * Build system changes to remove mostly-superfulous dependency on haskell98, and to force dependence on the 1.x branch of QuickCheck.

Changes in 1.2.1.1 * Build system changes to make GHC 6.8 and cabal >= 1.2.2 happy

Changes in 1.2.1 * New sequence implementation based on Finger Trees * Add the 'Measured' class to the Data.Edison.Prelude * Addition of methods to EnumSet to project to a bit-encoded word and to create an EnumSet from a bit-encoded word * Additional minor changes to EnumSet * Fix a boneheaded mistake I made where I claimed most of Edison was licensed under BSD3, when it is in fact licensed under the MIT license. The practical differences are minor, and I hope this will not cause too many problems.

Changes in 1.2.0.1 * Change use more efficient operations for StandardSet.{filterGT,filterLT} and StandardMap.{filterLE,filterGE,partitionLE_GT,partitionLT_GE}

Changes in 1.2 final * Fix documentation for sequences to reflect correct time complexities