EdisonAPI 1.3.3 → 1.3.3.1

raw patch · 4 files changed

+7/−8 lines, 4 filesdep −mtldep ~basenew-uploaderPVP ok

version bump matches the API change (PVP)

Dependencies removed: mtl

Dependency ranges changed: base

API changes (from Hackage documentation)

Files

• EdisonAPI.cabal +2/−3
• src/Data/Edison/Assoc.hs +1/−1
• src/Data/Edison/Coll.hs +3/−3
• src/Data/Edison/Seq.hs +1/−1

@@ -1,7 +1,7 @@ Build-type:     Simple Name:           EdisonAPI Cabal-Version:  >= 1.10-Version:        1.3.3+Version:        1.3.3.1 License:        MIT License-File:   COPYRIGHT Author:         Chris Okasaki@@ -38,8 +38,7 @@      Data.Edison.Seq      Data.Edison.Seq.ListSeq   Build-Depends:-     base == 4.*,-     mtl >= 1.0+     base == 4.*   if impl(ghc < 8.0)     build-depends: fail   Default-Language: Haskell2010

@@ -44,7 +44,7 @@     FiniteMap(..),     OrdFiniteMap, -    -- * Specilizations of submap operations+    -- * Specializations of submap operations     submap,     properSubmap,     sameMap,

@@ -105,7 +105,7 @@ import Data.Edison.Seq.ListSeq()  --- | The empty collection.  Equivalant to @mempty@ from+-- | The empty collection.  Equivalent to @mempty@ from --   the @Monoid@ instance. -- --   This function is always /unambiguous/.@@ -113,7 +113,7 @@ empty = mempty  -- | Merge two collections.  For sets, it is unspecified which element is---   kept in the case of duplicates.  Equivalant to @mappend@ from the+--   kept in the case of duplicates.  Equivalent to @mappend@ from the --   @Monoid@ instance. -- --   This function is /ambiguous/ at set types if the sets are not disjoint.@@ -216,7 +216,7 @@   --   datastructure is infinite in size or contains exceptions or non-termination   --   in the structure itself, then @strict@ will result in bottom.  Operationally,   --   this function walks the datastructure forcing any closures.  In many-  --   collections, the collction \"shape\" depends on the value of the elemnts;+  --   collections, the collction \"shape\" depends on the value of the elements;   --   in such cases, the values of the elements will be forced to the extent   --   necessary to force the structure of the collection, but no further.   --

@@ -1251,7 +1251,7 @@   --   --   This function is always /unambiguous/.   ---  --   Default running time: unbounded (forcing element closures can take arbitrairly long)+  --   Default running time: unbounded (forcing element closures can take arbitrarily long)   strictWith :: (a -> b) -> s a -> s a    -- | A method to facilitate unit testing.  Returns 'True' if the structural