validity-containers 0.1.0.1 → 0.1.0.2
raw patch · 6 files changed
+38/−12 lines, 6 filesdep ~validityPVP: minor bump suggested
API additions: PVP suggests at least a minor version bump
Dependency ranges changed: validity
API changes (from Hackage documentation)
+ Data.Validity.Sequence: instance (GHC.Classes.Ord v, Data.Validity.Validity v) => Data.Validity.Validity (Data.Sequence.Seq v)
+ Data.Validity.Set: instance (GHC.Classes.Ord v, Data.Validity.Validity v) => Data.Validity.Validity (Data.Set.Base.Set v)
Files
- src/Data/Validity/Containers.hs +3/−0
- src/Data/Validity/Map.hs +6/−7
- src/Data/Validity/Sequence.hs +11/−0
- src/Data/Validity/Set.hs +12/−0
- src/Data/Validity/Tree.hs +1/−1
- validity-containers.cabal +5/−4
src/Data/Validity/Containers.hs view
@@ -1,5 +1,8 @@ module Data.Validity.Containers where import Data.Validity.Tree as Containers ()+import Data.Validity.Set as Containers ()+import Data.Validity.Map as Containers ()+import Data.Validity.Sequence as Containers ()
src/Data/Validity/Map.hs view
@@ -1,13 +1,12 @@ module Data.Validity.Map where -import Data.Validity+import Data.Validity -import Data.Map (Map)+import Data.Map (Map) import qualified Data.Map as M --- | A tree of things is valid if all the things are valid and the map itself+-- | A 'Map' of things is valid if all the keys and values are valid and the 'Map' itself -- is valid.-instance (Ord k, Validity k, Validity v) => Validity (Map k v) where- isValid m = M.valid m && all isValid (M.keys m) && all isValid m--+instance (Ord k, Validity k, Validity v) =>+ Validity (Map k v) where+ isValid m = M.valid m && all isValid (M.toList m)
+ src/Data/Validity/Sequence.hs view
@@ -0,0 +1,11 @@+module Data.Validity.Sequence where++import Data.Validity++import Data.Sequence (Seq)+import qualified Data.Sequence as S++-- | A 'Seq'uence of things is valid if all the elements are valid.+instance (Ord v, Validity v) =>+ Validity (Seq v) where+ isValid = all isValid
+ src/Data/Validity/Set.hs view
@@ -0,0 +1,12 @@+module Data.Validity.Set where++import Data.Validity++import Data.Set (Set)+import qualified Data.Set as S++-- | A 'Set' of things is valid if all the elements are valid and the 'Set' itself+-- is valid.+instance (Ord v,Validity v) =>+ Validity (Set v) where+ isValid s = S.valid s && all isValid s
src/Data/Validity/Tree.hs view
@@ -4,7 +4,7 @@ import Data.Tree --- | A tree of things is valid if all the things are valid+-- | A 'Tree' of things is valid if all the things in the 'Tree' are valid. instance Validity a => Validity (Tree a) where isValid = all isValid
validity-containers.cabal view
@@ -1,5 +1,5 @@ name: validity-containers-version: 0.1.0.1+version: 0.1.0.2 synopsis: Validity instances for containers description: Please see README.md homepage: https://github.com/NorfairKing/validity#readme@@ -8,9 +8,8 @@ author: Tom Sydney Kerckhove maintainer: syd.kerckhove@gmail.com copyright: Copyright: (c) 2016 Tom Sydney Kerckhove-category: Web+category: Validity build-type: Simple--- extra-source-files: cabal-version: >=1.10 library@@ -18,8 +17,10 @@ exposed-modules: Data.Validity.Containers , Data.Validity.Tree , Data.Validity.Map+ , Data.Validity.Sequence+ , Data.Validity.Set build-depends: base < 5- , validity+ , validity >= 0.3 && < 0.4 , containers default-language: Haskell2010