contravariant 1.3 → 1.3.1

raw patch · 5 files changed

+158/−2 lines, 5 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• CHANGELOG.markdown +4/−0
• HLint.hs +2/−0
• contravariant.cabal +6/−2
• src/Data/Functor/Contravariant/Divisible.hs +12/−0
• src/Data/Functor/Contravariant/Generic.hs +134/−0

@@ -1,3 +1,7 @@+1.3.1+-----+* Added `Data.Functor.Contravariant.Generic` on GHC 7.4++ 1.3 --- * We've merged the `foreign-var` and `StateVar` packages. Transferring support to `StateVar`.

@@ -0,0 +1,2 @@+ignore "Eta reduce"+

@@ -1,6 +1,6 @@ name:          contravariant category:      Control, Data-version:       1.3+version:       1.3.1 license:       BSD3 cabal-version: >= 1.6 license-file:  LICENSE@@ -16,6 +16,7 @@ extra-source-files:   .travis.yml   CHANGELOG.markdown+  HLint.hs  source-repository head   type: git@@ -67,7 +68,10 @@    exposed-modules:     Data.Functor.Contravariant-    Data.Functor.Contravariant.Divisible     Data.Functor.Contravariant.Compose+    Data.Functor.Contravariant.Divisible++  if impl(ghc >= 7.4)+    exposed-modules: Data.Functor.Contravariant.Generic    ghc-options: -Wall

