| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Bifoldable.Partial
Synopsis
- bifoldl1 :: Bifoldable t => (a -> a -> a) -> t a a -> a
- bifoldr1 :: Bifoldable t => (a -> a -> a) -> t a a -> a
- bimaximum :: (Bifoldable t, Ord a) => t a a -> a
- bimaximumBy :: Bifoldable t => (a -> a -> Ordering) -> t a a -> a
- biminimum :: (Bifoldable t, Ord a) => t a a -> a
- biminimumBy :: Bifoldable t => (a -> a -> Ordering) -> t a a -> a
Documentation
bifoldl1 :: Bifoldable t => (a -> a -> a) -> t a a -> a #
A variant of bifoldl that has no base case,
and thus may only be applied to non-empty structures.
Since: base-4.10.0.0
bifoldr1 :: Bifoldable t => (a -> a -> a) -> t a a -> a #
A variant of bifoldr that has no base case,
and thus may only be applied to non-empty structures.
Since: base-4.10.0.0
bimaximum :: (Bifoldable t, Ord a) => t a a -> a #
The largest element of a non-empty structure.
Since: base-4.10.0.0
bimaximumBy :: Bifoldable t => (a -> a -> Ordering) -> t a a -> a #
The largest element of a non-empty structure with respect to the given comparison function.
Since: base-4.10.0.0
biminimum :: (Bifoldable t, Ord a) => t a a -> a #
The least element of a non-empty structure.
Since: base-4.10.0.0
biminimumBy :: Bifoldable t => (a -> a -> Ordering) -> t a a -> a #
The least element of a non-empty structure with respect to the given comparison function.
Since: base-4.10.0.0