Safe Haskell	None
Language	Haskell2010

Control.Compactable

Synopsis

Documentation

class Compactable (f :: * -> *) where Source #

Class Compactable provides two methods which can be writen in terms of each other, compact and separate.

Compact

is generalization of catMaybes as a new function. Compact has relations with Functor, Applicative, Monad, Alternative, and Traversable. In that we can use these class to provide the ability to operate on a data type by throwing away intermediate Nothings. This is useful for representing stripping out values or failure.

To be compactable alone, no laws must be satisfied other than the type signature.

If the data type is also a Functor the following should hold:

Kleisli composition

fmapMaybe (l <=< r) = fmapMaybe l . fmapMaybe r

Functor identity 1

compact . fmap Just = id

Functor identity 2

fmapMaybe Just = id

Functor relation

compact = fmapMaybe id

According to Kmett, (Compactable f, Functor f) is a functor from the kleisli category of Maybe to the category of haskell data types. Kleisli Maybe -> Hask.

If the data type is also Applicative the following should hold:

Applicative left identity

compact . (pure Just <*>) = id

Applicative right identity

applyMaybe (pure Just) = id

Applicative relation

compact = applyMaybe (pure id)

If the data type is also a Monad the following should hold:

Monad left identity

flip bindMaybe (return . Just) = id

Monad right identity

compact . (return . Just =<<) = id

Monad relation

compact = flip bindMaybe return

If the data type is also Alternative the following should hold:

Alternative identity

compact empty = empty

Alternative annihilation

compact (const Nothing <$> xs) = empty

If the data type is also Traversable the following should hold:

Traversable Applicative relation

traverseMaybe (pure . Just) = pure

Traversable composition

Compose . fmap (traverseMaybe f) . traverseMaybe g = traverseMaybe (Compose . fmap (traverseMaybe f) . g)

Traversable Functor relation

traverse f = traverseMaybe (fmap Just . f)

Traversable naturality

t . traverseMaybe f = traverseMaybe (t . f)

Separate and filter

have recently elevated roles in this typeclass, and is not as well explored as compact. Here are the laws known today:

Functor identity 3

fst . separate . fmap Right = id

Functor identity 4

snd . separate . fmap Left = id

Applicative left identity 2

snd . separate . (pure Right <*>) = id

Applicative right identity 2

fst . separate . (pure Left <*>) = id

Alternative annihilation left

snd . separate . fmap (const Left) = empty

Alternative annihilation right

fst , separate . fmap (const Right) = empty

Docs for relationships between these functions and, a cleanup of laws will happen at some point.

If you know of more useful laws, or have better names for the ones above (especially those marked "name me"). Please let me know.

Methods

compact :: f (Maybe a) -> f a Source #

compact :: Functor f => f (Maybe a) -> f a Source #

separate :: f (Either l r) -> (f l, f r) Source #

separate :: Functor f => f (Either l r) -> (f l, f r) Source #

filter :: (a -> Bool) -> f a -> f a Source #

filter :: Functor f => (a -> Bool) -> f a -> f a Source #

fmapMaybe :: Functor f => (a -> Maybe b) -> f a -> f b Source #

fmapEither :: Functor f => (a -> Either l r) -> f a -> (f l, f r) Source #

applyMaybe :: Applicative f => f (a -> Maybe b) -> f a -> f b Source #

applyEither :: Applicative f => f (a -> Either l r) -> f a -> (f l, f r) Source #

bindMaybe :: Monad f => f a -> (a -> f (Maybe b)) -> f b Source #

bindEither :: Monad f => f a -> (a -> f (Either l r)) -> (f l, f r) Source #

traverseMaybe :: (Applicative g, Traversable f) => (a -> g (Maybe b)) -> f a -> g (f b) Source #

traverseEither :: (Applicative g, Traversable f) => (a -> g (Either l r)) -> f a -> g (f l, f r) Source #

Instances

