Data.Filtrable

Methods

• mapMaybe :: (a -> Maybe b) -> f a -> f b

  Map the container with the given function, dropping the elements for which it returns Nothing.

• catMaybes :: f (Maybe a) -> f a

  catMaybes = mapMaybe id

• filter :: (a -> Bool) -> f a -> f a

  Drop the elements for which the given predicate is False.

• mapMaybeA :: (Traversable f, Applicative p) => (a -> p (Maybe b)) -> f a -> p (f b)

  Traverse the container with the given function, dropping the elements for which it returns Nothing.

• filterA :: (Traversable f, Applicative p) => (a -> p Bool) -> f a -> p (f a)

  Drop the elements for which the given predicate is False.

• mapEither :: (a -> Either b c) -> f a -> (f b, f c)

  Map the container with the given function, collecting the Lefts and the Rights separately.

• mapEitherA :: (Traversable f, Applicative p) => (a -> p (Either b c)) -> f a -> p (f b, f c)

  Traverse the container with the given function, collecting the Lefts and the Rights separately.

• partitionEithers :: f (Either a b) -> (f a, f b)

  partitionEithers = mapEither id