diff options
| author | Ian Lynagh <igloo@earth.li> | 2012-06-22 20:48:48 +0100 |
|---|---|---|
| committer | Ian Lynagh <igloo@earth.li> | 2012-06-22 20:48:48 +0100 |
| commit | 0043f07ad8c9611a905379c2abd40bda0f39ebf9 (patch) | |
| tree | c856147c5658860f72a49ebeea610efadb8c4062 /compiler/utils/Util.lhs | |
| parent | 585ff572a1a2b755a3d9a94700859795f62a2e87 (diff) | |
| download | haskell-0043f07ad8c9611a905379c2abd40bda0f39ebf9.tar.gz | |
Remove some uses of sortLe
Technically the behaviour of sortWith has changed, as it used
x `le` y = get_key x < get_key y
(note "<" rather than "<="), but I assume that that was just a mistake.
Diffstat (limited to 'compiler/utils/Util.lhs')
| -rw-r--r-- | compiler/utils/Util.lhs | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/compiler/utils/Util.lhs b/compiler/utils/Util.lhs index 1268c52e54..b750a54354 100644 --- a/compiler/utils/Util.lhs +++ b/compiler/utils/Util.lhs @@ -569,9 +569,7 @@ sortLe :: (a->a->Bool) -> [a] -> [a] sortLe le = generalNaturalMergeSort le sortWith :: Ord b => (a->b) -> [a] -> [a] -sortWith get_key xs = sortLe le xs - where - x `le` y = get_key x < get_key y +sortWith get_key xs = sortBy (comparing get_key) xs minWith :: Ord b => (a -> b) -> [a] -> a minWith get_key xs = ASSERT( not (null xs) ) |