packages feed

dependent-map 0.2.3.0 → 0.2.4.0

raw patch · 2 files changed

+7/−1 lines, 2 filesdep +semigroupsdep ~basePVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependencies added: semigroups

Dependency ranges changed: base

API changes (from Hackage documentation)

- Data.Dependent.Map: data DSum k (tag :: k -> *) (f :: k -> *) :: forall k. (k -> *) -> (k -> *) -> *
- Data.Dependent.Map: data GOrdering k (a :: k) (b :: k) :: forall k. k -> k -> *
- Data.Dependent.Map: data Some k (tag :: k -> *) :: forall k. (k -> *) -> *
- Data.Dependent.Map: instance forall k (k1 :: k -> *) (f :: k -> *). (Data.GADT.Compare.GCompare k1, Data.Dependent.Sum.ReadTag k1 f) => GHC.Read.Read (Data.Dependent.Map.Internal.DMap k1 f)
- Data.Dependent.Map: instance forall k (k1 :: k -> *) (f :: k -> *). Data.Dependent.Sum.EqTag k1 f => GHC.Classes.Eq (Data.Dependent.Map.Internal.DMap k1 f)
- Data.Dependent.Map: instance forall k (k1 :: k -> *) (f :: k -> *). Data.Dependent.Sum.OrdTag k1 f => GHC.Classes.Ord (Data.Dependent.Map.Internal.DMap k1 f)
- Data.Dependent.Map: instance forall k (k1 :: k -> *) (f :: k -> *). Data.Dependent.Sum.ShowTag k1 f => GHC.Show.Show (Data.Dependent.Map.Internal.DMap k1 f)
- Data.Dependent.Map: instance forall k (k1 :: k -> *) (f :: k -> *). Data.GADT.Compare.GCompare k1 => GHC.Base.Monoid (Data.Dependent.Map.Internal.DMap k1 f)
+ Data.Dependent.Map: data GOrdering (a :: k) (b :: k) :: forall k. () => k -> k -> *
+ Data.Dependent.Map: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). (Data.GADT.Compare.GCompare k2, Data.Dependent.Sum.ReadTag k2 f) => GHC.Read.Read (Data.Dependent.Map.Internal.DMap k2 f)
+ Data.Dependent.Map: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). Data.Dependent.Sum.EqTag k2 f => GHC.Classes.Eq (Data.Dependent.Map.Internal.DMap k2 f)
+ Data.Dependent.Map: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). Data.Dependent.Sum.OrdTag k2 f => GHC.Classes.Ord (Data.Dependent.Map.Internal.DMap k2 f)
+ Data.Dependent.Map: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). Data.Dependent.Sum.ShowTag k2 f => GHC.Show.Show (Data.Dependent.Map.Internal.DMap k2 f)
+ Data.Dependent.Map: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). Data.GADT.Compare.GCompare k2 => GHC.Base.Monoid (Data.Dependent.Map.Internal.DMap k2 f)
+ Data.Dependent.Map: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). Data.GADT.Compare.GCompare k2 => GHC.Base.Semigroup (Data.Dependent.Map.Internal.DMap k2 f)
- Data.Dependent.Map: [:=>] :: DSum k tag f
+ Data.Dependent.Map: [:=>] :: DSum tag f
- Data.Dependent.Map: [GEQ] :: GOrdering k a a
+ Data.Dependent.Map: [GEQ] :: GOrdering a a
- Data.Dependent.Map: [GGT] :: GOrdering k a b
+ Data.Dependent.Map: [GGT] :: GOrdering a b
- Data.Dependent.Map: [GLT] :: GOrdering k a b
+ Data.Dependent.Map: [GLT] :: GOrdering a b
- Data.Dependent.Map: [This] :: Some k tag
+ Data.Dependent.Map: [This] :: Some tag
- Data.Dependent.Map: class GEq k f => GCompare k (f :: k -> *)
+ Data.Dependent.Map: class GEq f => GCompare (f :: k -> *)
- Data.Dependent.Map: filter :: (a -> Bool) -> [a] -> [a]
+ Data.Dependent.Map: filter :: () => a -> Bool -> [a] -> [a]
- Data.Dependent.Map: gcompare :: f a -> f b -> GOrdering k a b
+ Data.Dependent.Map: gcompare :: GCompare f => f a -> f b -> GOrdering a b

Files

dependent-map.cabal view
@@ -1,5 +1,5 @@ name:                   dependent-map-version:                0.2.3.0+version:                0.2.4.0 stability:              provisional  cabal-version:          >= 1.6@@ -37,6 +37,8 @@                         Data.Dependent.Map.PtrEquality   if impl(ghc < 7.8)     other-modules:      Data.Dependent.Map.Typeable+  if impl(ghc < 8)+    build-depends:      semigroups   build-depends:        base >= 3 && < 5,                         containers,                         dependent-sum >= 0.3.2
src/Data/Dependent/Map.hs view
@@ -154,6 +154,7 @@ #if !MIN_VERSION_base(4,8,0) import Data.Monoid #endif+import Data.Semigroup import Data.Some import Text.Read import Data.Dependent.Map.PtrEquality@@ -162,6 +163,9 @@     mempty  = empty     mappend = union     mconcat = unions++instance (GCompare k) => Semigroup (DMap k f) where+  (<>) = mappend  {--------------------------------------------------------------------   Operators