Compactable [] Source #
Methods compact :: [Maybe a] -> [a] Source # separate :: [Either l r] -> ([l], [r]) Source # filter :: (a -> Bool) -> [a] -> [a] Source # fmapMaybe :: Functor [] => (a -> Maybe b) -> [a] -> [b] Source # fmapEither :: Functor [] => (a -> Either l r) -> [a] -> ([l], [r]) Source # applyMaybe :: Applicative [] => [a -> Maybe b] -> [a] -> [b] Source # applyEither :: Applicative [] => [a -> Either l r] -> [a] -> ([l], [r]) Source # bindMaybe :: Monad [] => [a] -> (a -> [Maybe b]) -> [b] Source # bindEither :: Monad [] => [a] -> (a -> [Either l r]) -> ([l], [r]) Source # traverseMaybe :: (Applicative g, Traversable []) => (a -> g (Maybe b)) -> [a] -> g [b] Source # traverseEither :: (Applicative g, Traversable []) => (a -> g (Either l r)) -> [a] -> g ([l], [r]) Source #
Compactable Maybe Source #
Methods compact :: Maybe (Maybe a) -> Maybe a Source # separate :: Maybe (Either l r) -> (Maybe l, Maybe r) Source # filter :: (a -> Bool) -> Maybe a -> Maybe a Source # fmapMaybe :: Functor Maybe => (a -> Maybe b) -> Maybe a -> Maybe b Source # fmapEither :: Functor Maybe => (a -> Either l r) -> Maybe a -> (Maybe l, Maybe r) Source # applyMaybe :: Applicative Maybe => Maybe (a -> Maybe b) -> Maybe a -> Maybe b Source # applyEither :: Applicative Maybe => Maybe (a -> Either l r) -> Maybe a -> (Maybe l, Maybe r) Source # bindMaybe :: Monad Maybe => Maybe a -> (a -> Maybe (Maybe b)) -> Maybe b Source # bindEither :: Monad Maybe => Maybe a -> (a -> Maybe (Either l r)) -> (Maybe l, Maybe r) Source # traverseMaybe :: (Applicative g, Traversable Maybe) => (a -> g (Maybe b)) -> Maybe a -> g (Maybe b) Source # traverseEither :: (Applicative g, Traversable Maybe) => (a -> g (Either l r)) -> Maybe a -> g (Maybe l, Maybe r) Source #
Compactable IO Source #
Methods compact :: IO (Maybe a) -> IO a Source # separate :: IO (Either l r) -> (IO l, IO r) Source # filter :: (a -> Bool) -> IO a -> IO a Source # fmapMaybe :: Functor IO => (a -> Maybe b) -> IO a -> IO b Source # fmapEither :: Functor IO => (a -> Either l r) -> IO a -> (IO l, IO r) Source # applyMaybe :: Applicative IO => IO (a -> Maybe b) -> IO a -> IO b Source # applyEither :: Applicative IO => IO (a -> Either l r) -> IO a -> (IO l, IO r) Source # bindMaybe :: Monad IO => IO a -> (a -> IO (Maybe b)) -> IO b Source # bindEither :: Monad IO => IO a -> (a -> IO (Either l r)) -> (IO l, IO r) Source # traverseMaybe :: (Applicative g, Traversable IO) => (a -> g (Maybe b)) -> IO a -> g (IO b) Source # traverseEither :: (Applicative g, Traversable IO) => (a -> g (Either l r)) -> IO a -> g (IO l, IO r) Source #
Compactable Option Source #
Methods compact :: Option (Maybe a) -> Option a Source # separate :: Option (Either l r) -> (Option l, Option r) Source # filter :: (a -> Bool) -> Option a -> Option a Source # fmapMaybe :: Functor Option => (a -> Maybe b) -> Option a -> Option b Source # fmapEither :: Functor Option => (a -> Either l r) -> Option a -> (Option l, Option r) Source # applyMaybe :: Applicative Option => Option (a -> Maybe b) -> Option a -> Option b Source # applyEither :: Applicative Option => Option (a -> Either l r) -> Option a -> (Option l, Option r) Source # bindMaybe :: Monad Option => Option a -> (a -> Option (Maybe b)) -> Option b Source # bindEither :: Monad Option => Option a -> (a -> Option (Either l r)) -> (Option l, Option r) Source # traverseMaybe :: (Applicative g, Traversable Option) => (a -> g (Maybe b)) -> Option a -> g (Option b) Source # traverseEither :: (Applicative g, Traversable Option) => (a -> g (Either l r)) -> Option a -> g (Option l, Option r) Source #
Compactable STM Source #
Methods compact :: STM (Maybe a) -> STM a Source # separate :: STM (Either l r) -> (STM l, STM r) Source # filter :: (a -> Bool) -> STM a -> STM a Source # fmapMaybe :: Functor STM => (a -> Maybe b) -> STM a -> STM b Source # fmapEither :: Functor STM => (a -> Either l r) -> STM a -> (STM l, STM r) Source # applyMaybe :: Applicative STM => STM (a -> Maybe b) -> STM a -> STM b Source # applyEither :: Applicative STM => STM (a -> Either l r) -> STM a -> (STM l, STM r) Source # bindMaybe :: Monad STM => STM a -> (a -> STM (Maybe b)) -> STM b Source # bindEither :: Monad STM => STM a -> (a -> STM (Either l r)) -> (STM l, STM r) Source # traverseMaybe :: (Applicative g, Traversable STM) => (a -> g (Maybe b)) -> STM a -> g (STM b) Source # traverseEither :: (Applicative g, Traversable STM) => (a -> g (Either l r)) -> STM a -> g (STM l, STM r) Source #
Compactable ReadPrec Source #
Methods compact :: ReadPrec (Maybe a) -> ReadPrec a Source # separate :: ReadPrec (Either l r) -> (ReadPrec l, ReadPrec r) Source # filter :: (a -> Bool) -> ReadPrec a -> ReadPrec a Source # fmapMaybe :: Functor ReadPrec => (a -> Maybe b) -> ReadPrec a -> ReadPrec b Source # fmapEither :: Functor ReadPrec => (a -> Either l r) -> ReadPrec a -> (ReadPrec l, ReadPrec r) Source # applyMaybe :: Applicative ReadPrec => ReadPrec (a -> Maybe b) -> ReadPrec a -> ReadPrec b Source # applyEither :: Applicative ReadPrec => ReadPrec (a -> Either l r) -> ReadPrec a -> (ReadPrec l, ReadPrec r) Source # bindMaybe :: Monad ReadPrec => ReadPrec a -> (a -> ReadPrec (Maybe b)) -> ReadPrec b Source # bindEither :: Monad ReadPrec => ReadPrec a -> (a -> ReadPrec (Either l r)) -> (ReadPrec l, ReadPrec r) Source # traverseMaybe :: (Applicative g, Traversable ReadPrec) => (a -> g (Maybe b)) -> ReadPrec a -> g (ReadPrec b) Source # traverseEither :: (Applicative g, Traversable ReadPrec) => (a -> g (Either l r)) -> ReadPrec a -> g (ReadPrec l, ReadPrec r) Source #
Compactable ReadP Source #
Methods compact :: ReadP (Maybe a) -> ReadP a Source # separate :: ReadP (Either l r) -> (ReadP l, ReadP r) Source # filter :: (a -> Bool) -> ReadP a -> ReadP a Source # fmapMaybe :: Functor ReadP => (a -> Maybe b) -> ReadP a -> ReadP b Source # fmapEither :: Functor ReadP => (a -> Either l r) -> ReadP a -> (ReadP l, ReadP r) Source # applyMaybe :: Applicative ReadP => ReadP (a -> Maybe b) -> ReadP a -> ReadP b Source # applyEither :: Applicative ReadP => ReadP (a -> Either l r) -> ReadP a -> (ReadP l, ReadP r) Source # bindMaybe :: Monad ReadP => ReadP a -> (a -> ReadP (Maybe b)) -> ReadP b Source # bindEither :: Monad ReadP => ReadP a -> (a -> ReadP (Either l r)) -> (ReadP l, ReadP r) Source # traverseMaybe :: (Applicative g, Traversable ReadP) => (a -> g (Maybe b)) -> ReadP a -> g (ReadP b) Source # traverseEither :: (Applicative g, Traversable ReadP) => (a -> g (Either l r)) -> ReadP a -> g (ReadP l, ReadP r) Source #
Compactable IntMap Source #
Methods compact :: IntMap (Maybe a) -> IntMap a Source # separate :: IntMap (Either l r) -> (IntMap l, IntMap r) Source # filter :: (a -> Bool) -> IntMap a -> IntMap a Source # fmapMaybe :: Functor IntMap => (a -> Maybe b) -> IntMap a -> IntMap b Source # fmapEither :: Functor IntMap => (a -> Either l r) -> IntMap a -> (IntMap l, IntMap r) Source # applyMaybe :: Applicative IntMap => IntMap (a -> Maybe b) -> IntMap a -> IntMap b Source # applyEither :: Applicative IntMap => IntMap (a -> Either l r) -> IntMap a -> (IntMap l, IntMap r) Source # bindMaybe :: Monad IntMap => IntMap a -> (a -> IntMap (Maybe b)) -> IntMap b Source # bindEither :: Monad IntMap => IntMap a -> (a -> IntMap (Either l r)) -> (IntMap l, IntMap r) Source # traverseMaybe :: (Applicative g, Traversable IntMap) => (a -> g (Maybe b)) -> IntMap a -> g (IntMap b) Source # traverseEither :: (Applicative g, Traversable IntMap) => (a -> g (Either l r)) -> IntMap a -> g (IntMap l, IntMap r) Source #
Compactable Seq Source #
Methods compact :: Seq (Maybe a) -> Seq a Source # separate :: Seq (Either l r) -> (Seq l, Seq r) Source # filter :: (a -> Bool) -> Seq a -> Seq a Source # fmapMaybe :: Functor Seq => (a -> Maybe b) -> Seq a -> Seq b Source # fmapEither :: Functor Seq => (a -> Either l r) -> Seq a -> (Seq l, Seq r) Source # applyMaybe :: Applicative Seq => Seq (a -> Maybe b) -> Seq a -> Seq b Source # applyEither :: Applicative Seq => Seq (a -> Either l r) -> Seq a -> (Seq l, Seq r) Source # bindMaybe :: Monad Seq => Seq a -> (a -> Seq (Maybe b)) -> Seq b Source # bindEither :: Monad Seq => Seq a -> (a -> Seq (Either l r)) -> (Seq l, Seq r) Source # traverseMaybe :: (Applicative g, Traversable Seq) => (a -> g (Maybe b)) -> Seq a -> g (Seq b) Source # traverseEither :: (Applicative g, Traversable Seq) => (a -> g (Either l r)) -> Seq a -> g (Seq l, Seq r) Source #
Compactable Set Source #
Methods compact :: Set (Maybe a) -> Set a Source # separate :: Set (Either l r) -> (Set l, Set r) Source # filter :: (a -> Bool) -> Set a -> Set a Source # fmapMaybe :: Functor Set => (a -> Maybe b) -> Set a -> Set b Source # fmapEither :: Functor Set => (a -> Either l r) -> Set a -> (Set l, Set r) Source # applyMaybe :: Applicative Set => Set (a -> Maybe b) -> Set a -> Set b Source # applyEither :: Applicative Set => Set (a -> Either l r) -> Set a -> (Set l, Set r) Source # bindMaybe :: Monad Set => Set a -> (a -> Set (Maybe b)) -> Set b Source # bindEither :: Monad Set => Set a -> (a -> Set (Either l r)) -> (Set l, Set r) Source # traverseMaybe :: (Applicative g, Traversable Set) => (a -> g (Maybe b)) -> Set a -> g (Set b) Source # traverseEither :: (Applicative g, Traversable Set) => (a -> g (Either l r)) -> Set a -> g (Set l, Set r) Source #
Compactable Vector Source #
Methods compact :: Vector (Maybe a) -> Vector a Source # separate :: Vector (Either l r) -> (Vector l, Vector r) Source # filter :: (a -> Bool) -> Vector a -> Vector a Source # fmapMaybe :: Functor Vector => (a -> Maybe b) -> Vector a -> Vector b Source # fmapEither :: Functor Vector => (a -> Either l r) -> Vector a -> (Vector l, Vector r) Source # applyMaybe :: Applicative Vector => Vector (a -> Maybe b) -> Vector a -> Vector b Source # applyEither :: Applicative Vector => Vector (a -> Either l r) -> Vector a -> (Vector l, Vector r) Source # bindMaybe :: Monad Vector => Vector a -> (a -> Vector (Maybe b)) -> Vector b Source # bindEither :: Monad Vector => Vector a -> (a -> Vector (Either l r)) -> (Vector l, Vector r) Source # traverseMaybe :: (Applicative g, Traversable Vector) => (a -> g (Maybe b)) -> Vector a -> g (Vector b) Source # traverseEither :: (Applicative g, Traversable Vector) => (a -> g (Either l r)) -> Vector a -> g (Vector l, Vector r) Source #
Monoid m => Compactable (Either m) Source #
Methods compact :: Either m (Maybe a) -> Either m a Source # separate :: Either m (Either l r) -> (Either m l, Either m r) Source # filter :: (a -> Bool) -> Either m a -> Either m a Source # fmapMaybe :: Functor (Either m) => (a -> Maybe b) -> Either m a -> Either m b Source # fmapEither :: Functor (Either m) => (a -> Either l r) -> Either m a -> (Either m l, Either m r) Source # applyMaybe :: Applicative (Either m) => Either m (a -> Maybe b) -> Either m a -> Either m b Source # applyEither :: Applicative (Either m) => Either m (a -> Either l r) -> Either m a -> (Either m l, Either m r) Source # bindMaybe :: Monad (Either m) => Either m a -> (a -> Either m (Maybe b)) -> Either m b Source # bindEither :: Monad (Either m) => Either m a -> (a -> Either m (Either l r)) -> (Either m l, Either m r) Source # traverseMaybe :: (Applicative g, Traversable (Either m)) => (a -> g (Maybe b)) -> Either m a -> g (Either m b) Source # traverseEither :: (Applicative g, Traversable (Either m)) => (a -> g (Either l r)) -> Either m a -> g (Either m l, Either m r) Source #
Compactable (Proxy *) Source #
Methods compact :: Proxy * (Maybe a) -> Proxy * a Source # separate :: Proxy * (Either l r) -> (Proxy * l, Proxy * r) Source # filter :: (a -> Bool) -> Proxy * a -> Proxy * a Source # fmapMaybe :: Functor (Proxy ) => (a -> Maybe b) -> Proxy a -> Proxy * b Source # fmapEither :: Functor (Proxy ) => (a -> Either l r) -> Proxy a -> (Proxy * l, Proxy * r) Source # applyMaybe :: Applicative (Proxy ) => Proxy (a -> Maybe b) -> Proxy * a -> Proxy * b Source # applyEither :: Applicative (Proxy ) => Proxy (a -> Either l r) -> Proxy * a -> (Proxy * l, Proxy * r) Source # bindMaybe :: Monad (Proxy ) => Proxy a -> (a -> Proxy * (Maybe b)) -> Proxy * b Source # bindEither :: Monad (Proxy ) => Proxy a -> (a -> Proxy * (Either l r)) -> (Proxy * l, Proxy * r) Source # traverseMaybe :: (Applicative g, Traversable (Proxy )) => (a -> g (Maybe b)) -> Proxy a -> g (Proxy * b) Source # traverseEither :: (Applicative g, Traversable (Proxy )) => (a -> g (Either l r)) -> Proxy a -> g (Proxy * l, Proxy * r) Source #
Compactable (Map k) Source #
Methods compact :: Map k (Maybe a) -> Map k a Source # separate :: Map k (Either l r) -> (Map k l, Map k r) Source # filter :: (a -> Bool) -> Map k a -> Map k a Source # fmapMaybe :: Functor (Map k) => (a -> Maybe b) -> Map k a -> Map k b Source # fmapEither :: Functor (Map k) => (a -> Either l r) -> Map k a -> (Map k l, Map k r) Source # applyMaybe :: Applicative (Map k) => Map k (a -> Maybe b) -> Map k a -> Map k b Source # applyEither :: Applicative (Map k) => Map k (a -> Either l r) -> Map k a -> (Map k l, Map k r) Source # bindMaybe :: Monad (Map k) => Map k a -> (a -> Map k (Maybe b)) -> Map k b Source # bindEither :: Monad (Map k) => Map k a -> (a -> Map k (Either l r)) -> (Map k l, Map k r) Source # traverseMaybe :: (Applicative g, Traversable (Map k)) => (a -> g (Maybe b)) -> Map k a -> g (Map k b) Source # traverseEither :: (Applicative g, Traversable (Map k)) => (a -> g (Either l r)) -> Map k a -> g (Map k l, Map k r) Source #
Compactable (Const * r) Source #
Methods compact :: Const * r (Maybe a) -> Const * r a Source # separate :: Const * r (Either l r) -> (Const * r l, Const * r r) Source # filter :: (a -> Bool) -> Const * r a -> Const * r a Source # fmapMaybe :: Functor (Const * r) => (a -> Maybe b) -> Const * r a -> Const * r b Source # fmapEither :: Functor (Const * r) => (a -> Either l r) -> Const * r a -> (Const * r l, Const * r r) Source # applyMaybe :: Applicative (Const * r) => Const * r (a -> Maybe b) -> Const * r a -> Const * r b Source # applyEither :: Applicative (Const * r) => Const * r (a -> Either l r) -> Const * r a -> (Const * r l, Const * r r) Source # bindMaybe :: Monad (Const * r) => Const * r a -> (a -> Const * r (Maybe b)) -> Const * r b Source # bindEither :: Monad (Const * r) => Const * r a -> (a -> Const * r (Either l r)) -> (Const * r l, Const * r r) Source # traverseMaybe :: (Applicative g, Traversable (Const * r)) => (a -> g (Maybe b)) -> Const * r a -> g (Const * r b) Source # traverseEither :: (Applicative g, Traversable (Const * r)) => (a -> g (Either l r)) -> Const * r a -> g (Const * r l, Const * r r) Source #
(Functor f, Functor g, Compactable f, Compactable g) => Compactable (Product * f g) Source #
Methods compact :: Product * f g (Maybe a) -> Product * f g a Source # separate :: Product * f g (Either l r) -> (Product * f g l, Product * f g r) Source # filter :: (a -> Bool) -> Product * f g a -> Product * f g a Source # fmapMaybe :: Functor (Product * f g) => (a -> Maybe b) -> Product * f g a -> Product * f g b Source # fmapEither :: Functor (Product * f g) => (a -> Either l r) -> Product * f g a -> (Product * f g l, Product * f g r) Source # applyMaybe :: Applicative (Product * f g) => Product * f g (a -> Maybe b) -> Product * f g a -> Product * f g b Source # applyEither :: Applicative (Product * f g) => Product * f g (a -> Either l r) -> Product * f g a -> (Product * f g l, Product * f g r) Source # bindMaybe :: Monad (Product * f g) => Product * f g a -> (a -> Product * f g (Maybe b)) -> Product * f g b Source # bindEither :: Monad (Product * f g) => Product * f g a -> (a -> Product * f g (Either l r)) -> (Product * f g l, Product * f g r) Source # traverseMaybe :: (Applicative g, Traversable (Product * f g)) => (a -> g (Maybe b)) -> Product * f g a -> g (Product * f g b) Source # traverseEither :: (Applicative g, Traversable (Product * f g)) => (a -> g (Either l r)) -> Product * f g a -> g (Product * f g l, Product * f g r) Source #
(Functor f, Functor g, Compactable g) => Compactable (Compose * * f g) Source #
Methods compact :: Compose * * f g (Maybe a) -> Compose * * f g a Source # separate :: Compose * * f g (Either l r) -> (Compose * * f g l, Compose * * f g r) Source # filter :: (a -> Bool) -> Compose * * f g a -> Compose * * f g a Source # fmapMaybe :: Functor (Compose * * f g) => (a -> Maybe b) -> Compose * * f g a -> Compose * * f g b Source # fmapEither :: Functor (Compose * * f g) => (a -> Either l r) -> Compose * * f g a -> (Compose * * f g l, Compose * * f g r) Source # applyMaybe :: Applicative (Compose * * f g) => Compose * * f g (a -> Maybe b) -> Compose * * f g a -> Compose * * f g b Source # applyEither :: Applicative (Compose * * f g) => Compose * * f g (a -> Either l r) -> Compose * * f g a -> (Compose * * f g l, Compose * * f g r) Source # bindMaybe :: Monad (Compose * * f g) => Compose * * f g a -> (a -> Compose * * f g (Maybe b)) -> Compose * * f g b Source # bindEither :: Monad (Compose * * f g) => Compose * * f g a -> (a -> Compose * * f g (Either l r)) -> (Compose * * f g l, Compose * * f g r) Source # traverseMaybe :: (Applicative g, Traversable (Compose * * f g)) => (a -> g (Maybe b)) -> Compose * * f g a -> g (Compose * * f g b) Source # traverseEither :: (Applicative g, Traversable (Compose * * f g)) => (a -> g (Either l r)) -> Compose * * f g a -> g (Compose * * f g l, Compose * * f g r) Source #

