Re: [Haskell-cafe] What is the best way to preserve the order of a list

Henk-Jan,

...

sortOnLab = sortBy (\(l, _) (m, _) -> compare l m)

The following does the same: sortOnLab = sort

It does, but I kind of liked the analogy with sortOnPrio, which could have been defined in some other ways as well, of course. Cheers, Stefan