GHC Data.List.sort performance question

[Marcus D. Gabriel]

Hello Ian,

Thank you for the two links to the previous threads, I glanced at them 
and will
read them more carefully later so that I can understand the point a 
little better.
Sorry about the duplicate thread relative to the Haskell Cafe.

Thanks also for applying Bertram's patch.
 
Cheers,
- Marcus

Ian Lynagh wrote:
> Hi Marcus,
>
> On Mon, Jan 14, 2008 at 10:01:49PM +0100, Marcus D. Gabriel wrote:
>   
>> code in libraries/base/Data/List.hs
>> for merge is
>>
>> merge cmp xs [] = xs
>> merge cmp [] ys = ys
>>
>> merge cmp [] ys = ys
>> merge cmp xs [] = xs
>>     
>
> This actually came up a while ago, in this thread:
> http://thread.gmane.org/gmane.comp.lang.haskell.cafe/30598
>
> I've just applied Bertram's patch from
> http://www.haskell.org/pipermail/libraries/2007-November/008621.html
> which makes the change you suggest.
>
>
> Thanks
> Ian
>
> _______________________________________________
> Glasgow-haskell-users mailing list
> Glasgow-haskell-users at haskell.org
> http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
>
>
>   


-- 
  Marcus D. Gabriel, Ph.D.                    Email:    mdg at wanadoo.fr
  213 ter, rue de Mulhouse                      Tel: +33.3.89.69.05.06
  F68300 Saint Louis  FRANCE               Portable: +33.6.34.56.07.75