pointed 4.2.0.2 → 5.0.5

raw patch · 6 files changed

Files

.travis.yml +0/−8
CHANGELOG.markdown +32/−0
README.markdown +1/−1
pointed.cabal +76/−19
src/Data/Copointed.hs +99/−50
src/Data/Pointed.hs +174/−103

− .travis.yml

@@ -1,8 +0,0 @@-language: haskell-notifications:-  irc:-    channels:-      - "irc.freenode.org#haskell-lens"-    skip_join: true-    template:-      - "\x0313pointed\x03/\x0306%{branch}\x03 \x0314%{commit}\x03 %{build_url} %{message}"

CHANGELOG.markdown view

@@ -1,3 +1,35 @@+5.0.5 [2024.10.26]+------------------+* Require building with GHC 8.0 or later.+* Remove the `-fsemigroups` `cabal` flag, as `pointed` no longer needs to depend+  on the `semigroups` library for backwards compatibility.+* Allow building with `data-default-class-0.2.*`.++5.0.4 [2022.05.07]+------------------+* Allow building with `transformers-0.6.*`.++5.0.3 [2021.11.01]+------------------+* Allow building with `base-4.16` (GHC 9.2).++5.0.2 [2020.09.30]+------------------+* Drop unused `generic-deriving` dependency.++5.0.1+-----+* Add `Pointed` and `Copointed` instances for various types from `GHC.Generics`.+* Do not attempt to support Safe Haskell anymore.++5+-+* Require `kan-extensions-5`.++4.2.1+-----+* Added (largely unsupported) options to build without almost all of the dependencies for advanced users+ 4.2.0.2 ------- * Added the `CHANGELOG.markdown` to `extra-source-files`, so that `hackage` can display it.

README.markdown view

