Data.Witherable

Contents

• Generalization
• Cloning
• Witherable from Traversable

Description

Synopsis

• class Traversable t => Witherable t where
  • wither :: Applicative f => (a -> f (Maybe b)) -> t a -> f (t b)
  • mapMaybe :: (a -> Maybe b) -> t a -> t b
  • catMaybes :: t (Maybe a) -> t a
  • filterA :: Applicative f => (a -> f Bool) -> t a -> f (t a)
  • filter :: (a -> Bool) -> t a -> t a
• witherM :: (Witherable t, Monad m) => (a -> MaybeT m b) -> t a -> m (t b)
• blightM :: (Monad m, Witherable t) => t a -> (a -> MaybeT m b) -> m (t b)
• ordNub :: (Witherable t, Ord a) => t a -> t a
• hashNub :: (Witherable t, Eq a, Hashable a) => t a -> t a
• forMaybe :: (Witherable t, Applicative f) => t a -> (a -> f (Maybe b)) -> f (t b)
• type FilterLike f s t a b = (a -> f (Maybe b)) -> s -> f t
• type Filter s t a b = forall f. Applicative f => FilterLike f s t a b
• type FilterLike' f s a = FilterLike f s s a a
• type Filter' s a = forall f. Applicative f => FilterLike' f s a
• witherOf :: FilterLike f s t a b -> (a -> f (Maybe b)) -> s -> f t
• forMaybeOf :: FilterLike f s t a b -> s -> (a -> f (Maybe b)) -> f t
• mapMaybeOf :: FilterLike Identity s t a b -> (a -> Maybe b) -> s -> t
• catMaybesOf :: FilterLike Identity s t (Maybe a) a -> s -> t
• filterAOf :: Functor f => FilterLike' f s a -> (a -> f Bool) -> s -> f s
• filterOf :: FilterLike' Identity s a -> (a -> Bool) -> s -> s
• ordNubOf :: Ord a => FilterLike' (State (Set a)) s a -> s -> s
• hashNubOf :: (Eq a, Hashable a) => FilterLike' (State (HashSet a)) s a -> s -> s
• cloneFilter :: FilterLike (Peat a b) s t a b -> Filter s t a b
• newtype Peat a b t = Peat {
  • runPeat :: forall f. Applicative f => (a -> f (Maybe b)) -> f t
  }
• newtype Chipped t a = Chipped {
  • getChipped :: t (Maybe a)
  }

Documentation

traverse f ≡ wither (fmap Just . f)

t . wither f = wither (t . f)

forMaybe == flip wither

Generalization

forMaybeOf == flip

Cloning

Witherable from Traversable