Re: [Haskell-cafe] compare lengths of lists lazily

On 19.12.2011 19:29, Henning Thielemann wrote:

Shortest and most obfuscating solution I found is:

import Data.Ord (comparing) import Control.Applicative ((<$))

compareLength :: [a] -> [a] -> Ordering compareLength = comparing (()<$)

comparingLength = comparing void It's two character shorter