- biall : Bifoldable p => (a -> Bool) -> (b -> Bool) -> p a b -> Bool
The disjunction of the collective results of applying a predicate to all
elements of a structure. `biall` short-circuits from left to right.
Totality: total- biand : Bifoldable p => p Lazy Bool Lazy Bool -> Bool
The conjunction of all elements of a structure containing lazy boolean
values. `biand` short-circuits from left to right, evaluating until either an
element is `False` or no elements remain.
Totality: total- biany : Bifoldable p => (a -> Bool) -> (b -> Bool) -> p a b -> Bool
The disjunction of the collective results of applying a predicate to all
elements of a structure. `biany` short-circuits from left to right.
Totality: total- bichoice : (Bifoldable p, Alternative f) => p Lazy (f a) Lazy (f a) -> f a
Bifold using Alternative.
If you have a left-biased alternative operator `<|>`, then `choice` performs
left-biased choice from a list of alternatives, which means that it
evaluates to the left-most non-`empty` alternative.
Totality: total- bichoiceMap : (Bifoldable p, Alternative f) => (a -> f x) -> (b -> f x) -> p a b -> f x
A fused version of `bichoice` and `bimap`.
Totality: total- biconcat : (Bifoldable p, Monoid m) => p m m -> m
Combines the elements of a structure using a monoid.
Totality: total- biconcatMap : (Bifoldable p, Monoid m) => (a -> m) -> (b -> m) -> p a b -> m
Combines the elements of a structure,
given ways of mapping them to a common monoid.
Totality: total- bifoldMap : (Bifoldable p, Monoid m) => (a -> m) -> (b -> m) -> p a b -> m
Combines the elements of a structure,
given ways of mapping them to a common monoid.
Totality: total- bifoldlM : (Bifoldable p, Monad m) => (a -> b -> m a) -> (a -> c -> m a) -> a -> p b c -> m a
Left associative monadic bifold over a structure.
Totality: total- bifor_ : (Bifoldable p, Applicative f) => p a b -> (a -> f x) -> (b -> f y) -> f ()
Like `bitraverse_` but with the arguments flipped.
Totality: total- bior : Bifoldable p => p Lazy Bool Lazy Bool -> Bool
The disjunction of all elements of a structure containing lazy boolean
values. `bior` short-circuits from left to right, evaluating either until an
element is `True` or no elements remain.
Totality: total- biproduct : (Bifoldable p, Num a) => p a a -> a
Multiply together all elements of a structure.
Totality: total- biproduct' : (Bifoldable p, Num a) => p a a -> a
Multiply together all elements of a structure.
Same as `product` but tail recursive.
Totality: total- bisequence_ : (Bifoldable p, Applicative f) => p (f a) (f b) -> f ()
Evaluate each computation in a structure and discard the results.
Totality: total- bisum : (Bifoldable p, Num a) => p a a -> a
Add together all the elements of a structure.
Totality: total- bisum' : (Bifoldable p, Num a) => p a a -> a
Add together all the elements of a structure.
Same as `bisum` but tail recursive.
Totality: total- bitraverse_ : (Bifoldable p, Applicative f) => (a -> f x) -> (b -> f y) -> p a b -> f ()
Map each element of a structure to a computation, evaluate those
computations and discard the results.
Totality: total