| definition: |
minimumBy :: (a -> a -> Ordering) -> [a] -> a
minimumBy cmp xs@(_:_) = foldl1 minBy xs
where
minBy x y = case cmp x y of
GT -> y
_ -> x
|
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns the minimum of a non-empty list --- according to the given comparison function |
| failfree: |
(_, {:})
|
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{:}) |-> _}
|
| name: |
minimumBy |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> a -> Prelude.Ordering) -> [a] -> a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |