papa-semigroupoids-export 0.3.0 → 0.3.1
raw patch · 7 files changed
+112/−197 lines, 7 filesdep −QuickCheckdep −directorydep −doctestdep ~basesetup-changedPVP ok
version bump matches the API change (PVP)
Dependencies removed: QuickCheck, directory, doctest, filepath, template-haskell
Dependency ranges changed: base
API changes (from Hackage documentation)
+ Papa.Semigroupoids.Export: (-<-) :: Bind m => (b -> m c) -> (a -> m b) -> a -> m c
+ Papa.Semigroupoids.Export: (-<<) :: Bind m => (a -> m b) -> m a -> m b
+ Papa.Semigroupoids.Export: (->-) :: Bind m => (a -> m b) -> (b -> m c) -> a -> m c
+ Papa.Semigroupoids.Export: (.>) :: Apply f => f a -> f b -> f b
+ Papa.Semigroupoids.Export: (.>>) :: Biapply p => p a b -> p c d -> p c d
+ Papa.Semigroupoids.Export: (<!>) :: Alt f => f a -> f a -> f a
+ Papa.Semigroupoids.Export: (<.) :: Apply f => f a -> f b -> f a
+ Papa.Semigroupoids.Export: (<..>) :: Apply w => w a -> w (a -> b) -> w b
+ Papa.Semigroupoids.Export: (<.>) :: Apply f => f (a -> b) -> f a -> f b
+ Papa.Semigroupoids.Export: (<<$>>) :: (a -> b) -> a -> b
+ Papa.Semigroupoids.Export: (<<.) :: Biapply p => p a b -> p c d -> p a b
+ Papa.Semigroupoids.Export: (<<..>>) :: Biapply p => p a c -> p (a -> b) (c -> d) -> p b d
+ Papa.Semigroupoids.Export: (<<.>>) :: Biapply p => p (a -> b) (c -> d) -> p a c -> p b d
+ Papa.Semigroupoids.Export: (>>-) :: Bind m => m a -> (a -> m b) -> m b
+ Papa.Semigroupoids.Export: apDefault :: Bind f => f (a -> b) -> f a -> f b
+ Papa.Semigroupoids.Export: asum1 :: (Foldable1 t, Alt m) => t (m a) -> m a
+ Papa.Semigroupoids.Export: bifold1 :: (Bifoldable1 t, Semigroup m) => t m m -> m
+ Papa.Semigroupoids.Export: bifoldMap1 :: (Bifoldable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m
+ Papa.Semigroupoids.Export: bifoldMap1Default :: (Bitraversable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m
+ Papa.Semigroupoids.Export: bifoldMapDefault1 :: (Bifoldable1 t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m
+ Papa.Semigroupoids.Export: bifor1_ :: (Bifoldable1 t, Apply f) => t a c -> (a -> f b) -> (c -> f d) -> f ()
+ Papa.Semigroupoids.Export: bilift2 :: Biapply w => (a -> b -> c) -> (d -> e -> f) -> w a d -> w b e -> w c f
+ Papa.Semigroupoids.Export: bilift3 :: Biapply w => (a -> b -> c -> d) -> (e -> f -> g -> h) -> w a e -> w b f -> w c g -> w d h
+ Papa.Semigroupoids.Export: bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d
+ Papa.Semigroupoids.Export: bisequence1 :: (Bitraversable1 t, Apply f) => t (f a) (f b) -> f (t a b)
+ Papa.Semigroupoids.Export: bisequenceA1_ :: (Bifoldable1 t, Apply f) => t (f a) (f b) -> f ()
+ Papa.Semigroupoids.Export: bitraverse1 :: (Bitraversable1 t, Apply f) => (a -> f b) -> (c -> f d) -> t a c -> f (t b d)
+ Papa.Semigroupoids.Export: bitraverse1_ :: (Bifoldable1 t, Apply f) => (a -> f b) -> (c -> f d) -> t a c -> f ()
+ Papa.Semigroupoids.Export: class Functor f => Alt (f :: * -> *)
+ Papa.Semigroupoids.Export: class Functor f => Apply (f :: * -> *)
+ Papa.Semigroupoids.Export: class Bifunctor p => Biapply (p :: * -> * -> *)
+ Papa.Semigroupoids.Export: class Bifoldable t => Bifoldable1 (t :: * -> * -> *)
+ Papa.Semigroupoids.Export: class Bifunctor (p :: * -> * -> *)
+ Papa.Semigroupoids.Export: class Apply m => Bind (m :: * -> *)
+ Papa.Semigroupoids.Export: class MonadTrans t => BindTrans (t :: (* -> *) -> * -> *)
+ Papa.Semigroupoids.Export: class (Bifoldable1 t, Bitraversable t) => Bitraversable1 (t :: * -> * -> *)
+ Papa.Semigroupoids.Export: class Functor w => Extend (w :: * -> *)
+ Papa.Semigroupoids.Export: class Foldable t => Foldable1 (t :: * -> *)
+ Papa.Semigroupoids.Export: class Semigroupoid k k1 => Groupoid k (k1 :: k -> k -> *)
+ Papa.Semigroupoids.Export: class Semigroupoid k k1 => Ob k (k1 :: k -> k -> *) (a :: k)
+ Papa.Semigroupoids.Export: class Alt f => Plus (f :: * -> *)
+ Papa.Semigroupoids.Export: class Semigroupoid k (c :: k -> k -> *)
+ Papa.Semigroupoids.Export: class (Foldable1 t, Traversable t) => Traversable1 (t :: * -> *)
+ Papa.Semigroupoids.Export: data MaybeApply (f :: * -> *) a :: (* -> *) -> * -> *
+ Papa.Semigroupoids.Export: data Semi k k1 m (a :: k1) (b :: k) :: forall k k1. * -> k1 -> k -> *
+ Papa.Semigroupoids.Export: data Static (f :: * -> *) a b :: (* -> *) -> * -> * -> *
+ Papa.Semigroupoids.Export: data WrappedApplicative (f :: * -> *) a :: (* -> *) -> * -> *
+ Papa.Semigroupoids.Export: data WrappedCategory k k1 (k2 :: k1 -> k -> *) (a :: k1) (b :: k) :: forall k k1. (k1 -> k -> *) -> k1 -> k -> *
+ Papa.Semigroupoids.Export: duplicated :: Extend w => w a -> w (w a)
+ Papa.Semigroupoids.Export: extended :: Extend w => (w a -> b) -> w a -> w b
+ Papa.Semigroupoids.Export: first :: Bifunctor p => (a -> b) -> p a c -> p b c
+ Papa.Semigroupoids.Export: fold1 :: (Foldable1 t, Semigroup m) => t m -> m
+ Papa.Semigroupoids.Export: foldMap1 :: (Foldable1 t, Semigroup m) => (a -> m) -> t a -> m
+ Papa.Semigroupoids.Export: foldMap1Default :: (Traversable1 f, Semigroup m) => (a -> m) -> f a -> m
+ Papa.Semigroupoids.Export: foldMapDefault1 :: (Foldable1 t, Monoid m) => (a -> m) -> t a -> m
+ Papa.Semigroupoids.Export: for1_ :: (Foldable1 t, Apply f) => t a -> (a -> f b) -> f ()
+ Papa.Semigroupoids.Export: infixl 4 <..>
+ Papa.Semigroupoids.Export: infixr 1 ->-
+ Papa.Semigroupoids.Export: intercalate1 :: (Foldable1 t, Semigroup m) => m -> t m -> m
+ Papa.Semigroupoids.Export: intercalateMap1 :: (Foldable1 t, Semigroup m) => m -> (a -> m) -> t a -> m
+ Papa.Semigroupoids.Export: inv :: Groupoid k k1 => k1 a b -> k1 b a
+ Papa.Semigroupoids.Export: join :: Bind m => m (m a) -> m a
+ Papa.Semigroupoids.Export: liftB :: (BindTrans t, Bind b) => b a -> t b a
+ Papa.Semigroupoids.Export: liftF2 :: Apply w => (a -> b -> c) -> w a -> w b -> w c
+ Papa.Semigroupoids.Export: liftF3 :: Apply w => (a -> b -> c -> d) -> w a -> w b -> w c -> w d
+ Papa.Semigroupoids.Export: o :: Semigroupoid k c => c j k1 -> c i j -> c i k1
+ Papa.Semigroupoids.Export: returning :: Functor f => f a -> (a -> b) -> f b
+ Papa.Semigroupoids.Export: second :: Bifunctor p => (b -> c) -> p a b -> p a c
+ Papa.Semigroupoids.Export: semiid :: Ob k k1 a => k1 a a
+ Papa.Semigroupoids.Export: sequence1 :: (Traversable1 t, Apply f) => t (f b) -> f (t b)
+ Papa.Semigroupoids.Export: sequenceA1_ :: (Foldable1 t, Apply f) => t (f a) -> f ()
+ Papa.Semigroupoids.Export: traverse1 :: (Traversable1 t, Apply f) => (a -> f b) -> t a -> f (t b)
+ Papa.Semigroupoids.Export: traverse1_ :: (Foldable1 t, Apply f) => (a -> f b) -> t a -> f ()
+ Papa.Semigroupoids.Export: zero :: Plus f => f a
Files
- LICENCE +77/−0
- LICENSE +0/−77
- Setup.hs +2/−0
- Setup.lhs +0/−44
- papa-semigroupoids-export.cabal +3/−28
- src/Papa/Semigroupoids/Export.hs +30/−16
- test/doctests.hs +0/−32
+ LICENCE view
@@ -0,0 +1,77 @@+CSIRO Open Source Software License Agreement (variation of the BSD / MIT+License)++Copyright (c) 2016, Commonwealth Scientific and Industrial Research Organisation+(CSIRO) ABN 41 687 119 230.++All rights reserved. CSIRO is willing to grant you a license to this+aemo-webservice on the following terms, except where otherwise indicated for+third party material.++Redistribution and use of this software in source and binary forms, with or+without modification, are permitted provided that the following conditions are+met:++* Redistributions of source code must retain the above copyright notice, this+ list of conditions and the following disclaimer.++* Redistributions in binary form must reproduce the above copyright notice, this+ list of conditions and the following disclaimer in the documentation and/or+ other materials provided with the distribution.++* Neither the name of CSIRO nor the names of its contributors may be used to+ endorse or promote products derived from this software without specific prior+ written permission of CSIRO.++EXCEPT AS EXPRESSLY STATED IN THIS AGREEMENT AND TO THE FULL EXTENT PERMITTED BY+APPLICABLE LAW, THE SOFTWARE IS PROVIDED "AS-IS". CSIRO MAKES NO+REPRESENTATIONS, WARRANTIES OR CONDITIONS OF ANY KIND, EXPRESS OR IMPLIED,+INCLUDING BUT NOT LIMITED TO ANY REPRESENTATIONS, WARRANTIES OR CONDITIONS+REGARDING THE CONTENTS OR ACCURACY OF THE SOFTWARE, OR OF TITLE,+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NON-INFRINGEMENT, THE ABSENCE+OF LATENT OR OTHER DEFECTS, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT+DISCOVERABLE.++TO THE FULL EXTENT PERMITTED BY APPLICABLE LAW, IN NO EVENT SHALL CSIRO BE+LIABLE ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION, IN AN ACTION FOR+BREACH OF CONTRACT, NEGLIGENCE OR OTHERWISE) FOR ANY CLAIM, LOSS, DAMAGES OR+OTHER LIABILITY HOWSOEVER INCURRED. WITHOUT LIMITING THE SCOPE OF THE PREVIOUS+SENTENCE THE EXCLUSION OF LIABILITY SHALL INCLUDE: LOSS OF PRODUCTION OR+OPERATION TIME, LOSS, DAMAGE OR CORRUPTION OF DATA OR RECORDS; OR LOSS OF+ANTICIPATED SAVINGS, OPPORTUNITY, REVENUE, PROFIT OR GOODWILL, OR OTHER ECONOMIC+LOSS; OR ANY SPECIAL, INCIDENTAL, INDIRECT, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY+DAMAGES, ARISING OUT OF OR IN CONNECTION WITH THIS AGREEMENT, ACCESS OF THE+SOFTWARE OR ANY OTHER DEALINGS WITH THE SOFTWARE, EVEN IF CSIRO HAS BEEN ADVISED+OF THE POSSIBILITY OF SUCH CLAIM, LOSS, DAMAGES OR OTHER LIABILITY.++APPLICABLE LEGISLATION SUCH AS THE AUSTRALIAN CONSUMER LAW MAY APPLY+REPRESENTATIONS, WARRANTIES, OR CONDITIONS, OR IMPOSES OBLIGATIONS OR LIABILITY+ON CSIRO THAT CANNOT BE EXCLUDED, RESTRICTED OR MODIFIED TO THE FULL EXTENT SET+OUT IN THE EXPRESS TERMS OF THIS CLAUSE ABOVE "CONSUMER GUARANTEES". TO THE+EXTENT THAT SUCH CONSUMER GUARANTEES CONTINUE TO APPLY, THEN TO THE FULL EXTENT+PERMITTED BY THE APPLICABLE LEGISLATION, THE LIABILITY OF CSIRO UNDER THE+RELEVANT CONSUMER GUARANTEE IS LIMITED (WHERE PERMITTED AT CSIRO'S OPTION) TO+ONE OF FOLLOWING REMEDIES OR SUBSTANTIALLY EQUIVALENT REMEDIES:++(a) THE REPLACEMENT OF THE SOFTWARE, THE SUPPLY OF EQUIVALENT+ SOFTWARE, OR SUPPLYING RELEVANT SERVICES AGAIN;+(b) THE REPAIR OF THE SOFTWARE;+(c) THE PAYMENT OF THE COST OF REPLACING THE+ SOFTWARE, OF ACQUIRING EQUIVALENT SOFTWARE, HAVING THE+ RELEVANT SERVICES SUPPLIED AGAIN, OR HAVING THE SOFTWARE+ REPAIRED.++IN THIS CLAUSE, CSIRO INCLUDES ANY THIRD PARTY AUTHOR OR OWNER OF ANY PART OF+THE SOFTWARE OR MATERIAL DISTRIBUTED WITH IT. CSIRO MAY ENFORCE ANY RIGHTS ON+BEHALF OF THE RELEVANT THIRD PARTY.++Third Party Components++The following third party components are distributed with the Software. You+agree to comply with the license terms for these components as part of accessing+the Software. Other third party software may also be identified in separate+files distributed with the Software.++___________________________________________________________________++___________________________________________________________________
− LICENSE
@@ -1,77 +0,0 @@-CSIRO Open Source Software License Agreement (variation of the BSD / MIT-License)--Copyright (c) 2016, Commonwealth Scientific and Industrial Research Organisation-(CSIRO) ABN 41 687 119 230.--All rights reserved. CSIRO is willing to grant you a license to this-aemo-webservice on the following terms, except where otherwise indicated for-third party material.--Redistribution and use of this software in source and binary forms, with or-without modification, are permitted provided that the following conditions are-met:--* Redistributions of source code must retain the above copyright notice, this- list of conditions and the following disclaimer.--* Redistributions in binary form must reproduce the above copyright notice, this- list of conditions and the following disclaimer in the documentation and/or- other materials provided with the distribution.--* Neither the name of CSIRO nor the names of its contributors may be used to- endorse or promote products derived from this software without specific prior- written permission of CSIRO.--EXCEPT AS EXPRESSLY STATED IN THIS AGREEMENT AND TO THE FULL EXTENT PERMITTED BY-APPLICABLE LAW, THE SOFTWARE IS PROVIDED "AS-IS". CSIRO MAKES NO-REPRESENTATIONS, WARRANTIES OR CONDITIONS OF ANY KIND, EXPRESS OR IMPLIED,-INCLUDING BUT NOT LIMITED TO ANY REPRESENTATIONS, WARRANTIES OR CONDITIONS-REGARDING THE CONTENTS OR ACCURACY OF THE SOFTWARE, OR OF TITLE,-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NON-INFRINGEMENT, THE ABSENCE-OF LATENT OR OTHER DEFECTS, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT-DISCOVERABLE.--TO THE FULL EXTENT PERMITTED BY APPLICABLE LAW, IN NO EVENT SHALL CSIRO BE-LIABLE ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION, IN AN ACTION FOR-BREACH OF CONTRACT, NEGLIGENCE OR OTHERWISE) FOR ANY CLAIM, LOSS, DAMAGES OR-OTHER LIABILITY HOWSOEVER INCURRED. WITHOUT LIMITING THE SCOPE OF THE PREVIOUS-SENTENCE THE EXCLUSION OF LIABILITY SHALL INCLUDE: LOSS OF PRODUCTION OR-OPERATION TIME, LOSS, DAMAGE OR CORRUPTION OF DATA OR RECORDS; OR LOSS OF-ANTICIPATED SAVINGS, OPPORTUNITY, REVENUE, PROFIT OR GOODWILL, OR OTHER ECONOMIC-LOSS; OR ANY SPECIAL, INCIDENTAL, INDIRECT, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY-DAMAGES, ARISING OUT OF OR IN CONNECTION WITH THIS AGREEMENT, ACCESS OF THE-SOFTWARE OR ANY OTHER DEALINGS WITH THE SOFTWARE, EVEN IF CSIRO HAS BEEN ADVISED-OF THE POSSIBILITY OF SUCH CLAIM, LOSS, DAMAGES OR OTHER LIABILITY.--APPLICABLE LEGISLATION SUCH AS THE AUSTRALIAN CONSUMER LAW MAY APPLY-REPRESENTATIONS, WARRANTIES, OR CONDITIONS, OR IMPOSES OBLIGATIONS OR LIABILITY-ON CSIRO THAT CANNOT BE EXCLUDED, RESTRICTED OR MODIFIED TO THE FULL EXTENT SET-OUT IN THE EXPRESS TERMS OF THIS CLAUSE ABOVE "CONSUMER GUARANTEES". TO THE-EXTENT THAT SUCH CONSUMER GUARANTEES CONTINUE TO APPLY, THEN TO THE FULL EXTENT-PERMITTED BY THE APPLICABLE LEGISLATION, THE LIABILITY OF CSIRO UNDER THE-RELEVANT CONSUMER GUARANTEE IS LIMITED (WHERE PERMITTED AT CSIRO'S OPTION) TO-ONE OF FOLLOWING REMEDIES OR SUBSTANTIALLY EQUIVALENT REMEDIES:--(a) THE REPLACEMENT OF THE SOFTWARE, THE SUPPLY OF EQUIVALENT- SOFTWARE, OR SUPPLYING RELEVANT SERVICES AGAIN;-(b) THE REPAIR OF THE SOFTWARE;-(c) THE PAYMENT OF THE COST OF REPLACING THE- SOFTWARE, OF ACQUIRING EQUIVALENT SOFTWARE, HAVING THE- RELEVANT SERVICES SUPPLIED AGAIN, OR HAVING THE SOFTWARE- REPAIRED.--IN THIS CLAUSE, CSIRO INCLUDES ANY THIRD PARTY AUTHOR OR OWNER OF ANY PART OF-THE SOFTWARE OR MATERIAL DISTRIBUTED WITH IT. CSIRO MAY ENFORCE ANY RIGHTS ON-BEHALF OF THE RELEVANT THIRD PARTY.--Third Party Components--The following third party components are distributed with the Software. You-agree to comply with the license terms for these components as part of accessing-the Software. Other third party software may also be identified in separate-files distributed with the Software.--___________________________________________________________________--___________________________________________________________________
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
− Setup.lhs
@@ -1,44 +0,0 @@-#!/usr/bin/env runhaskell-\begin{code}-{-# OPTIONS_GHC -Wall #-}-module Main (main) where--import Data.List ( nub )-import Data.Version ( showVersion )-import Distribution.Package ( PackageName(PackageName), PackageId, InstalledPackageId, packageVersion, packageName )-import Distribution.PackageDescription ( PackageDescription(), TestSuite(..) )-import Distribution.Simple ( defaultMainWithHooks, UserHooks(..), simpleUserHooks )-import Distribution.Simple.Utils ( rewriteFile, createDirectoryIfMissingVerbose )-import Distribution.Simple.BuildPaths ( autogenModulesDir )-import Distribution.Simple.Setup ( BuildFlags(buildVerbosity), fromFlag )-import Distribution.Simple.LocalBuildInfo ( withLibLBI, withTestLBI, LocalBuildInfo(), ComponentLocalBuildInfo(componentPackageDeps) )-import Distribution.Verbosity ( Verbosity )-import System.FilePath ( (</>) )--main :: IO ()-main = defaultMainWithHooks simpleUserHooks- { buildHook = \pkg lbi hooks flags -> do- generateBuildModule (fromFlag (buildVerbosity flags)) pkg lbi- buildHook simpleUserHooks pkg lbi hooks flags- }--generateBuildModule :: Verbosity -> PackageDescription -> LocalBuildInfo -> IO ()-generateBuildModule verbosity pkg lbi = do- let dir = autogenModulesDir lbi- createDirectoryIfMissingVerbose verbosity True dir- withLibLBI pkg lbi $ \_ libcfg -> do- withTestLBI pkg lbi $ \suite suitecfg -> do- rewriteFile (dir </> "Build_" ++ testName suite ++ ".hs") $ unlines- [ "module Build_" ++ testName suite ++ " where"- , "deps :: [String]"- , "deps = " ++ (show $ formatdeps (testDeps libcfg suitecfg))- ]- where- formatdeps = map (formatone . snd)- formatone p = case packageName p of- PackageName n -> n ++ "-" ++ showVersion (packageVersion p)--testDeps :: ComponentLocalBuildInfo -> ComponentLocalBuildInfo -> [(InstalledPackageId, PackageId)]-testDeps xs ys = nub $ componentPackageDeps xs ++ componentPackageDeps ys--\end{code}
papa-semigroupoids-export.cabal view
@@ -1,7 +1,7 @@ name: papa-semigroupoids-export-version: 0.3.0+version: 0.3.1 license: BSD3-license-file: LICENSE+license-file: LICENCE author: Queensland Functional Programming Lab <oᴉ˙ldɟb@llǝʞsɐɥ> maintainer: Queensland Functional Programming Lab <oᴉ˙ldɟb@llǝʞsɐɥ> copyright: Copyright (c) 2017, Commonwealth Scientific and Industrial Research Organisation (CSIRO) ABN 41 687 119 230.@@ -14,7 +14,7 @@ homepage: https://github.com/qfpl/papa bug-reports: https://github.com/qfpl/papa/issues cabal-version: >= 1.10-build-type: Custom+build-type: Simple extra-source-files: changelog.md source-repository head@@ -43,28 +43,3 @@ exposed-modules: Papa.Semigroupoids.Export- -test-suite doctests- type:- exitcode-stdio-1.0-- main-is:- doctests.hs-- default-language:- Haskell2010-- build-depends:- base < 5 && >= 3- , doctest >= 0.9.7- , filepath >= 1.3- , directory >= 1.1- , QuickCheck >= 2.0- , template-haskell >= 2.8-- ghc-options:- -Wall- -threaded-- hs-source-dirs:- test
src/Papa/Semigroupoids/Export.hs view
@@ -1,21 +1,35 @@ {-# LANGUAGE NoImplicitPrelude #-} module Papa.Semigroupoids.Export( - module P+ Bifunctor(bimap, first, second), Biapply((<<.>>), (.>>), (<<.)), (<<$>>), (<<..>>), bilift2, bilift3,+ Alt((<!>)),+ Apply((<.>), (.>), (<.)), (<..>), liftF2, liftF3, WrappedApplicative(unwrapApplicative), MaybeApply(runMaybeApply),+ Bind((>>-), join), (-<<), (-<-), (->-), apDefault, returning,+ BindTrans(liftB),+ Extend(duplicated, extended),+ Plus(zero),+ Groupoid(inv),+ Bifoldable1(bifold1, bifoldMap1), bitraverse1_, bifor1_, bisequenceA1_, bifoldMapDefault1,+ Bitraversable1(bitraverse1, bisequence1), bifoldMap1Default,+ Foldable1(fold1, foldMap1), intercalate1, intercalateMap1, traverse1_, for1_, sequenceA1_, foldMapDefault1, asum1,+ Traversable1(traverse1, sequence1), foldMap1Default,+ Semigroupoid(o), WrappedCategory(unwrapCategory), Semi(getSemi),+ Ob(semiid),+ Static(runStatic) ) where -import Data.Bifunctor.Apply as P(Bifunctor(bimap, first, second), Biapply((<<.>>), (.>>), (<<.)), (<<$>>), (<<..>>), bilift2, bilift3)-import Data.Functor.Alt as P(Alt((<!>)))-import Data.Functor.Apply as P(Apply((<.>), (.>), (<.)), (<..>), liftF2, liftF3, WrappedApplicative(unwrapApplicative), MaybeApply(runMaybeApply))-import Data.Functor.Bind as P(Bind((>>-), join), (-<<), (-<-), (->-), apDefault, returning)-import Data.Functor.Bind.Trans as P(BindTrans(liftB))-import Data.Functor.Extend as P(Extend(duplicated, extended))-import Data.Functor.Plus as P(Plus(zero))-import Data.Groupoid as P(Groupoid(inv))-import Data.Semigroup.Bifoldable as P(Bifoldable1(bifold1, bifoldMap1), bitraverse1_, bifor1_, bisequenceA1_, bifoldMapDefault1)-import Data.Semigroup.Bitraversable as P(Bitraversable1(bitraverse1, bisequence1), bifoldMap1Default)-import Data.Semigroup.Foldable as P(Foldable1(fold1, foldMap1), intercalate1, intercalateMap1, traverse1_, for1_, sequenceA1_, foldMapDefault1, asum1)-import Data.Semigroup.Traversable as P(Traversable1(traverse1, sequence1), foldMap1Default)-import Data.Semigroupoid as P(Semigroupoid(o), WrappedCategory(unwrapCategory), Semi(getSemi))-import Data.Semigroupoid.Ob as P(Ob(semiid))-import Data.Semigroupoid.Static as P(Static(runStatic))+import Data.Bifunctor.Apply (Bifunctor(bimap, first, second), Biapply((<<.>>), (.>>), (<<.)), (<<$>>), (<<..>>), bilift2, bilift3)+import Data.Functor.Alt (Alt((<!>)))+import Data.Functor.Apply (Apply((<.>), (.>), (<.)), (<..>), liftF2, liftF3, WrappedApplicative(unwrapApplicative), MaybeApply(runMaybeApply))+import Data.Functor.Bind (Bind((>>-), join), (-<<), (-<-), (->-), apDefault, returning)+import Data.Functor.Bind.Trans (BindTrans(liftB))+import Data.Functor.Extend (Extend(duplicated, extended))+import Data.Functor.Plus (Plus(zero))+import Data.Groupoid (Groupoid(inv))+import Data.Semigroup.Bifoldable (Bifoldable1(bifold1, bifoldMap1), bitraverse1_, bifor1_, bisequenceA1_, bifoldMapDefault1)+import Data.Semigroup.Bitraversable (Bitraversable1(bitraverse1, bisequence1), bifoldMap1Default)+import Data.Semigroup.Foldable (Foldable1(fold1, foldMap1), intercalate1, intercalateMap1, traverse1_, for1_, sequenceA1_, foldMapDefault1, asum1)+import Data.Semigroup.Traversable (Traversable1(traverse1, sequence1), foldMap1Default)+import Data.Semigroupoid (Semigroupoid(o), WrappedCategory(unwrapCategory), Semi(getSemi))+import Data.Semigroupoid.Ob (Ob(semiid))+import Data.Semigroupoid.Static (Static(runStatic))
− test/doctests.hs
@@ -1,32 +0,0 @@-module Main where--import Build_doctests (deps)-import Control.Applicative-import Control.Monad-import Data.List-import System.Directory-import System.FilePath-import Test.DocTest--main ::- IO ()-main =- getSources >>= \sources -> doctest $- "-isrc"- : "-idist/build/autogen"- : "-optP-include"- : "-optPdist/build/autogen/cabal_macros.h"- : "-hide-all-packages"- : map ("-package="++) deps ++ sources--getSources :: IO [FilePath]-getSources = filter (isSuffixOf ".hs") <$> go "src"- where- go dir = do- (dirs, files) <- getFilesAndDirectories dir- (files ++) . concat <$> mapM go dirs--getFilesAndDirectories :: FilePath -> IO ([FilePath], [FilePath])-getFilesAndDirectories dir = do- c <- map (dir </>) . filter (`notElem` ["..", "."]) <$> getDirectoryContents dir- (,) <$> filterM doesDirectoryExist c <*> filterM doesFileExist c