@@ -1,7 +1,7 @@ pointed ======= -[![Build Status](https://secure.travis-ci.org/ekmett/pointed.png?branch=master)](http://travis-ci.org/ekmett/pointed)+[![Hackage](https://img.shields.io/hackage/v/pointed.svg)](https://hackage.haskell.org/package/pointed) [![Build Status](https://github.com/ekmett/pointed/workflows/Haskell-CI/badge.svg)](https://github.com/ekmett/pointed/actions?query=workflow%3AHaskell-CI)  Haskell 98 pointed and copointed data types.

pointed.cabal view

@@ -1,20 +1,31 @@ name:          pointed category:      Data-version:       4.2.0.2+version:       5.0.5 license:       BSD3-cabal-version: >= 1.6+cabal-version: >= 1.10 license-file:  LICENSE author:        Edward A. Kmett maintainer:    Edward A. Kmett <ekmett@gmail.com> stability:     provisional homepage:      http://github.com/ekmett/pointed/ bug-reports:   http://github.com/ekmett/pointed/issues-copyright:     Copyright (C) 2008-2013 Edward A. Kmett+copyright:     Copyright (C) 2008-2016 Edward A. Kmett synopsis:      Pointed and copointed data-description:   Pointed and copointed data+description:   Pointed and copointed data. build-type:    Simple+tested-with:   GHC == 8.0.2+             , GHC == 8.2.2+             , GHC == 8.4.4+             , GHC == 8.6.5+             , 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.2+             , GHC == 9.10.1 extra-source-files:-  .travis.yml   README.markdown   CHANGELOG.markdown @@ -22,25 +33,71 @@   type: git   location: git://github.com/ekmett/pointed.git +flag comonad+  description: You can disable the use of the `comonad` package using `-f-transformers`.+  default: True+  manual: True+flag containers+  description: You can disable the use of the `containers` package using `-f-containers`.+  default: True+  manual: True+flag kan-extensions+  description: You can disable the use of the `kan-extensions` package using `-f-kan-extensions`.+  default: True+  manual: True+flag semigroupoids+  description: You can disable the use of the `semigroupoids` package using `-f-semigroupoids`.+  default: True+  manual: True+flag stm+  description: You can disable the use of the `stm` package using `-f-stm`.+  default: True+  manual: True+flag tagged+  description: You can disable the use of the `tagged` package using `-f-tagged`.+  default: True+  manual: True+flag transformers+  description: You can disable the use of the `transformers` package using `-f-transformers`.+  default: True+  manual: True+flag unordered-containers+  description: You can disable the use of the `unordered-containers` package using `-f-unordered-containers`.+  default: True+  manual: True+ library-  build-depends:-    base                 >= 4       && < 5,-    transformers         >= 0.2     && < 0.5,-    transformers-compat  >= 0.3     && < 1,-    containers           >= 0.4     && < 0.6,-    comonad              >= 4       && < 5,-    data-default-class   >= 0.0.1   && < 0.1,-    hashable             >= 1.1     && < 1.3,-    kan-extensions       >= 4.2     && < 5,-    semigroups           >= 0.8.3.1 && < 1,-    semigroupoids        >= 4       && < 6,-    stm                  >= 2.1.2.1 && < 2.5,-    tagged               >= 0.5     && < 1,-    unordered-containers >= 0.2     && < 0.3+  build-depends: base >= 4.9 && < 5,+                 data-default-class >= 0.0.1 && < 0.3 +  if flag(comonad)+    build-depends: comonad >= 5 && < 6++  if flag(containers)+    build-depends: containers >= 0.4 && < 0.8++  if flag(kan-extensions)+    build-depends: kan-extensions >= 5 && < 6++  if flag(semigroupoids)+    build-depends: semigroupoids >= 4 && < 7++  if flag(stm)+    build-depends: stm >= 2.1.2.1 && < 2.6++  if flag(tagged)+    build-depends: tagged >= 0.5 && < 1++  if flag(transformers)+    build-depends: transformers >= 0.2 && < 0.7, transformers-compat >= 0.3 && < 1++  if flag(unordered-containers)+    build-depends: hashable >= 1.1 && < 1.6, unordered-containers >= 0.2 && < 0.3+   exposed-modules:     Data.Pointed     Data.Copointed +  default-language: Haskell2010   ghc-options: -Wall   hs-source-dirs: src

src/Data/Copointed.hs view

@@ -1,31 +1,53 @@ {-# LANGUAGE CPP #-} {-# LANGUAGE TypeFamilies #-}-#if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702-{-# LANGUAGE Safe #-}-#endif+{-# LANGUAGE TypeOperators #-}+ module Data.Copointed where +import Control.Applicative import Data.Default.Class+import GHC.Generics++#ifdef MIN_VERSION_comonad+import Control.Comonad.Trans.Env+import Control.Comonad.Trans.Store+import Control.Comonad.Trans.Traced++#if !(MIN_VERSION_comonad(4,3,0))+import Data.Functor.Coproduct+#endif+#endif++#ifdef MIN_VERSION_containers+import Data.Tree+#endif++#ifdef MIN_VERSION_semigroupoids import Data.Functor.Bind+#endif+++import Data.Semigroup as Semigroup+import Data.List.NonEmpty (NonEmpty(..))++import qualified Data.Monoid as Monoid++#ifdef MIN_VERSION_tagged+import Data.Tagged+#endif+ import Data.Functor.Identity+import Data.Functor.Sum as F import Data.Functor.Compose-import Data.Functor.Coproduct++#ifdef MIN_VERSION_transformers import Data.Functor.Reverse-import Data.Functor.Kan.Lift as Kan-import qualified Data.Functor.Sum as F-import Data.Tree-import Data.Semigroup as Semigroup-import Control.Applicative import Control.Applicative.Backwards import Control.Applicative.Lift as Applicative import Control.Monad.Trans.Identity import qualified Control.Monad.Trans.Writer.Lazy as Lazy import qualified Control.Monad.Trans.Writer.Strict as Strict-import Control.Comonad.Trans.Env-import Control.Comonad.Trans.Store-import Control.Comonad.Trans.Traced-import Data.List.NonEmpty (NonEmpty(..))-import Data.Tagged+#endif  -- | 'Copointed' does not require a 'Functor', as the only relationship -- between 'copoint' and 'fmap' is given by a free theorem.@@ -33,43 +55,63 @@ class Copointed p where   copoint :: p a -> a -instance (Copointed f, Copointed g) => Copointed (F.Sum f g) where-  copoint (F.InL m) = copoint m-  copoint (F.InR m) = copoint m+instance Copointed ((,) a) where+  copoint = snd -instance Copointed (Tagged a) where-  copoint = unTagged+instance Copointed ((,,) a b) where+  copoint (_,_,a) = a -instance Copointed Identity where-  copoint = runIdentity+instance Copointed ((,,,) a b c) where+  copoint (_,_,_,a) = a  instance Default m => Copointed ((->)m) where   copoint f = f def +instance Copointed m => Copointed (WrappedMonad m) where+  copoint = copoint . unwrapMonad++#ifdef MIN_VERSION_comonad instance (Default m, Copointed w) => Copointed (TracedT m w) where   copoint (TracedT w) = copoint w def -instance Copointed ((,) a) where-  copoint = snd+instance Copointed w => Copointed (EnvT e w) where+  copoint = copoint . lowerEnvT -instance Copointed ((,,) a b) where-  copoint (_,_,a) = a+instance Copointed w => Copointed (StoreT s w) where+  copoint (StoreT wf s) = copoint wf s+#endif -instance Copointed ((,,,) a b c) where-  copoint (_,_,_,a) = a+#ifdef MIN_VERSION_comonad+#if !(MIN_VERSION_comonad(4,3,0))+instance (Copointed p, Copointed q) => Copointed (Coproduct p q) where+  copoint = coproduct copoint copoint+#endif+#endif +#ifdef MIN_VERSION_containers instance Copointed Tree where   copoint = rootLabel+#endif -instance Copointed f => Copointed (Backwards f) where-  copoint = copoint . forwards+#ifdef MIN_VERSION_tagged+instance Copointed (Tagged a) where+  copoint = unTagged+#endif +instance Copointed Identity where+  copoint = runIdentity+ instance (Copointed p, Copointed q) => Copointed (Compose p q) where   copoint = copoint . copoint . getCompose -instance (Copointed p, Copointed q) => Copointed (Coproduct p q) where-  copoint = coproduct copoint copoint+instance (Copointed f, Copointed g) => Copointed (F.Sum f g) where+  copoint (F.InL m) = copoint m+  copoint (F.InR m) = copoint m +#ifdef MIN_VERSION_transformers+instance Copointed f => Copointed (Backwards f) where+  copoint = copoint . forwards+ instance Copointed f => Copointed (Applicative.Lift f) where   copoint (Pure a)   = a   copoint (Other fa) = copoint fa@@ -77,10 +119,6 @@ instance Copointed f => Copointed (Reverse f) where   copoint = copoint . getReverse -instance (Functor g, g ~ h) => Copointed (Kan.Lift g h) where-  copoint x = runIdentity (runLift x (fmap Identity))-  {-# INLINE copoint #-}- instance Copointed m => Copointed (IdentityT m) where   copoint = copoint . runIdentityT @@ -89,13 +127,17 @@  instance Copointed m => Copointed (Strict.WriterT w m) where   copoint = fst . copoint . Strict.runWriterT+#endif -instance Copointed Dual where-  copoint = getDual+instance Copointed Monoid.Dual where+  copoint = Monoid.getDual -instance Copointed Sum where-  copoint = getSum+instance Copointed Monoid.Sum where+  copoint = Monoid.getSum +instance Copointed Monoid.Product where+  copoint = Monoid.getProduct+ instance Copointed NonEmpty where   copoint ~(a :| _) = a @@ -114,23 +156,30 @@ instance Copointed WrappedMonoid where   copoint = unwrapMonoid -#if MIN_VERSION_semigroups(0,16,2) instance Copointed (Arg a) where   copoint (Arg _ b) = b-#endif -instance Copointed w => Copointed (EnvT e w) where-  copoint = copoint . lowerEnvT--instance Copointed w => Copointed (StoreT s w) where-  copoint (StoreT wf s) = copoint wf s-+#ifdef MIN_VERSION_semigroupoids instance Copointed f => Copointed (WrappedApplicative f) where   copoint = copoint . unwrapApplicative -instance Copointed m => Copointed (WrappedMonad m) where-  copoint = copoint . unwrapMonad- instance Copointed f => Copointed (MaybeApply f) where   copoint (MaybeApply (Left fa)) = copoint fa   copoint (MaybeApply (Right a)) = a+#endif++instance Copointed Par1 where+  copoint = unPar1++instance Copointed f => Copointed (M1 i c f) where+  copoint = copoint . unM1++instance Copointed f => Copointed (Rec1 f) where+  copoint = copoint . unRec1++instance (Copointed f, Copointed g) => Copointed (f :+: g) where+  copoint (L1 a) = copoint a+  copoint (R1 a) = copoint a++instance (Copointed f, Copointed g) => Copointed (f :.: g) where+  copoint = copoint . copoint . unComp1

src/Data/Pointed.hs view

@@ -1,63 +1,92 @@ {-# LANGUAGE CPP #-} {-# LANGUAGE TypeFamilies #-}-#if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702-{-# LANGUAGE Safe #-}+{-# LANGUAGE TypeOperators #-}+{-# OPTIONS_GHC -Wno-deprecations #-}++#ifndef MIN_VERSION_base+#define MIN_VERSION_base(x,y,z) 0 #endif-{-# OPTIONS_GHC -fno-warn-deprecations #-}+ module Data.Pointed where  import Control.Arrow import Control.Applicative-import Control.Comonad-import Control.Concurrent.STM-import Data.Default.Class import qualified Data.Monoid as Monoid-import Data.Semigroup as Semigroup-import Data.Functor.Identity-import Data.Sequence (Seq, ViewL(..), ViewR(..))-import qualified Data.Sequence as Seq-import Data.Tree (Tree(..))-import Data.Hashable-import Data.HashMap.Lazy (HashMap)-import qualified Data.HashMap.Lazy as HashMap+import Data.Default.Class+import GHC.Generics++#ifdef MIN_VERSION_comonad+import Control.Comonad+#endif++#ifdef MIN_VERSION_containers import Data.Map (Map) import qualified Data.Map as Map import Data.Set (Set) import qualified Data.Set as Set+import Data.Sequence (Seq, ViewL(..), ViewR(..))+import qualified Data.Sequence as Seq+import Data.Tree (Tree(..))+#endif++#ifdef MIN_VERSION_kan_extensions+import Data.Functor.Day.Curried+#endif++import Data.Semigroup as Semigroup+import Data.List.NonEmpty (NonEmpty(..))++#ifdef MIN_VERSION_semigroupoids import Data.Functor.Bind-import Data.Functor.Constant-import Data.Functor.Kan.Rift-import qualified Data.Functor.Product as Functor+import Data.Semigroupoid.Static+#endif++#ifdef MIN_VERSION_stm+import Control.Concurrent.STM+#endif++import Data.Functor.Identity+ import Data.Functor.Compose+import qualified Data.Functor.Product as Functor++#ifdef MIN_VERSION_transformers+import Data.Functor.Constant import Data.Functor.Reverse+import qualified Control.Monad.Trans.RWS.Lazy as Lazy+import qualified Control.Monad.Trans.RWS.Strict as Strict+import qualified Control.Monad.Trans.Writer.Lazy as Lazy+import qualified Control.Monad.Trans.Writer.Strict as Strict+import qualified Control.Monad.Trans.State.Lazy as Lazy+import qualified Control.Monad.Trans.State.Strict as Strict import Control.Applicative.Backwards import Control.Applicative.Lift import Control.Monad.Trans.Cont-import Control.Monad.Trans.Error import Control.Monad.Trans.Except-import Control.Monad.Trans.List import Control.Monad.Trans.Maybe import Control.Monad.Trans.Identity import Control.Monad.Trans.Reader-import Data.List.NonEmpty-import qualified Control.Monad.Trans.RWS.Lazy as Lazy-import qualified Control.Monad.Trans.RWS.Strict as Strict-import qualified Control.Monad.Trans.Writer.Lazy as Lazy-import qualified Control.Monad.Trans.Writer.Strict as Strict-import qualified Control.Monad.Trans.State.Lazy as Lazy-import qualified Control.Monad.Trans.State.Strict as Strict-import Data.Semigroupoid.Static-import Data.Tagged++# if !(MIN_VERSION_transformers(0,6,0))+import Control.Monad.Trans.Error+import Control.Monad.Trans.List+# endif+#endif+ import Data.Proxy -class Pointed p where-  point :: a -> p a+#ifdef MIN_VERSION_tagged+import Data.Tagged+#endif -instance Pointed Proxy where-  point _ = Proxy+#if defined(MIN_VERSION_unordered_containers)+import Data.Hashable+import Data.HashMap.Lazy (HashMap)+import qualified Data.HashMap.Lazy as HashMap+#endif -instance Pointed (Tagged a) where-  point = Tagged+class Pointed p where+  point :: a -> p a  instance Pointed [] where   point a = [a]@@ -71,15 +100,6 @@ instance Pointed IO where   point = return -instance Pointed STM where-  point = return--instance Pointed Tree where-  point a = Node a []--instance Pointed NonEmpty where-  point a = a :| []- instance Pointed ZipList where   point = pure @@ -92,23 +112,23 @@ instance Default e => Pointed ((,)e) where   point = (,) def -instance Monad m => Pointed (WrappedMonad m) where-  point = WrapMonad . return- instance Default m => Pointed (Const m) where   point _ = Const def +instance Monad m => Pointed (WrappedMonad m) where+  point = WrapMonad . return+ instance Arrow a => Pointed (WrappedArrow a b) where   point = pure -instance Pointed Dual where-  point = Dual+instance Pointed Monoid.Dual where+  point = Monoid.Dual -instance Pointed Endo where-  point = Endo . const+instance Pointed Monoid.Endo where+  point = Monoid.Endo . const -instance Pointed Sum where-  point = Sum+instance Pointed Monoid.Sum where+  point = Monoid.Sum  instance Pointed Monoid.Product where   point = Monoid.Product@@ -119,6 +139,51 @@ instance Pointed Monoid.Last where   point = Monoid.Last . Just +#ifdef MIN_VERSION_comonad+instance Pointed (Cokleisli w a) where+  point = Cokleisli . const+#endif++#ifdef MIN_VERSION_containers+instance Pointed Tree where+  point a = Node a []++instance Default k => Pointed (Map k) where+  point = Map.singleton def++instance Pointed Seq where+  point = Seq.singleton++instance Pointed ViewL where+  point a = a :< Seq.empty++instance Pointed ViewR where+  point a = Seq.empty :> a++instance Pointed Set where+  point = Set.singleton+#endif++#ifdef MIN_VERSION_kan_extensions+instance (Functor g, g ~ h) => Pointed (Curried g h) where+  point a = Curried (fmap ($ a))+  {-# INLINE point #-}+#endif++#ifdef MIN_VERSION_semigroupoids+instance Pointed m => Pointed (Static m a) where+  point = Static . point . const++instance Pointed f => Pointed (WrappedApplicative f) where+  point = WrapApplicative . point++instance Pointed (MaybeApply f) where+  point = MaybeApply . Right+#endif++instance Pointed NonEmpty where+  point a = a :| []+ instance Pointed Semigroup.First where   point = Semigroup.First @@ -131,78 +196,61 @@ instance Pointed Semigroup.Min where   point = Semigroup.Min +#if !(MIN_VERSION_base(4,16,0)) instance Pointed Option where   point = Option . Just+#endif  instance Pointed WrappedMonoid where   point = WrapMonoid -#if MIN_VERSION_semigroups(0,16,2) instance Default a => Pointed (Arg a) where   point = Arg def-#endif -instance (Default k, Hashable k) => Pointed (HashMap k) where-  point = HashMap.singleton def--instance Default k => Pointed (Map k) where-  point = Map.singleton def--instance Pointed Seq where-  point = Seq.singleton--instance Pointed ViewL where-  point a = a :< Seq.empty+#ifdef MIN_VERSION_stm+instance Pointed STM where+  point = return+#endif -instance Pointed ViewR where-  point a = Seq.empty :> a+instance Pointed Proxy where+  point _ = Proxy -instance Pointed Set where-  point = Set.singleton+#ifdef MIN_VERSION_tagged+instance Pointed (Tagged a) where+  point = Tagged+#endif  instance (Pointed p, Pointed q) => Pointed (Compose p q) where   point = Compose . point . point -instance Pointed f => Pointed (Reverse f) where-  point = Reverse . point--instance Pointed f => Pointed (Backwards f) where-  point = Backwards . point--instance Pointed (Lift f) where-  point = Pure--instance (Functor g, g ~ h) => Pointed (Rift g h) where-  point a = Rift (fmap ($a))-  {-# INLINE point #-}- instance (Pointed p, Pointed q) => Pointed (Functor.Product p q) where   point a = Functor.Pair (point a) (point a) -instance Default m => Pointed (Constant m) where-  point _ = Constant def-+#ifdef MIN_VERSION_transformers instance Pointed (ContT r m) where   point a = ContT ($ a) -instance Pointed m => Pointed (ErrorT e m) where-  point = ErrorT . point . Right- instance Pointed m => Pointed (ExceptT e m) where   point = ExceptT . point . Right  instance Pointed m => Pointed (IdentityT m) where   point = IdentityT . point -instance Pointed m => Pointed (ListT m) where-  point = ListT . point . point- instance Pointed m => Pointed (MaybeT m) where   point = MaybeT . point . point  instance Pointed m => Pointed (ReaderT r m) where   point = ReaderT . const . point +instance Default m => Pointed (Constant m) where+  point _ = Constant def++instance Pointed m => Pointed (Lazy.StateT s m) where+  point a = Lazy.StateT $ \s -> point (a, s)++instance Pointed m => Pointed (Strict.StateT s m) where+  point a = Strict.StateT $ \s -> point (a, s)+ instance (Default w, Pointed m) => Pointed (Lazy.RWST r w s m) where   point a = Lazy.RWST $ \_ s -> point (a, s, def) @@ -215,20 +263,43 @@ instance (Default w, Pointed m) => Pointed (Strict.WriterT w m) where   point a = Strict.WriterT $ point (a, def) -instance Pointed m => Pointed (Lazy.StateT s m) where-  point a = Lazy.StateT $ \s -> point (a, s)+instance Pointed f => Pointed (Reverse f) where+  point = Reverse . point -instance Pointed m => Pointed (Strict.StateT s m) where-  point a = Strict.StateT $ \s -> point (a, s)+instance Pointed f => Pointed (Backwards f) where+  point = Backwards . point -instance Pointed m => Pointed (Static m a) where-  point = Static . point . const+instance Pointed (Lift f) where+  point = Pure -instance Pointed (Cokleisli w a) where-  point = Cokleisli . const+# if !(MIN_VERSION_transformers(0,6,0))+instance Pointed m => Pointed (ErrorT e m) where+  point = ErrorT . point . Right -instance Pointed f => Pointed (WrappedApplicative f) where-  point = WrapApplicative . point+instance Pointed m => Pointed (ListT m) where+  point = ListT . point . point+# endif+#endif -instance Pointed (MaybeApply f) where-  point = MaybeApply . Right+#if defined(MIN_VERSION_unordered_containers)+instance (Default k, Hashable k) => Pointed (HashMap k) where+  point = HashMap.singleton def+#endif++instance Pointed U1 where+  point _ = U1++instance Pointed Par1 where+  point = Par1++instance Pointed f => Pointed (Rec1 f) where+  point = Rec1 . point++instance Pointed f => Pointed (M1 i c f) where+  point = M1 . point++instance (Pointed f, Pointed g) => Pointed (f :*: g) where+  point a = point a :*: point a++instance (Pointed f, Pointed g) => Pointed (f :.: g) where+  point = Comp1 . point . point