trivial-constraint 0.4.0.0 → 0.5.0.0
raw patch · 2 files changed
+7/−6 lines, 2 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained t
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained2 t s
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained3 t s r
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained4 t s r q
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained5 t s r q p
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained6 t s r q p o
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained7 t s r q p o n
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained8 t s r q p o n m
- Data.Constraint.Trivial: instance Data.Constraint.Trivial.Unconstrained9 t s r q p o n m l
+ Data.Constraint.Trivial: instance forall k (t :: k). Data.Constraint.Trivial.Unconstrained t
+ Data.Constraint.Trivial: instance forall k1 k2 (t :: k2) (s :: k1). Data.Constraint.Trivial.Unconstrained2 t s
+ Data.Constraint.Trivial: instance forall k1 k2 k3 (t :: k3) (s :: k2) (r :: k1). Data.Constraint.Trivial.Unconstrained3 t s r
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 (t :: k4) (s :: k3) (r :: k2) (q :: k1). Data.Constraint.Trivial.Unconstrained4 t s r q
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 (t :: k5) (s :: k4) (r :: k3) (q :: k2) (p :: k1). Data.Constraint.Trivial.Unconstrained5 t s r q p
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 k6 (t :: k6) (s :: k5) (r :: k4) (q :: k3) (p :: k2) (o :: k1). Data.Constraint.Trivial.Unconstrained6 t s r q p o
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 k6 k7 (t :: k7) (s :: k6) (r :: k5) (q :: k4) (p :: k3) (o :: k2) (n :: k1). Data.Constraint.Trivial.Unconstrained7 t s r q p o n
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 k6 k7 k8 (t :: k8) (s :: k7) (r :: k6) (q :: k5) (p :: k4) (o :: k3) (n :: k2) (m :: k1). Data.Constraint.Trivial.Unconstrained8 t s r q p o n m
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 k6 k7 k8 k9 (t :: k9) (s :: k8) (r :: k7) (q :: k6) (p :: k5) (o :: k4) (n :: k3) (m :: k2) (l :: k1). Data.Constraint.Trivial.Unconstrained9 t s r q p o n m l
Files
src/Data/Constraint/Trivial.hs view
@@ -3,10 +3,11 @@ -- Copyright : (c) 2014-2016 Justus Sagemüller -- License : GPL v3 (see LICENSE) -- Maintainer : (@) jsagemue $ uni-koeln.de--- +--+{-# LANGUAGE ConstraintKinds #-} {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE MultiParamTypeClasses #-}-{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE PolyKinds #-} module Data.Constraint.Trivial ( Unconstrained, Impossible@@ -21,8 +22,8 @@ ) where -- | Intended to be used as an argument for some type constructor which expects kind--- @* -> Constraint@, when you do not actually wish to constrain anything with it.--- +-- @k -> Constraint@, when you do not actually wish to constrain anything with it.+-- -- @'Unconstrained' t@ can always be added to the constraint list of any signature, without -- changing anything. class Unconstrained t@@ -37,7 +38,7 @@ class HiddenEmptyClass t --- | Like 'Unconstrained', but with kind signature @* -> * -> Constraint@+-- | Like 'Unconstrained', but with kind signature @k -> k -> Constraint@ -- (two unconstrained types). class Unconstrained2 t s instance Unconstrained2 t s
trivial-constraint.cabal view
@@ -2,7 +2,7 @@ -- documentation, see http://haskell.org/cabal/users-guide/ name: trivial-constraint-version: 0.4.0.0+version: 0.5.0.0 synopsis: Constraints that any type, resp. no type fulfills description: Since GHC 7.4, constraints are first-class: we have the constraint kind, and thus type-classes have a kind such as @* -> Constraint@. .