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


-- | Utilities
--   
--   Utilities
@package util
@version 0.1.3.0

module Util
(&=&) :: Applicative p => (a -> p b) -> (a -> p c) -> a -> p (b, c)
infixr 3 &=&
(*=*) :: Applicative p => (a1 -> p b1) -> (a2 -> p b2) -> (a1, a2) -> p (b1, b2)
infixr 3 *=*
tripleK :: Applicative p => (a1 -> p b1) -> (a2 -> p b2) -> (a3 -> p b3) -> (a1, a2, a3) -> p (b1, b2, b3)
(<||>) :: Applicative p => p Bool -> p Bool -> p Bool
infixr 2 <||>
(<&&>) :: Applicative p => p Bool -> p Bool -> p Bool
infixr 3 <&&>
liftA4 :: (Applicative p) => (a -> b -> c -> d -> e) -> p a -> p b -> p c -> p d -> p e
apMA :: Monad m => m (a -> m b) -> a -> m b
whileJust :: (Alternative f, Monad m) => m (Maybe a) -> (a -> m b) -> m (f b)
untilJust :: Monad m => m (Maybe a) -> m a
list :: b -> (a -> [a] -> b) -> [a] -> b
(∘) :: (Category p) => p b c -> p a b -> p a c
infixr 9 ∘
(&) :: (Category p) => p a b -> p b c -> p a c
infixr 9 &
(∘∘) :: (c -> d) -> (a -> b -> c) -> (a -> b -> d)
infixr 9 ∘∘
onn :: (a -> a -> a -> b) -> (c -> a) -> c -> c -> c -> b
infixl 0 `onn`
fst3 :: (a, b, c) -> a
snd3 :: (a, b, c) -> b
þrd3 :: (a, b, c) -> c
replicate :: Alternative f => Natural -> a -> f a
replicateA :: (Applicative p, Alternative f) => Natural -> p a -> p (f a)
mtimesA :: (Applicative p, Semigroup a, Monoid a) => Natural -> p a -> p a
newtype Ap p a
Ap :: p a -> Ap p a
[unAp] :: Ap p a -> p a
(!!?) :: Foldable f => f a -> Natural -> Maybe a
intercalate :: Semigroup a => a -> NonEmpty a -> a
instance GHC.Enum.Enum (p a) => GHC.Enum.Enum (Util.Ap p a)
instance GHC.Enum.Bounded (p a) => GHC.Enum.Bounded (Util.Ap p a)
instance GHC.Show.Show (p a) => GHC.Show.Show (Util.Ap p a)
instance GHC.Read.Read (p a) => GHC.Read.Read (Util.Ap p a)
instance GHC.Classes.Ord (p a) => GHC.Classes.Ord (Util.Ap p a)
instance GHC.Classes.Eq (p a) => GHC.Classes.Eq (Util.Ap p a)
instance Data.Functor.Classes.Show1 p => Data.Functor.Classes.Show1 (Util.Ap p)
instance Data.Functor.Classes.Read1 p => Data.Functor.Classes.Read1 (Util.Ap p)
instance Data.Functor.Classes.Ord1 p => Data.Functor.Classes.Ord1 (Util.Ap p)
instance Data.Functor.Classes.Eq1 p => Data.Functor.Classes.Eq1 (Util.Ap p)
instance Data.Traversable.Traversable p => Data.Traversable.Traversable (Util.Ap p)
instance Data.Foldable.Foldable p => Data.Foldable.Foldable (Util.Ap p)
instance GHC.Base.MonadPlus p => GHC.Base.MonadPlus (Util.Ap p)
instance GHC.Base.Alternative p => GHC.Base.Alternative (Util.Ap p)
instance GHC.Base.Monad p => GHC.Base.Monad (Util.Ap p)
instance GHC.Base.Applicative p => GHC.Base.Applicative (Util.Ap p)
instance GHC.Base.Functor p => GHC.Base.Functor (Util.Ap p)
instance (GHC.Base.Applicative p, Data.Semigroup.Semigroup a) => Data.Semigroup.Semigroup (Util.Ap p a)
instance (GHC.Base.Applicative p, Data.Semigroup.Semigroup a, GHC.Base.Monoid a) => GHC.Base.Monoid (Util.Ap p a)