| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Agda.Utils.Maybe.Strict
Contents
Description
A strict version of the Maybe type.
Import qualified, as in
import qualified Agda.Utils.Maybe.Strict as Strict
Synopsis
- catMaybes :: [Maybe a] -> [a]
- fromJust :: Maybe a -> a
- fromMaybe :: a -> Maybe a -> a
- isJust :: Maybe a -> Bool
- isNothing :: Maybe a -> Bool
- listToMaybe :: [a] -> Maybe a
- mapMaybe :: (a -> Maybe b) -> [a] -> [b]
- maybe :: b -> (a -> b) -> Maybe a -> b
- maybeToList :: Maybe a -> [a]
- data Maybe a
- class Strict lazy strict | lazy -> strict, strict -> lazy where
- caseMaybe :: Maybe a -> b -> (a -> b) -> b
- caseMaybeM :: Monad m => m (Maybe a) -> m b -> (a -> m b) -> m b
- filterMaybe :: (a -> Bool) -> a -> Maybe a
- forMaybe :: [a] -> (a -> Maybe b) -> [b]
- fromMaybeM :: Monad m => m a -> m (Maybe a) -> m a
- ifJustM :: Monad m => m (Maybe a) -> (a -> m b) -> m b -> m b
- lensMaybeLazy :: forall a f. Functor f => (Maybe a -> f (Maybe a)) -> Maybe a -> f (Maybe a)
- maybeM :: Monad m => m b -> (a -> m b) -> m (Maybe a) -> m b
- unionMaybeWith :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a
- unzipMaybe :: Maybe (a, b) -> (Maybe a, Maybe b)
- whenJust :: Monad m => Maybe a -> (a -> m ()) -> m ()
- whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m ()
Documentation
listToMaybe :: [a] -> Maybe a #
maybeToList :: Maybe a -> [a] #
Instances
class Strict lazy strict | lazy -> strict, strict -> lazy where #
Instances
| Strict ByteString ByteString # | |
Defined in Data.Strict.Classes | |
| Strict Text Text # | |
| Strict (Maybe a) (Maybe a) # | |
| Strict (ST s a) (ST s a) # | |
| Strict (Either a b) (Either a b) # | |
| Strict (These a b) (These a b) # | |
Defined in Data.Strict.Classes | |
| Strict (a, b) (Pair a b) # | |
Defined in Data.Strict.Classes | |
| Strict (StateT s m a) (StateT s m a) # | |
| Strict (WriterT w m a) (WriterT w m a) # | |
| Strict (RWST r w s m a) (RWST r w s m a) # | |
caseMaybeM :: Monad m => m (Maybe a) -> m b -> (a -> m b) -> m b Source #
filterMaybe :: (a -> Bool) -> a -> Maybe a Source #
Filtering a singleton list.
filterMaybe p a =listToMaybe(filterp [a])
forMaybe :: [a] -> (a -> Maybe b) -> [b] Source #
Version of mapMaybe with different argument ordering.
ifJustM :: Monad m => m (Maybe a) -> (a -> m b) -> m b -> m b Source #
caseMaybeM with flipped branches.
lensMaybeLazy :: forall a f. Functor f => (Maybe a -> f (Maybe a)) -> Maybe a -> f (Maybe a) Source #
unionMaybeWith :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a Source #
unionWith for collections of size <= 1.
whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m () Source #
caseMaybeM without the Nothing case.
Orphan instances
| Applicative Maybe Source # | Note that strict Maybe is an |
| Null (Maybe a) Source # | |