sortBy package:rio

sortBy :: (a -> a -> Ordering) -> [a] -> [a]
rio RIO.List
The sortBy function is the non-overloaded version of sort. 
>>> sortBy (\(a,_) (b,_) -> compare a b) [(2, "world"), (4, "!"), (1, "Hello")]
[(1,"Hello"),(2,"world"),(4,"!")]
sortBy :: (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a
rio RIO.NonEmpty
sortBy for NonEmpty, behaves the same as sortBy
sortBy :: (a -> a -> Ordering) -> Seq a -> Seq a
rio RIO.Seq
sortBy sorts the specified Seq according to the specified comparator. The sort is stable. If stability is not required, unstableSortBy can be slightly faster.
unstableSortBy :: (a -> a -> Ordering) -> Seq a -> Seq a
rio RIO.Seq
A generalization of unstableSort, unstableSortBy takes an arbitrary comparator and sorts the specified sequence. The sort is not stable. This algorithm is frequently faster and uses less memory than sortBy.