composing two comparison functions?

user_866915 0
Viewed 1908

I'd like to sort by one property and then by another (if the first property is the same.)

What's the idiomatic way in Haskell of composing two comparison functions, i.e. a function used with sortBy?

Given

f :: Ord a => a -> a -> Ordering
g :: Ord a => a -> a -> Ordering

composing f and g would yield:

h x y = case v of
          EQ -> g x y
          otherwise -> v
        where v = f x y
sorting haskell
2 Answers

You can use the <> operator. In this example bigSort sorts string by their numerical value, first comparing length and then comparing lexicographically.

import Data.List (sortBy)
import Data.Ord (compare, comparing)

bigSort :: [String] -> [String]
bigSort = sortBy $ (comparing length) <> compare

Example: 

bigSort ["31415926535897932384626433832795","1","3","10","3","5"] = 
        ["1","3","3","5","10","31415926535897932384626433832795"]

<> is an alias of mappend from the Data.Monoid module (see jberryman answer).

The (free) book Learn You a Haskell for Great Good! explains how it works here in Chapter 11

instance Monoid Ordering where  
   mempty = EQ  
   LT `mappend` _ = LT
   EQ `mappend` y = y
   GT `mappend` _ = GT

The instance is set up like this: when we mappend two Ordering values, the one on the left is kept, unless the value on the left is EQ, in which case the right one is the result. The identity is EQ.

user_7861860
Related