papa-bifunctors-export 0.3.0 → 0.3.1
raw patch · 7 files changed
+106/−194 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.Bifunctors.Export: (*>>) :: Biapplicative p => p a b -> p c d -> p c d
+ Papa.Bifunctors.Export: (<<$>>) :: (a -> b) -> a -> b
+ Papa.Bifunctors.Export: (<<*) :: Biapplicative p => p a b -> p c d -> p a b
+ Papa.Bifunctors.Export: (<<**>>) :: Biapplicative p => p a c -> p (a -> b) (c -> d) -> p b d
+ Papa.Bifunctors.Export: (<<*>>) :: Biapplicative p => p (a -> b) (c -> d) -> p a c -> p b d
+ Papa.Bifunctors.Export: Join :: p a a -> Join k
+ Papa.Bifunctors.Export: Joker :: g b -> Joker k k1
+ Papa.Bifunctors.Export: Tannen :: f (p a b) -> Tannen k k1 k2
+ Papa.Bifunctors.Export: WrapBifunctor :: p a b -> WrappedBifunctor k k1
+ Papa.Bifunctors.Export: [runJoin] :: Join k -> p a a
+ Papa.Bifunctors.Export: [runJoker] :: Joker k k1 -> g b
+ Papa.Bifunctors.Export: [runTannen] :: Tannen k k1 k2 -> f (p a b)
+ Papa.Bifunctors.Export: [unwrapBifunctor] :: WrappedBifunctor k k1 -> p a b
+ Papa.Bifunctors.Export: biList :: Bifoldable t => t a a -> [a]
+ Papa.Bifunctors.Export: biall :: Bifoldable t => (a -> Bool) -> (b -> Bool) -> t a b -> Bool
+ Papa.Bifunctors.Export: biand :: Bifoldable t => t Bool Bool -> Bool
+ Papa.Bifunctors.Export: biany :: Bifoldable t => (a -> Bool) -> (b -> Bool) -> t a b -> Bool
+ Papa.Bifunctors.Export: biasum :: (Bifoldable t, Alternative f) => t (f a) (f a) -> f a
+ Papa.Bifunctors.Export: bibind :: BifunctorMonad k k1 t => (:->) k k1 p (t q) -> (:->) k k1 (t p) (t q)
+ Papa.Bifunctors.Export: biduplicate :: BifunctorComonad k k1 t => t p a b -> t (t p) a b
+ Papa.Bifunctors.Export: bielem :: (Bifoldable t, Eq a) => a -> t a a -> Bool
+ Papa.Bifunctors.Export: biextend :: BifunctorComonad k k1 t => (:->) k k1 (t p) q -> (:->) k k1 (t p) (t q)
+ Papa.Bifunctors.Export: biextract :: BifunctorComonad k k1 t => t p a b -> p a b
+ Papa.Bifunctors.Export: bifind :: Bifoldable t => (a -> Bool) -> t a a -> Maybe a
+ Papa.Bifunctors.Export: bifmap :: BifunctorFunctor k k1 k2 k3 t => (:->) k2 k3 p q -> (:->) k k1 (t p) (t q)
+ Papa.Bifunctors.Export: bifold :: (Bifoldable p, Monoid m) => p m m -> m
+ Papa.Bifunctors.Export: bifoldMap :: (Bifoldable p, Monoid m) => (a -> m) -> (b -> m) -> p a b -> m
+ Papa.Bifunctors.Export: bifoldMapDefault :: (Bitraversable t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m
+ Papa.Bifunctors.Export: bifoldl :: Bifoldable p => forall c a b. (c -> a -> c) -> (c -> b -> c) -> c -> p a b -> c
+ Papa.Bifunctors.Export: bifoldl' :: Bifoldable t => (a -> b -> a) -> (a -> c -> a) -> a -> t b c -> a
+ Papa.Bifunctors.Export: bifoldlM :: (Bifoldable t, Monad m) => (a -> b -> m a) -> (a -> c -> m a) -> a -> t b c -> m a
+ Papa.Bifunctors.Export: bifoldr :: Bifoldable p => forall a c b. (a -> c -> c) -> (b -> c -> c) -> c -> p a b -> c
+ Papa.Bifunctors.Export: bifoldr' :: Bifoldable t => (a -> c -> c) -> (b -> c -> c) -> c -> t a b -> c
+ Papa.Bifunctors.Export: bifoldrM :: (Bifoldable t, Monad m) => (a -> c -> m c) -> (b -> c -> m c) -> c -> t a b -> m c
+ Papa.Bifunctors.Export: bifor :: (Bitraversable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f (t c d)
+ Papa.Bifunctors.Export: biforM :: (Bitraversable t, Monad m) => t a b -> (a -> m c) -> (b -> m d) -> m (t c d)
+ Papa.Bifunctors.Export: biforM_ :: (Bifoldable t, Monad m) => t a b -> (a -> m c) -> (b -> m d) -> m ()
+ Papa.Bifunctors.Export: bifor_ :: (Bifoldable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f ()
+ Papa.Bifunctors.Export: bijoin :: BifunctorMonad k k1 t => t (t p) a b -> t p a b
+ Papa.Bifunctors.Export: bilength :: Bifoldable t => t a b -> Int
+ Papa.Bifunctors.Export: biliftA2 :: Biapplicative w => (a -> b -> c) -> (d -> e -> f) -> w a d -> w b e -> w c f
+ Papa.Bifunctors.Export: biliftA3 :: Biapplicative w => (a -> b -> c -> d) -> (e -> f -> g -> h) -> w a e -> w b f -> w c g -> w d h
+ Papa.Bifunctors.Export: biliftM :: BifunctorMonad k k1 t => (:->) k k1 p q -> (:->) k k1 (t p) (t q)
+ Papa.Bifunctors.Export: biliftW :: BifunctorComonad k k1 t => (:->) k k1 p q -> (:->) k k1 (t p) (t q)
+ Papa.Bifunctors.Export: bimapAccumL :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)
+ Papa.Bifunctors.Export: bimapAccumR :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)
+ Papa.Bifunctors.Export: bimapDefault :: Bitraversable t => (a -> b) -> (c -> d) -> t a c -> t b d
+ Papa.Bifunctors.Export: bimapM :: (Bitraversable t, Monad m) => (a -> m c) -> (b -> m d) -> t a b -> m (t c d)
+ Papa.Bifunctors.Export: bimapM_ :: (Bifoldable t, Monad m) => (a -> m c) -> (b -> m d) -> t a b -> m ()
+ Papa.Bifunctors.Export: bimsum :: (Bifoldable t, MonadPlus m) => t (m a) (m a) -> m a
+ Papa.Bifunctors.Export: binotElem :: (Bifoldable t, Eq a) => a -> t a a -> Bool
+ Papa.Bifunctors.Export: binull :: Bifoldable t => t a b -> Bool
+ Papa.Bifunctors.Export: bior :: Bifoldable t => t Bool Bool -> Bool
+ Papa.Bifunctors.Export: biproduct :: (Bifoldable t, Num a) => t a a -> a
+ Papa.Bifunctors.Export: bipure :: Biapplicative p => a -> b -> p a b
+ Papa.Bifunctors.Export: bireturn :: BifunctorMonad k k1 t => p a b -> t p a b
+ Papa.Bifunctors.Export: bisequence :: (Bitraversable t, Monad m) => t (m a) (m b) -> m (t a b)
+ Papa.Bifunctors.Export: bisequenceA :: (Bitraversable t, Applicative f) => t (f a) (f b) -> f (t a b)
+ Papa.Bifunctors.Export: bisequenceA_ :: (Bifoldable t, Applicative f) => t (f a) (f b) -> f ()
+ Papa.Bifunctors.Export: bisequence_ :: (Bifoldable t, Monad m) => t (m a) (m b) -> m ()
+ Papa.Bifunctors.Export: bisum :: (Bifoldable t, Num a) => t a a -> a
+ Papa.Bifunctors.Export: bitraverse :: (Bitraversable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)
+ Papa.Bifunctors.Export: bitraverse_ :: (Bifoldable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f ()
+ Papa.Bifunctors.Export: class Bifunctor p => Biapplicative (p :: * -> * -> *)
+ Papa.Bifunctors.Export: class Bifoldable (p :: * -> * -> *)
+ Papa.Bifunctors.Export: class BifunctorFunctor k k1 k k1 t => BifunctorComonad k k1 (t :: (k1 -> k -> *) -> k1 -> k -> *)
+ Papa.Bifunctors.Export: class BifunctorFunctor k k1 k2 k3 (t :: (k3 -> k2 -> *) -> k1 -> k -> *)
+ Papa.Bifunctors.Export: class BifunctorFunctor k k1 k k1 t => BifunctorMonad k k1 (t :: (k1 -> k -> *) -> k1 -> k -> *)
+ Papa.Bifunctors.Export: class (Bifunctor t, Bifoldable t) => Bitraversable (t :: * -> * -> *)
+ Papa.Bifunctors.Export: data Biff k k1 k2 k3 (p :: k3 -> k2 -> *) (f :: k1 -> k3) (g :: k -> k2) (a :: k1) (b :: k) :: forall k k1 k2 k3. (k3 -> k2 -> *) -> (k1 -> k3) -> (k -> k2) -> k1 -> k -> *
+ Papa.Bifunctors.Export: data Clown k k1 (f :: k1 -> *) (a :: k1) (b :: k) :: forall k k1. (k1 -> *) -> k1 -> k -> *
+ Papa.Bifunctors.Export: data Fix k (p :: * -> k -> *) (a :: k) :: forall k. (* -> k -> *) -> k -> *
+ Papa.Bifunctors.Export: data Flip k k1 (p :: k1 -> k -> *) (a :: k) (b :: k1) :: forall k k1. (k1 -> k -> *) -> k -> k1 -> *
+ Papa.Bifunctors.Export: infixl 4 <<**>>
+ Papa.Bifunctors.Export: newtype Join k (p :: k -> k -> *) (a :: k) :: forall k. (k -> k -> *) -> k -> *
+ Papa.Bifunctors.Export: newtype Joker k k1 (g :: k1 -> *) (a :: k) (b :: k1) :: forall k k1. (k1 -> *) -> k -> k1 -> *
+ Papa.Bifunctors.Export: newtype Tannen k k1 k2 (f :: k2 -> *) (p :: k1 -> k -> k2) (a :: k1) (b :: k) :: forall k k1 k2. (k2 -> *) -> (k1 -> k -> k2) -> k1 -> k -> *
+ Papa.Bifunctors.Export: newtype WrappedBifunctor k k1 (p :: k1 -> k -> *) (a :: k1) (b :: k) :: forall k k1. (k1 -> k -> *) -> k1 -> k -> *
Files
- LICENCE +77/−0
- LICENSE +0/−77
- Setup.hs +2/−0
- Setup.lhs +0/−44
- papa-bifunctors-export.cabal +3/−28
- src/Papa/Bifunctors/Export.hs +24/−13
- 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-bifunctors-export.cabal view
@@ -1,7 +1,7 @@ name: papa-bifunctors-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.Bifunctors.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/Bifunctors/Export.hs view
@@ -1,18 +1,29 @@ {-# LANGUAGE NoImplicitPrelude #-} module Papa.Bifunctors.Export( - module P+ Biapplicative(bipure, (<<*>>), (*>>), (<<*)), (<<$>>), (<<**>>), biliftA2, biliftA3,+ Bifoldable(bifold, bifoldMap), bifoldr, bifoldl, bifoldr', bifoldrM, bifoldl', bifoldlM, bitraverse_, bifor_, bimapM_, biforM_, bimsum, bisequenceA_, bisequence_, biasum, biList, binull, bilength, bielem, bisum, biproduct, biand, bior, biany, biall, binotElem, bifind, -- todo re-implement some of these+ Biff, Biff(runBiff),+ Clown, Clown(runClown),+ Fix, Fix(out),+ Flip, Flip(runFlip),+ BifunctorFunctor(bifmap), BifunctorMonad(bireturn, bibind, bijoin), biliftM, BifunctorComonad(biextract, biextend, biduplicate), biliftW,+ Join(Join, runJoin),+ Joker(Joker, runJoker),+ Tannen(Tannen, runTannen),+ WrappedBifunctor(WrapBifunctor, unwrapBifunctor),+ Bitraversable(bitraverse), bisequenceA, bisequence, bimapM, bifor, biforM, bimapAccumL, bimapAccumR, bimapDefault, bifoldMapDefault ) where -import Data.Biapplicative as P(Biapplicative(bipure, (<<*>>), (*>>), (<<*)), (<<$>>), (<<**>>), biliftA2, biliftA3)-import Data.Bifoldable as P(Bifoldable(bifold, bifoldMap), bifoldr, bifoldl, bifoldr', bifoldrM, bifoldl', bifoldlM, bitraverse_, bifor_, bimapM_, biforM_, bimsum, bisequenceA_, bisequence_, biasum, biList, binull, bilength, bielem, bisum, biproduct, biand, bior, biany, biall, binotElem, bifind) -- todo re-implement some of these-import Data.Bifunctor.Biff as P(Biff, Biff(runBiff))-import Data.Bifunctor.Clown as P(Clown, Clown(runClown))-import Data.Bifunctor.Fix as P(Fix, Fix(out))-import Data.Bifunctor.Flip as P(Flip, Flip(runFlip))-import Data.Bifunctor.Functor as P(BifunctorFunctor(bifmap), BifunctorMonad(bireturn, bibind, bijoin), biliftM, BifunctorComonad(biextract, biextend, biduplicate), biliftW)-import Data.Bifunctor.Join as P(Join(Join, runJoin))-import Data.Bifunctor.Joker as P(Joker(Joker, runJoker))-import Data.Bifunctor.Tannen as P(Tannen(Tannen, runTannen))-import Data.Bifunctor.Wrapped as P(WrappedBifunctor(WrapBifunctor, unwrapBifunctor))-import Data.Bitraversable as P(Bitraversable(bitraverse), bisequenceA, bisequence, bimapM, bifor, biforM, bimapAccumL, bimapAccumR, bimapDefault, bifoldMapDefault)+import Data.Biapplicative (Biapplicative(bipure, (<<*>>), (*>>), (<<*)), (<<$>>), (<<**>>), biliftA2, biliftA3)+import Data.Bifoldable (Bifoldable(bifold, bifoldMap), bifoldr, bifoldl, bifoldr', bifoldrM, bifoldl', bifoldlM, bitraverse_, bifor_, bimapM_, biforM_, bimsum, bisequenceA_, bisequence_, biasum, biList, binull, bilength, bielem, bisum, biproduct, biand, bior, biany, biall, binotElem, bifind) -- todo re-implement some of these+import Data.Bifunctor.Biff (Biff, Biff(runBiff))+import Data.Bifunctor.Clown (Clown, Clown(runClown))+import Data.Bifunctor.Fix (Fix, Fix(out))+import Data.Bifunctor.Flip (Flip, Flip(runFlip))+import Data.Bifunctor.Functor (BifunctorFunctor(bifmap), BifunctorMonad(bireturn, bibind, bijoin), biliftM, BifunctorComonad(biextract, biextend, biduplicate), biliftW)+import Data.Bifunctor.Join (Join(Join, runJoin))+import Data.Bifunctor.Joker (Joker(Joker, runJoker))+import Data.Bifunctor.Tannen (Tannen(Tannen, runTannen))+import Data.Bifunctor.Wrapped (WrappedBifunctor(WrapBifunctor, unwrapBifunctor))+import Data.Bitraversable (Bitraversable(bitraverse), bisequenceA, bisequence, bimapM, bifor, biforM, bimapAccumL, bimapAccumR, bimapDefault, bifoldMapDefault)
− 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