Safe Haskell | Trustworthy |
---|
- class Choice p => Folding p where
- prefix :: Foldable t => t a -> p a b -> p a b
- prefix1 :: a -> p a b -> p a b
- prefixOf :: Fold s a -> s -> p a b -> p a b
- postfix :: Foldable t => p a b -> t a -> p a b
- postfix1 :: p a b -> a -> p a b
- postfixOf :: Fold s a -> p a b -> s -> p a b
- run :: Foldable t => t a -> p a b -> b
- run1 :: a -> p a b -> b
- runOf :: Fold s a -> s -> p a b -> b
- beneath :: Profunctor p => Overloaded p Mutator s t a b -> p a b -> p s t
Documentation
class Choice p => Folding p whereSource
prefix :: Foldable t => t a -> p a b -> p a bSource
prefix1 :: a -> p a b -> p a bSource
prefixOf :: Fold s a -> s -> p a b -> p a bSource
postfix :: Foldable t => p a b -> t a -> p a bSource
postfix1 :: p a b -> a -> p a bSource
postfixOf :: Fold s a -> p a b -> s -> p a bSource
beneath :: Profunctor p => Overloaded p Mutator s t a b -> p a b -> p s tSource
This acts like a generalized notion of "costrength",
when applied to a Folding
, causing it to return the
left-most value that fails to match the Prism, or the
result of accumulating rewrapped in the Prism
if
everything matches.
>>>
run [Left 1, Left 2, Left 3] $ beneath _Left $ R id (+) 0
Left 6
>>>
run [Left 1, Right 2, Right 3] $ beneath _Left $ R id (+) 0
Right 2
beneath :: Prism s t a b -> p a b -> p s t beneath :: Iso s t a b -> p a b -> p s t