refined-containers 0.1.0.1 → 0.1.0.2

raw patch · 7 files changed

+32/−15 lines, 7 filesdep ~basedep ~hashablePVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base, hashable

API changes (from Hackage documentation)

Files

• refined-containers.cabal +6/−4
• src/Data/HashMap/Common/Refined.hs +1/−1
• src/Data/HashSet/Refined.hs +9/−4
• src/Data/IntMap/Common/Refined.hs +1/−1
• src/Data/IntSet/Refined.hs +8/−3
• src/Data/Map/Common/Refined.hs +1/−1
• src/Data/Set/Refined.hs +6/−1

@@ -23,11 +23,13 @@ license-file: LICENSE author: mniip@typeable.io maintainer: mniip@typeable.io-version: 0.1.0.1+version: 0.1.0.2 build-type: Simple  tested-with:-    , GHC == 9.6.3+    , GHC == 9.10.1+    , GHC == 9.8.2+    , GHC == 9.6.6     , GHC == 9.4.8     , GHC == 9.2.8     , GHC == 9.0.2@@ -40,13 +42,13 @@  library     build-depends:-        , base >= 4.12 && < 4.20+        , base >= 4.12 && < 4.21         , adjunctions >= 4.4 && < 4.5         , constraints >= 0.11 && < 0.15         , containers >= 0.5.7 && < 0.8         , deepseq >= 1.4 && < 1.6         , distributive >= 0.5.3 && < 0.7-        , hashable >= 1.2.7 && < 1.5+        , hashable >= 1.2.7 && < 1.6         , indexed-traversable >= 0.1 && < 0.2         , mtl >= 2.2.2 && < 2.4         , refined >= 0.5 && < 0.9

@@ -382,7 +382,7 @@   itraverse = traverseWithKey  -- | Similar to the instance for functions -- zip corresponding keys. To use--- '<*>'/'liftA2' without 'KnownSet' see 'zipWithKey'.+-- '<*>'/'Control.Applicative.liftA2' without 'KnownSet' see 'zipWithKey'. instance (Hashable k, KnownHashSet s k) => Applicative (HashMap s k) where   pure x = fromSet \_ -> x   (<*>) = zipWithKey (const id)

@@ -102,7 +102,12 @@ import           Data.Type.Equality ((:~:)(..)) import           Data.Typeable (Typeable) import           GHC.Exts (Proxy#, proxy#)-import           Prelude hiding (filter, foldl, foldMap, foldr, map, null)+import           Prelude hiding+  ( filter, foldl, foldMap, foldr, map, null+#if MIN_VERSION_base(4, 20, 0)+  , foldl'+#endif+  ) import           Refined import           Refined.Unsafe import           Unsafe.Coerce@@ -112,9 +117,9 @@ -- need to pattern match on this 'Dict'. -- -- The reason is that in the default /fast/ implementation of reflection, we--- don't have @'Typeable' s@, which "Refined" wants for pretty-printing--- exceptions. We /can/ provide @'Typeable' s@, but at the cost of using the--- /slow/ implementation of reflection.+-- don't have @'Data.Typeable.Typeable' s@, which "Refined" wants for+-- pretty-printing exceptions. We /can/ provide @'Data.Typeable.Typeable' s@,+-- but at the cost of using the /slow/ implementation of reflection. revealPredicate   :: forall s a. (Typeable a, Hashable a, KnownHashSet s a)   => Dict (Predicate (InSet 'Hashed s) a)

@@ -479,7 +479,7 @@   itraverse = traverseWithKey  -- | Similar to the instance for functions -- zip corresponding keys. To use--- '<*>'/'liftA2' without 'KnownIntSet' see 'zipWithKey'.+-- '<*>'/'Control.Applicative.liftA2' without 'KnownIntSet' see 'zipWithKey'. instance  KnownIntSet s => Applicative (IntMap s) where   pure x = fromSet \_ -> x   (<*>) = zipWithKey (const id)

@@ -103,7 +103,12 @@ import           Data.Type.Coercion import           Data.Type.Equality ((:~:)(..)) import           GHC.Exts (Proxy#, proxy#)-import           Prelude hiding (filter, foldl, foldMap, foldr, map, null)+import           Prelude hiding+  ( filter, foldl, foldMap, foldr, map, null+#if MIN_VERSION_base(4, 20, 0)+  , foldl'+#endif+  ) import           Refined import           Refined.Unsafe import           Unsafe.Coerce@@ -119,8 +124,8 @@ -- -- The reason is that in the default /fast/ implementation of reflection, we -- don't have @'Data.Typeable.Typeable' s@, which "Refined" wants for--- pretty-printing exceptions. We /can/ provide @'Data.TypeableTypeable' s@, but--- at the cost of using the /slow/ implementation of reflection.+-- pretty-printing exceptions. We /can/ provide @'Data.Typeable.Typeable' s@,+-- but at the cost of using the /slow/ implementation of reflection. revealPredicate   :: forall s. KnownIntSet s => Dict (Predicate (InSet 'Int s) Int) revealPredicate = reifyTypeable (reflect (Proxy @s))

@@ -470,7 +470,7 @@   itraverse = traverseWithKey  -- | Similar to the instance for functions -- zip corresponding keys. To use--- '<*>'/'liftA2' without 'KnownSet' see 'zipWithKey'.+-- '<*>'/'Control.Applicative.liftA2' without 'KnownSet' see 'zipWithKey'. instance (Ord k, KnownSet s k) => Applicative (Map s k) where   pure x = fromSet \_ -> x   (<*>) = zipWithKey (const id)

@@ -117,7 +117,12 @@ import           Data.Type.Equality ((:~:)(..)) import           Data.Typeable (Typeable) import           GHC.Exts (Proxy#, proxy#)-import           Prelude hiding (filter, foldl, foldMap, foldr, map, null)+import           Prelude hiding+  ( filter, foldl, foldMap, foldr, map, null+#if MIN_VERSION_base(4, 20, 0)+  , foldl'+#endif+  ) import           Refined import           Refined.Unsafe import           Unsafe.Coerce