(a -> a -> Ordering) -> [a] -> a -package:ghc-internal

The largest element of a non-empty structure with respect to the given comparison function. Structure order is used as a tie-breaker: if there are multiple largest elements, the rightmost of them is chosen.

Examples

Basic usage:

>>> maximumBy (compare `on` length) ["Hello", "World", "!", "Longest", "bar"]
"Longest"

WARNING: This function is partial for possibly-empty structures like lists.

minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a

base Data.List Data.Foldable

The least element of a non-empty structure with respect to the given comparison function. Structure order is used as a tie-breaker: if there are multiple least elements, the leftmost of them is chosen.

Examples

Basic usage:

>>> minimumBy (compare `on` length) ["Hello", "World", "!", "Longest", "bar"]
"!"

WARNING: This function is partial for possibly-empty structures like lists.

maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a

protolude Protolude, base-prelude BasePrelude, universum Universum.Unsafe, numhask NumHask.Prelude, rebase Rebase.Prelude, xmonad-contrib XMonad.Prelude, LambdaHack Game.LambdaHack.Core.Prelude, faktory Faktory.Prelude, calligraphy Calligraphy.Prelude

The largest element of a non-empty structure with respect to the given comparison function.

Examples

Basic usage:

>>> maximumBy (compare `on` length) ["Hello", "World", "!", "Longest", "bar"]
"Longest"

WARNING: This function is partial for possibly-empty structures like lists.

minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a

protolude Protolude, base-prelude BasePrelude, universum Universum.Unsafe, numhask NumHask.Prelude, rebase Rebase.Prelude, xmonad-contrib XMonad.Prelude, LambdaHack Game.LambdaHack.Core.Prelude, faktory Faktory.Prelude, calligraphy Calligraphy.Prelude

The least element of a non-empty structure with respect to the given comparison function.

Examples

Basic usage:

>>> minimumBy (compare `on` length) ["Hello", "World", "!", "Longest", "bar"]
"!"

WARNING: This function is partial for possibly-empty structures like lists.

maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a

rio RIO.List.Partial

The largest element of a non-empty structure with respect to the given comparison function.

minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a

rio RIO.List.Partial

The least element of a non-empty structure with respect to the given comparison function.

maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a

basic-prelude BasicPrelude

minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a

basic-prelude BasicPrelude

maximumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a

rio RIO.Vector.Partial

O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty.

minimumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a

rio RIO.Vector.Partial

O(n) Yield the minimum element of the vector according to the given comparison function. The vector may not be empty.

maximumBy :: Foldable1 t => (a -> a -> Ordering) -> t a -> a

base Data.Foldable1

The largest element of a non-empty structure with respect to the given comparison function. Structure order is used as a tie-breaker: if there are multiple largest elements, the rightmost of them is chosen.

minimumBy :: Foldable1 t => (a -> a -> Ordering) -> t a -> a

base Data.Foldable1

The least element of a non-empty structure with respect to the given comparison function. Structure order is used as a tie-breaker: if there are multiple least elements, the leftmost of them is chosen.

maximumBy :: Foldable1 t => (a -> a -> Ordering) -> t a -> a

foldable1-classes-compat Data.Foldable1

The largest element of a non-empty structure with respect to the given comparison function.

minimumBy :: Foldable1 t => (a -> a -> Ordering) -> t a -> a

foldable1-classes-compat Data.Foldable1

The least element of a non-empty structure with respect to the given comparison function.

gmaximumBy :: GFoldable t => (a -> a -> Ordering) -> t a -> a

generic-deriving Generics.Deriving.Foldable

gminimumBy :: GFoldable t => (a -> a -> Ordering) -> t a -> a

generic-deriving Generics.Deriving.Foldable

minimumByMay :: (a -> a -> Ordering) -> [a] -> Maybe a

safe Safe, ihaskell IHaskellPrelude, hledger Hledger.Cli.Script, yesod-paginator Yesod.Paginator.Prelude