Safe Haskell | None |
---|---|
Language | Haskell2010 |
- module Control.Applicative
- module Control.Category
- module Control.Monad
- module Control.Monad.Except
- module Control.Monad.Identity
- module Control.Monad.Reader
- module Control.Monad.State
- module Data.Bool
- module Data.ByteString
- module Data.Char
- module Data.Either
- module Data.Foldable
- module Data.Function
- module Data.List
- module Data.Map
- module Data.Maybe
- module Data.Monoid
- module Data.Ord
- module Data.Ratio
- module Data.Set
- module Data.Text
- module Data.Text.Encoding
- module Data.Traversable
- module Data.Tuple
- module Debug.Trace
- module Prelude
- show :: Show a => a -> Text
- read :: Read a => Text -> Maybe a
- todo :: a
- error :: Text -> a
- impossible :: Text -> a
- whenJust :: Monad m => Maybe a -> (a -> m ()) -> m ()
- onFst :: (a -> c) -> (a, b) -> (c, b)
- onSnd :: (b -> c) -> (a, b) -> (a, c)
- onFstF :: Functor f => (a -> f c) -> (a, b) -> f (c, b)
- onSndF :: Functor f => (b -> f c) -> (a, b) -> f (a, c)
- lift2 :: (MonadTrans t, MonadTrans u, Monad m, Monad (u m)) => m a -> t (u m) a
- lift3 :: (MonadTrans t, MonadTrans u, MonadTrans v, Monad m, Monad (u m), Monad (t (u m))) => m a -> v (t (u m)) a
- lift4 :: (MonadTrans t, MonadTrans u, MonadTrans v, MonadTrans w, Monad m, Monad (u m), Monad (t (u m)), Monad (v (t (u m)))) => m a -> w (v (t (u m))) a
- modifyM :: Monad m => (s -> m s) -> StateT s m ()
- minimumByM :: Monad m => (a -> a -> m Ordering) -> [a] -> m a
- data Proxy a = Proxy
- asProxied :: a -> Proxy a -> a
- eitherAlt :: Alternative f => f a -> f b -> f (Either a b)
- sequenceWhileJust :: Monad m => [m (Maybe a)] -> m [a]
- headView :: [a] -> Maybe (a, [a])
- fst3 :: (a, b, c) -> a
- snd3 :: (a, b, c) -> b
- thd3 :: (a, b, c) -> c
- unionWithM :: (Ord k, Monad m) => (a -> a -> m a) -> Map k a -> Map k a -> m (Map k a)
- whenM :: Monad m => m Bool -> m () -> m ()
- traceVal :: Show a => a -> a
- setCatMaybes :: Ord a => Set (Maybe a) -> Set a
- setSequence :: (Ord a, Applicative f) => Set (f a) -> f (Set a)
- onLeft :: (a -> c) -> Either a b -> Either c b
- onRight :: (b -> c) -> Either a b -> Either a c
- whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m ()
- boolToMaybe :: Bool -> Maybe ()
Documentation
module Control.Applicative
module Control.Category
module Control.Monad
module Control.Monad.Except
module Control.Monad.Identity
module Control.Monad.Reader
module Control.Monad.State
module Data.Bool
module Data.ByteString
module Data.Char
module Data.Either
module Data.Foldable
module Data.Function
module Data.List
module Data.Map
module Data.Maybe
module Data.Monoid
module Data.Ord
module Data.Ratio
module Data.Set
module Data.Text
module Data.Text.Encoding
module Data.Traversable
module Data.Tuple
module Debug.Trace
module Prelude
impossible :: Text -> a Source
whenJust :: Monad m => Maybe a -> (a -> m ()) -> m () Source
If the input is Just, do a monadic action on the value
lift2 :: (MonadTrans t, MonadTrans u, Monad m, Monad (u m)) => m a -> t (u m) a Source
lift3 :: (MonadTrans t, MonadTrans u, MonadTrans v, Monad m, Monad (u m), Monad (t (u m))) => m a -> v (t (u m)) a Source
lift4 :: (MonadTrans t, MonadTrans u, MonadTrans v, MonadTrans w, Monad m, Monad (u m), Monad (t (u m)), Monad (v (t (u m)))) => m a -> w (v (t (u m))) a Source
modifyM :: Monad m => (s -> m s) -> StateT s m () Source
Modify the state of a StateT using a monadic action of the inner monad.
minimumByM :: Monad m => (a -> a -> m Ordering) -> [a] -> m a Source
Find the minimum element of a list using a monadic comparison action.
eitherAlt :: Alternative f => f a -> f b -> f (Either a b) infixl 3 Source
Like |, but the operands may have different value types, with Either providing a union of those two types in the result
sequenceWhileJust :: Monad m => [m (Maybe a)] -> m [a] Source
Sequence a list of actions that return Maybes, stopping at the first Nothing
unionWithM :: (Ord k, Monad m) => (a -> a -> m a) -> Map k a -> Map k a -> m (Map k a) Source
Union two maps, with a monadic action for merging duplicates
whenM :: Monad m => m Bool -> m () -> m () Source
Like when, but the condition is also a monadic action
setSequence :: (Ord a, Applicative f) => Set (f a) -> f (Set a) Source
boolToMaybe :: Bool -> Maybe () Source