list sorting

[John Meacham]

is there a function floating around for _efficiently_ sorting a list of
lists that will not evaluate any more of the lists than is needed to
sort them properly and does not re-compare the common prefix of said
lists?

as in,
sortLists :: Ord a => [[a]] -> [[a]]
sortLists = ...

if it proves faster in the general case than 'sort', then a RULES
pragma might be in order to use it instead when sorting lists. a very
common case being sorting strings.

        John

-- 
John Meacham - ⑆repetae.net⑆john⑈