-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Useful base functions reimplemented
--   
--   Useful base functions reimplemented
@package papa-base-implement
@version 0.2.0

module Papa.Base.Implement.Data.Traversable
mapM :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)
forM :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
sequence :: (Traversable t, Applicative f) => t (f a) -> f (t a)

module Papa.Base.Implement.Data.Monoid
mconcat :: (Monoid a, Foldable f) => f a -> a

module Papa.Base.Implement.Data.List
lookup :: (Eq a, Foldable f) => a -> f (a, b) -> Maybe b
(++) :: Semigroup a => a -> a -> a

module Papa.Base.Implement.Data.Function
flip :: Functor f => f (a -> b) -> a -> f b

module Papa.Base.Implement.Data.Foldable
mapM_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()
forM_ :: (Foldable t, Applicative m) => t a -> (a -> m b) -> m ()
sequence_ :: (Foldable t, Applicative f) => t (f a) -> f ()

module Papa.Base.Implement.Data.Bool
if' :: Bool -> a -> a -> a
(?.) :: Category c => c a a -> Bool -> c a a
(.?) :: Category c => c a a -> Bool -> c a a
(?<>) :: Monoid a => a -> Bool -> a
(<>?) :: Monoid a => a -> Bool -> a
(?<*>) :: Applicative f => (a -> f a) -> Bool -> a -> f a
(<*>?) :: Applicative f => (a -> f a) -> Bool -> a -> f a
(<||>) :: Monad m => m Bool -> m Bool -> m Bool
(<&&>) :: Monad m => m Bool -> m Bool -> m Bool

module Papa.Base.Implement.Control.Monad
anyM :: Monad m => (a -> m Bool) -> [a] -> m Bool
allM :: Monad m => (a -> m Bool) -> [a] -> m Bool

-- | Find an element satisfying a predicate
findM :: Monad m => (a -> m Bool) -> [a] -> m (Maybe a)

module Papa.Base.Implement.Control.Applicative
const :: Applicative f => a -> f a
return :: Applicative f => a -> f a

module Papa.Base.Implement