Proposal #3271: new methods for Data.Sequence

[Simon Peyton-Jones]

I will look into this during August.  Add yourself to the cc list for #2353 if interested

Simon

| -----Original Message-----
| From: libraries-bounces at haskell.org [mailto:libraries-bounces at haskell.org] On
| Behalf Of Ross Paterson
| Sent: 03 August 2009 20:29
| To: libraries at haskell.org
| Subject: Re: Proposal #3271: new methods for Data.Sequence
| 
| On Mon, Jul 20, 2009 at 02:33:52PM -0400, Louis Wasserman wrote:
| > Among other things, I manually deforested the stable sorting algorithm,
| > resulting in a moderate performance gain on simply using Data.List.sortBy.
| 
| That's not supposed to be necessary, because toList is supposed to fuse
| with list consumers.  Unfortunately it doesn't in cases like this because
| it doesn't get inlined, even if we add an INLINE pragma, due to GHC bug
| #2353.  If the GHC bug isn't fixed, I think the next best thing would
| be to force the inlining of toList with a RULES pragma in Data.Foldable.
| _______________________________________________
| Libraries mailing list
| Libraries at haskell.org
| http://www.haskell.org/mailman/listinfo/libraries