@@ -1,4 +1,16 @@ {-# LANGUAGE CPP #-}+-----------------------------------------------------------------------------+-- |+-- Module      :  Data.Functor.Contravariant.Divisible+-- Copyright   :  (C) 2014-2015 Edward Kmett+-- License     :  BSD-style (see the file LICENSE)+--+-- Maintainer  :  Edward Kmett <ekmett@gmail.com>+-- Stability   :  provisional+-- Portability :  portable+--+-- This module supplies contravariant analogues to the 'Applicative' and 'Alternative' classes.+---------------------------------------------------------------------------- module Data.Functor.Contravariant.Divisible   (   -- * Contravariant Applicative

@@ -0,0 +1,134 @@+{-# LANGUAGE CPP #-}+{-# LANGUAGE BangPatterns #-}+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE ConstraintKinds #-}+{-# LANGUAGE FlexibleInstances #-}+{-# LANGUAGE TypeOperators #-}+{-# LANGUAGE Rank2Types #-}+{-# LANGUAGE UndecidableInstances #-}+{-# LANGUAGE FlexibleContexts #-}+#if __GLASGOW_HASKELL__ >= 706+{-# LANGUAGE PolyKinds #-}+#endif+-----------------------------------------------------------------------------+-- |+-- Module      :  Data.Functor.Contravariant.Generic+-- Copyright   :  (C) 2007-2015 Edward Kmett+-- License     :  BSD-style (see the file LICENSE)+--+-- Maintainer  :  Edward Kmett <ekmett@gmail.com>+-- Stability   :  experimental+-- Portability :  ConstraintKinds+--+--+--+----------------------------------------------------------------------------++module Data.Functor.Contravariant.Generic+  ( Deciding(..)+  , Deciding1(..)+  ) where++import Data.Functor.Contravariant+import Data.Functor.Contravariant.Divisible+import GHC.Generics++-- | This provides machinery for deconstructing an arbitrary 'Generic' instance using a 'Decidable' 'Contravariant' functor.+--+-- /Examples:/+--+-- @+-- gcompare :: 'Deciding' 'Ord' a => a -> a -> 'Ordering'+-- gcompare = 'getComparison' $ 'deciding' (Proxy :: Proxy 'Ord') ('Comparison' 'compare')+-- @+--+-- @+-- geq :: 'Deciding' 'Eq' a => a -> a -> 'Bool'+-- geq = 'getEquivalence' $ 'deciding' (Proxy :: Proxy 'Eq') ('Equivalence' ('=='))+-- @+class (Generic a, GDeciding q (Rep a)) => Deciding q a where+#ifndef HLINT+  deciding :: Decidable f => p q -> (forall b. q b => f b) -> f a+#endif++instance (Generic a, GDeciding q (Rep a)) => Deciding q a  where+  deciding p q = contramap from $ gdeciding p q++-- | This provides machinery for deconstructing an arbitrary 'Generic1' instance using a 'Decidable' 'Contravariant' functor.+--+-- /Examples:/+--+-- @+-- gcompare1 :: 'Deciding1' 'Ord' f => (a -> a -> 'Ordering') -> f a -> f a -> 'Ordering'+-- gcompare1 f = 'getComparison' $ 'deciding1' (Proxy :: Proxy 'Ord') ('Comparison' compare) ('Comparison' f)+-- @+--+-- @+-- geq1 :: 'Deciding1' 'Eq' f => (a -> a -> 'Bool') -> f a -> f a -> 'Bool'+-- geq1 f = 'getEquivalence' $ 'deciding1' (Proxy :: Proxy 'Eq') ('Equivalence' ('==')) ('Equivalence' f)+-- @+class (Generic1 t, GDeciding1 q (Rep1 t)) => Deciding1 q t where+#ifndef HLINT+  deciding1 :: Decidable f => p q -> (forall b. q b => f b) -> f a -> f (t a)+#endif++instance (Generic1 t, GDeciding1 q (Rep1 t)) => Deciding1 q t where+  deciding1 p q r = contramap from1 $ gdeciding1 p q r++class GDeciding q t where+#ifndef HLINT+  gdeciding :: Decidable f => p q -> (forall b. q b => f b) -> f (t a)+#endif++instance GDeciding q U1 where+  gdeciding _ _ = conquer++instance GDeciding q V1 where+  gdeciding _ _ = lose (\ !_ -> error "impossible")++instance (GDeciding q f, GDeciding q g) => GDeciding q (f :*: g) where+  gdeciding p q = divide (\(a :*: b) -> (a, b)) (gdeciding p q) (gdeciding p q)++instance (GDeciding q f, GDeciding q g) => GDeciding q (f :+: g) where+  gdeciding p q = choose (\ xs -> case xs of L1 a -> Left a; R1 a -> Right a) (gdeciding p q) (gdeciding p q)++#ifndef HLINT+instance q p => GDeciding q (K1 i p) where+#endif+  gdeciding _ q = contramap unK1 q++instance GDeciding q f => GDeciding q (M1 i c f) where+  gdeciding p q = contramap unM1 (gdeciding p q)++class GDeciding1 q t where+#ifndef HLINT+  gdeciding1 :: Decidable f => p q -> (forall b. q b => f b) -> f a -> f (t a)+#endif++instance GDeciding1 q U1 where+  gdeciding1 _ _ _ = conquer++instance GDeciding1 q V1 where+  gdeciding1 _ _ _ = lose (\ !_ -> error "impossible")++instance (GDeciding1 q f, GDeciding1 q g) => GDeciding1 q (f :*: g) where+  gdeciding1 p q r = divide (\(a :*: b) -> (a, b)) (gdeciding1 p q r) (gdeciding1 p q r)++instance (GDeciding1 q f, GDeciding1 q g) => GDeciding1 q (f :+: g) where+  gdeciding1 p q r = choose (\ xs -> case xs of L1 a -> Left a; R1 a -> Right a) (gdeciding1 p q r) (gdeciding1 p q r)++#ifndef HLINT+instance q p => GDeciding1 q (K1 i p) where+#endif+  gdeciding1 _ q _ = contramap unK1 q++instance GDeciding1 q f => GDeciding1 q (M1 i c f) where+  gdeciding1 p q r = contramap unM1 (gdeciding1 p q r)++instance GDeciding1 q Par1 where+  gdeciding1 _ _ r = contramap unPar1 r++-- instance GDeciding1 q f => GDeciding1 q (Rec1 f) where gdeciding1 p q r = contramap unRec1 (gdeciding1 p q r)++instance Deciding1 q f => GDeciding1 q (Rec1 f) where+  gdeciding1 p q r = contramap unRec1 (deciding1 p q r)