minimumBy -package:base-prelude

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

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

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

vector Data.Vector Data.Vector.Strict

O(n) Yield the minimum 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.

Examples

>>> import Data.Ord

>>> import qualified Data.Vector as V

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

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

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

vector Data.Vector.Generic

O(n) Yield the minimum 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.

Examples

>>> import Data.Ord

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

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

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

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

vector Data.Vector.Primitive

O(n) Yield the minimum 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.

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

vector Data.Vector.Storable

O(n) Yield the minimum 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.

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

vector Data.Vector.Unboxed

O(n) Yield the minimum 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.

Examples

>>> import Data.Ord

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

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

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

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

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

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 :: Vector v a => (a -> a -> Ordering) -> Vector v (n + 1) a -> a

vector-sized Data.Vector.Generic.Sized