fforMaybe :: (Compactable f, Functor f) => f a -> (a -> Maybe b) -> f b Source #

fforEither :: (Compactable f, Functor f) => f a -> (a -> Either l r) -> (f l, f r) Source #

fmapMaybeM :: (Compactable f, Monad f) => (a -> MaybeT f b) -> f a -> f b Source #

fmapEitherM :: (Compactable f, Monad f) => (a -> ExceptT l f r) -> f a -> (f l, f r) Source #

fforMaybeM :: (Compactable f, Monad f) => f a -> (a -> MaybeT f b) -> f b Source #

fforEitherM :: (Compactable f, Monad f) => f a -> (a -> ExceptT l f r) -> (f l, f r) Source #

applyMaybeM :: (Compactable f, Monad f) => f (a -> MaybeT f b) -> f a -> f b Source #

bindMaybeM :: (Compactable f, Monad f) => f a -> (a -> f (MaybeT f b)) -> f b Source #

traverseMaybeM :: (Monad m, Compactable t, Traversable t) => (a -> MaybeT m b) -> t a -> m (t b) Source #

altDefaultCompact :: (Alternative f, Monad f) => f (Maybe a) -> f a Source #

While more constrained, when available, this default is going to be faster than the one provided in the typeclass

altDefaultSeparate :: (Alternative f, Foldable f) => f (Either l r) -> (f l, f r) Source #

While more constrained, when available, this default is going to be faster than the one provided in the typeclass