dependent-monoidal-map 0.1.1.1 → 0.1.1.2
raw patch · 3 files changed
+33/−24 lines, 3 filesdep ~aesondep ~basedep ~constraintsPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: aeson, base, constraints, dependent-map, dependent-sum, dependent-sum-aeson-orphans
API changes (from Hackage documentation)
- Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Base.Semigroup f g, Data.GADT.Compare.GCompare f) => GHC.Base.Monoid (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
- Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Base.Semigroup f g, Data.GADT.Compare.GCompare f) => GHC.Base.Semigroup (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
- Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Classes.Eq f g, Data.Constraint.Extras.Has' GHC.Classes.Ord f g, Data.GADT.Compare.GCompare f) => GHC.Classes.Ord (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
- Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Classes.Eq f g, Data.GADT.Compare.GCompare f) => GHC.Classes.Eq (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
- Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.GADT.Compare.GCompare f, Data.Constraint.Extras.Has' GHC.Classes.Eq f g, Data.Constraint.Extras.Has' GHC.Classes.Ord f g) => GHC.Classes.Ord (Data.Dependent.Map.Monoidal.FakeDSum f g)
- Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.GADT.Compare.GEq f, Data.Constraint.Extras.Has' GHC.Classes.Eq f g) => GHC.Classes.Eq (Data.Dependent.Map.Monoidal.FakeDSum f g)
- Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.GADT.Show.GRead f, Data.Constraint.Extras.Has' GHC.Read.Read f g) => GHC.Read.Read (Data.Dependent.Map.Monoidal.FakeDSum f g)
- Data.Dependent.Map.Monoidal: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). (Data.GADT.Compare.GCompare k2, GHC.Read.Read (Data.Dependent.Map.Monoidal.FakeDSum k2 f)) => GHC.Read.Read (Data.Dependent.Map.Monoidal.MonoidalDMap k2 f)
+ Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Base.Semigroup f g, Data.GADT.Internal.GCompare f) => GHC.Base.Monoid (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
+ Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Base.Semigroup f g, Data.GADT.Internal.GCompare f) => GHC.Base.Semigroup (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
+ Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Classes.Eq f g, Data.Constraint.Extras.Has' GHC.Classes.Ord f g, Data.GADT.Internal.GCompare f) => GHC.Classes.Ord (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
+ Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.Constraint.Extras.Has' GHC.Classes.Eq f g, Data.GADT.Internal.GCompare f) => GHC.Classes.Eq (Data.Dependent.Map.Monoidal.MonoidalDMap f g)
+ Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.GADT.Internal.GCompare f, Data.Constraint.Extras.Has' GHC.Classes.Eq f g, Data.Constraint.Extras.Has' GHC.Classes.Ord f g) => GHC.Classes.Ord (Data.Dependent.Map.Monoidal.FakeDSum f g)
+ Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.GADT.Internal.GEq f, Data.Constraint.Extras.Has' GHC.Classes.Eq f g) => GHC.Classes.Eq (Data.Dependent.Map.Monoidal.FakeDSum f g)
+ Data.Dependent.Map.Monoidal: instance forall k (f :: k -> *) (g :: k -> *). (Data.GADT.Internal.GRead f, Data.Constraint.Extras.Has' GHC.Read.Read f g) => GHC.Read.Read (Data.Dependent.Map.Monoidal.FakeDSum f g)
+ Data.Dependent.Map.Monoidal: instance forall k1 (k2 :: k1 -> *) (f :: k1 -> *). (Data.GADT.Internal.GCompare k2, GHC.Read.Read (Data.Dependent.Map.Monoidal.FakeDSum k2 f)) => GHC.Read.Read (Data.Dependent.Map.Monoidal.MonoidalDMap k2 f)
Files
- ChangeLog.md +5/−0
- dependent-monoidal-map.cabal +27/−24
- src/Data/Dependent/Map/Monoidal.hs +1/−0
ChangeLog.md view
@@ -1,1 +1,6 @@ # Revision history for dependent-monoidal-map++## 0.1.1.2++* Use Refl from Data.Type.Equality+* Update dependency version bounds
dependent-monoidal-map.cabal view
@@ -1,32 +1,35 @@-name: dependent-monoidal-map-version: 0.1.1.1-description: Data.Dependent.Map variant that appends conflicting entries when merging maps instead of discarding one side of the conflict.-license: BSD3-license-file: LICENSE-author: Obsidian Systems LLC-maintainer: maintainer@obsidian.systems-copyright: 2018 Obsidian Systems LLC-build-type: Simple-extra-source-files: ChangeLog.md-cabal-version: >=1.10-category: Data-synopsis: Dependent map that uses semigroup mappend+name: dependent-monoidal-map+version: 0.1.1.2+description:+ Data.Dependent.Map variant that appends conflicting entries when merging maps instead of discarding one side of the conflict. +license: BSD3+license-file: LICENSE+author: Obsidian Systems LLC+maintainer: maintainer@obsidian.systems+copyright: 2018 Obsidian Systems LLC+build-type: Simple+extra-source-files: ChangeLog.md+cabal-version: >=1.10+category: Data+synopsis: Dependent map that uses semigroup mappend tested-with:- GHC ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5+ GHC ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.10.2 library- exposed-modules: Data.Dependent.Map.Monoidal- build-depends: base >=4.9 && <4.13,- aeson >= 1.4 && < 1.5,- constraints >= 0.10.1 && < 0.11,- constraints-extras >= 0.3.0 && < 0.4,- dependent-map >= 0.3 && < 0.4,- dependent-sum >= 0.6.2 && < 0.7,- dependent-sum-aeson-orphans >= 0.2.1 && < 0.3- hs-source-dirs: src+ exposed-modules: Data.Dependent.Map.Monoidal+ build-depends:+ aeson >=1.4 && <1.5+ , base >=4.9 && <4.15+ , constraints >=0.10.1 && <0.14+ , constraints-extras >=0.3.0 && <0.4+ , dependent-map >=0.4 && <0.5+ , dependent-sum >=0.7 && <0.8+ , dependent-sum-aeson-orphans >=0.3 && <0.4++ hs-source-dirs: src default-language: Haskell2010 source-repository head- type: git+ type: git location: https://github.com/obsidiansystems/dependent-monoidal-map
src/Data/Dependent/Map/Monoidal.hs view
@@ -24,6 +24,7 @@ import Data.Maybe import Data.Semigroup import Data.Some hiding (This)+import Data.Type.Equality import Text.Read import Prelude hiding (lookup, map)