trivial-constraint 0.6.0.0 → 0.7.0.0
raw patch · 2 files changed
+4/−3 lines, 2 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
- 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
+ Data.Constraint.Trivial: instance forall k1 k2 (t :: k1) (s :: k2). Data.Constraint.Trivial.Unconstrained2 t s
+ Data.Constraint.Trivial: instance forall k1 k2 k3 (t :: k1) (s :: k2) (r :: k3). Data.Constraint.Trivial.Unconstrained3 t s r
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 (t :: k1) (s :: k2) (r :: k3) (q :: k4). Data.Constraint.Trivial.Unconstrained4 t s r q
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 (t :: k1) (s :: k2) (r :: k3) (q :: k4) (p :: k5). Data.Constraint.Trivial.Unconstrained5 t s r q p
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 k6 (t :: k1) (s :: k2) (r :: k3) (q :: k4) (p :: k5) (o :: k6). Data.Constraint.Trivial.Unconstrained6 t s r q p o
+ Data.Constraint.Trivial: instance forall k1 k2 k3 k4 k5 k6 k7 (t :: k1) (s :: k2) (r :: k3) (q :: k4) (p :: k5) (o :: k6) (n :: k7). 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 :: k1) (s :: k2) (r :: k3) (q :: k4) (p :: k5) (o :: k6) (n :: k7) (m :: k8). 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 :: k1) (s :: k2) (r :: k3) (q :: k4) (p :: k5) (o :: k6) (n :: k7) (m :: k8) (l :: k9). Data.Constraint.Trivial.Unconstrained9 t s r q p o n m l
- Data.Constraint.Trivial: class (Bottom, TypeError ( 'Text "All instances of " :<>: 'Text t :<>: 'Text " are disallowed.")) => Disallowed t
+ Data.Constraint.Trivial: class (Bottom, TypeError ('Text "All instances of " :<>: 'Text t :<>: 'Text " are disallowed.")) => Disallowed t
- Data.Constraint.Trivial: nope :: forall (a :: TYPE rep). Bottom => a
+ Data.Constraint.Trivial: nope :: forall rep (a :: TYPE rep). Bottom => a
Files
src/Data/Constraint/Trivial.hs view
@@ -2,7 +2,7 @@ -- Module : Data.Constraint.Trivial -- Copyright : (c) 2014-2016 Justus Sagemüller -- License : GPL v3 (see LICENSE)--- Maintainer : (@) jsagemue $ uni-koeln.de+-- Maintainer : (@) jsag $ hvl.no -- {-# LANGUAGE ConstraintKinds #-} {-# LANGUAGE DataKinds #-}@@ -12,6 +12,7 @@ {-# LANGUAGE Rank2Types #-} {-# LANGUAGE EmptyCase #-} {-# LANGUAGE PolyKinds #-}+{-# LANGUAGE TypeInType #-} {-# LANGUAGE TypeOperators #-} {-# LANGUAGE UndecidableInstances #-} {-# LANGUAGE UndecidableSuperClasses #-}@@ -47,7 +48,7 @@ -- you are guaranteed that it can under no circumstances actually be invoked, you -- are allowed to to anything whatsoever, even create a value of an uninhabited unlifted -- type.-nope :: forall (a :: TYPE rep). Bottom => a+nope :: forall rep (a :: TYPE rep). Bottom => a nope = case no of -- | A constraint that is always/unconditionally fulfilled. This behaves the same
trivial-constraint.cabal view
@@ -2,7 +2,7 @@ -- documentation, see http://haskell.org/cabal/users-guide/ name: trivial-constraint-version: 0.6.0.0+version: 0.7.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 of form @k -> Constraint@,