min(by:)
Returns the minimum element in the sequence, using the given predicate as the comparison between elements.
Declaration
@warn_unqualified_access func min(by areInIncreasingOrder: (Self.Element, Self.Element) throws -> Bool) rethrows -> Self.Element?Parameters
- areInIncreasingOrder:
A predicate that returns
trueif its first argument should be ordered before its second argument; otherwise,false.
Return Value
The sequence’s minimum element, according to areInIncreasingOrder. If the sequence has no elements, returns nil.
Discussion
The predicate must be a strict weak ordering over the elements. That is, for any elements a, b, and c, the following conditions must hold:
areInIncreasingOrder(a, a)is alwaysfalse. (Irreflexivity)If
areInIncreasingOrder(a, b)andareInIncreasingOrder(b, c)are bothtrue, thenareInIncreasingOrder(a, c)is alsotrue. (Transitive comparability)Two elements are incomparable if neither is ordered before the other according to the predicate. If
aandbare incomparable, andbandcare incomparable, thenaandcare also incomparable. (Transitive incomparability)
This example shows how to use the min(by:) method on a dictionary to find the key-value pair with the lowest value.
let hues = ["Heliotrope": 296, "Coral": 16, "Aquamarine": 156]
let leastHue = hues.min { a, b in a.value < b.value }
print(leastHue)
// Prints "Optional((key: "Coral", value: 16))"