profunctors 5.6.2 → 5.6.3
raw patch · 10 files changed
+24/−66 lines, 10 filesdep −semigroupsdep ~base
Dependencies removed: semigroups
Dependency ranges changed: base
Files
- .hlint.yaml +2/−0
- CHANGELOG.markdown +4/−0
- profunctors.cabal +16/−18
- src/Data/Profunctor/Choice.hs +0/−7
- src/Data/Profunctor/Mapping.hs +0/−18
- src/Data/Profunctor/Monad.hs +0/−5
- src/Data/Profunctor/Rep.hs +2/−0
- src/Data/Profunctor/Traversing.hs +0/−7
- src/Data/Profunctor/Types.hs +0/−7
- src/Data/Profunctor/Unsafe.hs +0/−4
.hlint.yaml view
@@ -1,3 +1,5 @@+- arguments: [-XCPP]+ - extensions: - default: false # all extension are banned by default - name:
CHANGELOG.markdown view
@@ -1,3 +1,7 @@+5.6.3 [2025.06.17]+------------------+* Drop support for pre-8.0 versions of GHC.+ 5.6.2 [2021.02.17] ------------------ * Add `Semigroup` and `Monoid` instances for `Forget`
profunctors.cabal view
@@ -1,6 +1,6 @@ name: profunctors category: Control, Categories-version: 5.6.2+version: 5.6.3 license: BSD3 cabal-version: >= 1.10 license-file: LICENSE@@ -12,14 +12,19 @@ copyright: Copyright (C) 2011-2015 Edward A. Kmett synopsis: Profunctors description: Profunctors.-tested-with: GHC == 7.8.4- , GHC == 7.10.3- , GHC == 8.0.2+tested-with: GHC == 8.0.2 , GHC == 8.2.2 , GHC == 8.4.4 , GHC == 8.6.5- , GHC == 8.8.3- , GHC == 8.10.1+ , GHC == 8.8.4+ , GHC == 8.10.7+ , GHC == 9.0.2+ , GHC == 9.2.8+ , GHC == 9.4.8+ , GHC == 9.6.6+ , GHC == 9.8.4+ , GHC == 9.10.1+ , GHC == 9.12.2 build-type: Simple extra-source-files: .ghci@@ -31,22 +36,18 @@ source-repository head type: git- location: git://github.com/ekmett/profunctors.git+ location: https://github.com/ekmett/profunctors.git library build-depends:- base >= 4.7 && < 5,- base-orphans >= 0.8.4 && < 0.9,+ base >= 4.9 && < 5,+ base-orphans >= 0.8.4 && < 0.10, bifunctors >= 5.5.9 && < 6, comonad >= 5.0.8 && < 6, contravariant >= 1.5.3 && < 2, distributive >= 0.5.2 && < 1, tagged >= 0.8.6.1 && < 1,- transformers >= 0.3 && < 0.6-- if !impl(ghc >= 8.0)- build-depends: semigroups >= 0.18.5 && < 0.20-+ transformers >= 0.3 && < 0.7 exposed-modules: Data.Profunctor Data.Profunctor.Adjunction@@ -65,10 +66,7 @@ Data.Profunctor.Unsafe Data.Profunctor.Yoneda - ghc-options: -Wall -O2-- if impl(ghc>=8.0)- ghc-options: -Wno-trustworthy-safe+ ghc-options: -Wall -O2 -Wno-trustworthy-safe if impl(ghc >= 8.6) ghc-options: -Wno-star-is-type
src/Data/Profunctor/Choice.hs view
@@ -1,4 +1,3 @@-{-# LANGUAGE CPP #-} {-# LANGUAGE GADTs #-} {-# LANGUAGE RankNTypes #-} {-# LANGUAGE TypeOperators #-}@@ -43,13 +42,7 @@ import Data.Profunctor.Types import Data.Profunctor.Unsafe import Data.Tagged--#if __GLASGOW_HASKELL__ < 710-import Data.Traversable-import Prelude hiding (id,(.),sequence)-#else import Prelude hiding (id,(.))-#endif ------------------------------------------------------------------------------ -- Choice
src/Data/Profunctor/Mapping.hs view
@@ -1,4 +1,3 @@-{-# LANGUAGE CPP #-} {-# LANGUAGE GADTs #-} {-# LANGUAGE RankNTypes #-} {-# LANGUAGE DeriveFunctor #-}@@ -36,9 +35,6 @@ import Data.Profunctor.Traversing import Data.Profunctor.Types import Data.Profunctor.Unsafe-#if __GLASGOW_HASKELL__ < 710-import Control.Applicative-#endif class (Traversing p, Closed p) => Mapping p where -- | Laws:@@ -68,21 +64,7 @@ instance (Monad m, Distributive m) => Mapping (Kleisli m) where map' (Kleisli f) = Kleisli (collect f)-#if __GLASGOW_HASKELL__ >= 710 roam f = Kleisli #. genMap f .# runKleisli-#else- -- We could actually use this implementation everywhere, but it's kind of a- -- warty mess, and there have been rumblings of WrappedMonad deprecation.- -- If/when GHC 7.8 moves out of the support window, this will vanish in a- -- puff of cleanup.- roam f = (Kleisli . (unwrapMonad .)) #. genMapW f .# ((WrapMonad .) . runKleisli)- where- genMapW- :: (Monad m, Distributive m)- => ((a -> b) -> s -> t)- -> (a -> WrappedMonad m b) -> s -> WrappedMonad m t- genMapW abst amb s = WrapMonad $ (\ab -> abst ab s) <$> distribute (unwrapMonad #. amb)-#endif genMap :: Distributive f => ((a -> b) -> s -> t) -> (a -> f b) -> s -> f t genMap abst afb s = fmap (\ab -> abst ab s) (distribute afb)
src/Data/Profunctor/Monad.hs view
@@ -1,4 +1,3 @@-{-# LANGUAGE CPP #-} {-# LANGUAGE PolyKinds #-} {-# LANGUAGE RankNTypes #-} {-# LANGUAGE TypeOperators #-}@@ -57,11 +56,7 @@ proreturn :: Profunctor p => p :-> t p projoin :: Profunctor p => t (t p) :-> t p -#if __GLASGOW_HASKELL__ < 710-instance (Functor f, Monad f) => ProfunctorMonad (Tannen f) where-#else instance Monad f => ProfunctorMonad (Tannen f) where-#endif proreturn = Tannen . return projoin (Tannen m) = Tannen $ m >>= runTannen
src/Data/Profunctor/Rep.hs view
@@ -196,7 +196,9 @@ go (xf',xa') = sieve pf xf' <*> sieve pa xa' instance (Monad (Rep p), Representable p) => Monad (Prep p) where+#if !(MIN_VERSION_base(4,11,0)) return a = Prep () $ tabulate $ const $ return a+#endif Prep xa pa >>= f = Prep xa $ tabulate $ sieve pa >=> \a -> case f a of Prep xb pb -> sieve pb xb
src/Data/Profunctor/Traversing.hs view
@@ -1,4 +1,3 @@-{-# LANGUAGE CPP #-} {-# LANGUAGE GADTs #-} {-# LANGUAGE RankNTypes #-} {-# LANGUAGE DeriveFunctor #-}@@ -32,12 +31,6 @@ import Data.Profunctor.Unsafe import Data.Traversable import Data.Tuple (swap)--#if __GLASGOW_HASKELL__ < 710-import Data.Monoid (Monoid)-import Data.Foldable-import Prelude hiding (mapM)-#endif firstTraversing :: Traversing p => p a b -> p (a, c) (b, c) firstTraversing = dimap swap swap . traverse'
src/Data/Profunctor/Types.hs view
@@ -45,10 +45,6 @@ import Data.Traversable import Prelude hiding (id,(.)) -#if !(MIN_VERSION_base(4,8,0))-import Data.Monoid (Monoid(..))-#endif- #if !(MIN_VERSION_base(4,11,0)) import Data.Semigroup (Semigroup(..)) #endif@@ -97,9 +93,6 @@ Star f <|> Star g = Star $ \a -> f a <|> g a instance Monad f => Monad (Star f a) where-#if __GLASGOW_HASKELL__ < 710- return a = Star $ \_ -> return a-#endif Star m >>= f = Star $ \ e -> do a <- m e runStar (f a) e
src/Data/Profunctor/Unsafe.hs view
@@ -1,4 +1,3 @@-{-# LANGUAGE CPP #-} {-# LANGUAGE Trustworthy #-} {-# LANGUAGE ScopedTypeVariables #-} -----------------------------------------------------------------------------@@ -41,9 +40,6 @@ import Data.Bifunctor.Sum (Sum(..)) import Data.Bifunctor.Tannen (Tannen(..)) import Data.Coerce (Coercible, coerce)-#if __GLASGOW_HASKELL__ < 710-import Data.Functor-#endif import Data.Functor.Contravariant (Contravariant(..)) import Data.Tagged import Prelude hiding (id,(.))