maximumBy

maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
base Data.List Data.Foldable
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.
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.
maximumBy :: (a -> a -> Ordering) -> Vector a -> a
vector Data.Vector Data.Vector.Strict
O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins. This behavior is different from maximumBy which returns the last tie.

Examples

>>> import Data.Ord

>>> import qualified Data.Vector as V

>>> V.maximumBy (comparing fst) $ V.fromList [(2,'a'), (1,'b')]
(2,'a')

>>> V.maximumBy (comparing fst) $ V.fromList [(1,'a'), (1,'b')]
(1,'a')
maximumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a
vector Data.Vector.Generic
O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins. This behavior is different from maximumBy which returns the last tie.

Examples

>>> import Data.Ord

>>> import qualified Data.Vector.Strict as V

>>> V.maximumBy (comparing fst) $ V.fromList [(2,'a'), (1,'b')]
(2,'a')

>>> V.maximumBy (comparing fst) $ V.fromList [(1,'a'), (1,'b')]
(1,'a')
maximumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a
vector Data.Vector.Primitive
O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins. This behavior is different from maximumBy which returns the last tie.
maximumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a
vector Data.Vector.Storable
O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins. This behavior is different from maximumBy which returns the last tie.
maximumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a
vector Data.Vector.Unboxed
O(n) Yield the maximum element of the vector according to the given comparison function. The vector may not be empty. In case of a tie, the first occurrence wins. This behavior is different from maximumBy which returns the last tie.

Examples

>>> import Data.Ord

>>> import qualified Data.Vector.Unboxed as VU

>>> VU.maximumBy (comparing fst) $ VU.fromList [(2,'a'), (1 :: Int,'b')]
(2,'a')

>>> VU.maximumBy (comparing fst) $ VU.fromList [(1,'a'), (1 :: Int,'b')]
(1,'a')
bimaximumBy :: Bifoldable t => (a -> a -> Ordering) -> t a a -> a
base Data.Bifoldable
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: 
>>> bimaximumBy compare (42, 17)
42

>>> bimaximumBy compare (Left 17)
17

>>> bimaximumBy compare (BiList [42, 17, 23] [-5, 18])
42
On empty structures, this function throws an exception: 
>>> bimaximumBy compare (BiList [] [])
*** Exception: bifoldr1: empty structure
...