minimumBy -package:vector-sized

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.
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.
minimumBy :: (a -> a -> Ordering) -> Fold a (Maybe a)
foldl Control.Foldl
Computes the minimum element with respect to the given comparison function
minimumBy :: (a -> a -> Ordering) -> Fold1 a a
foldl Control.Foldl.NonEmpty
Computes the minimum element with respect to the given comparison function
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
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.
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.
minimumBy :: (a -> a -> Ordering) -> Vector a -> a
rio RIO.Vector.Boxed.Partial
O(n) Yield the minimum 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.
minimumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a
rio RIO.Vector.Storable.Partial
O(n) Yield the minimum element of the vector according to the given comparison function. The vector may not be empty.
minimumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a
rio RIO.Vector.Unboxed.Partial
O(n) Yield the minimum element of the vector according to the given comparison function. The vector may not be empty.
minimumBy :: MonoFoldable mono => (Element mono -> Element mono -> Ordering) -> NonNull mono -> Element mono
mono-traversable Data.NonNull
Get the minimum element of a monomorphic container, using a supplied element ordering function. Safe version of minimumByEx, only works on monomorphic containers wrapped in a NonNull.
minimumBy :: Foldable f => (a -> a -> Ordering) -> T f a -> a
non-empty Data.NonEmpty
minimumBy is a total function
minimumBy :: Monad m => (a -> a -> Ordering) -> SerialT m a -> m (Maybe a)
streamly Streamly.Internal.Data.Stream.IsStream Streamly.Prelude
Determine the minimum element in a stream using the supplied comparison function. 
minimumBy = Stream.fold Fold.minimumBy
minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
basic-prelude BasicPrelude
minimumBy :: (Contiguous arr, Element arr a) => (a -> a -> Ordering) -> arr a -> Maybe a
contiguous Data.Primitive.Contiguous
The least element of a structure with respect to the given comparison function.
minimumBy :: (a -> a -> Ordering) -> NonEmpty a -> a
universum Universum.List.Safe
The least element of a NonEmpty with respect to the given comparison function.
minimumBy :: Monad m => (a -> a -> Ordering) -> Fold m a (Maybe a)
streamly-core Streamly.Data.Fold Streamly.Internal.Data.Fold
Computes the minimum element with respect to the given comparison function
minimumBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> m (Maybe a)
streamly-core Streamly.Internal.Data.Stream
minimumBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> m (Maybe a)
streamly-core Streamly.Internal.Data.StreamK
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.
minimumBy :: (a -> a -> Ordering) -> [a] -> a
prelude-compat Data.List2010
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)
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.
minimumBy :: (Unbox a) => (a -> a -> Ordering) -> Histogram bin a -> a
histogram-fill Data.Histogram
minimumBy :: (Vector v a) => (a -> a -> Ordering) -> Histogram v bin a -> a
histogram-fill Data.Histogram.Generic
Minimal bin content using custom comparison.