:: (a -> a -> Ordering) -> [a] -> a -package:rio

maximumBy :: (a -> a -> Ordering) -> [a] -> a
prelude-compat Data.List2010
minimumBy :: (a -> a -> Ordering) -> [a] -> a
prelude-compat Data.List2010
maximumBy :: (a -> a -> Ordering) -> [a] -> a
ghc-internal GHC.Internal.Data.OldList
The maximumBy function takes a comparison function and a list and returns the greatest element of the list by the comparison function. The list must be finite and non-empty. List order is used as a tie-breaker: if there are multiple greatest elements, the last of them is chosen.

Examples

We can use this to find the longest entry of a list: 
>>> maximumBy (\x y -> compare (length x) (length y)) ["Hello", "World", "!", "Longest", "bar"]
"Longest"

>>> minimumBy (\(a, b) (c, d) -> compare (abs (a - b)) (abs (c - d))) [(10, 15), (1, 2), (3, 5)]
(10, 15)
minimumBy :: (a -> a -> Ordering) -> [a] -> a
ghc-internal GHC.Internal.Data.OldList
The minimumBy function takes a comparison function and a list and returns the least element of the list by the comparison function. The list must be finite and non-empty. List order is used as a tie-breaker: if there are multiple least elements, the first of them is chosen.

Examples

We can use this to find the shortest entry of a list: 
>>> minimumBy (\x y -> compare (length x) (length y)) ["Hello", "World", "!", "Longest", "bar"]
"!"

>>> minimumBy (\(a, b) (c, d) -> compare (abs (a - b)) (abs (c - d))) [(10, 15), (1, 2), (3, 5)]
(1, 2)
maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
base Data.List Data.Foldable, ghc-internal GHC.Internal.Data.Foldable GHC.Internal.Data.List
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, ghc-internal GHC.Internal.Data.Foldable GHC.Internal.Data.List
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
basic-prelude BasicPrelude
minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
basic-prelude BasicPrelude
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
maximumByMay :: (a -> a -> Ordering) -> [a] -> Maybe a
safe Safe, ihaskell IHaskellPrelude, hledger Hledger.Cli.Script, yesod-paginator Yesod.Paginator.Prelude
minimumByMay :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
safe Safe.Foldable, verset Verset
maximumByMay :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
safe Safe.Foldable, verset Verset
maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
incipit-base Incipit.Foldable
Safe version of maximumBy.
minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
incipit-base Incipit.Foldable
Safe version of minimumBy.
maximumBy :: MonadThrow m => (a -> a -> Ordering) -> [a] -> m a
listsafe Data.List.Safe
The maximumBy function takes a comparison function and a list and returns the greatest element of the list by the comparison function. The list must be finite and non-empty. Empty lists throw an EmptyListException.
minimumBy :: MonadThrow m => (a -> a -> Ordering) -> [a] -> m a
listsafe Data.List.Safe
The minimumBy function takes a comparison function and a list and returns the least element of the list by the comparison function. The list must be finite and non-empty. Empty lists throw an EmptyListException.
maximumBy :: (Contiguous arr, Element arr a) => (a -> a -> Ordering) -> arr a -> Maybe a
contiguous Data.Primitive.Contiguous
The largest element of a structure with respect to the given comparison function.