Re: [GHC] #638: Patch to make Control.Monad.replicateM_ faster
#638: Patch to make Control.Monad.replicateM_ faster -+-- Reporter: [EMAIL PROTECTED] | Owner: Type: task | Status: closed Priority: normal | Milestone: 6.8.1 Component: libraries/base |Version: 6.4.1 Severity: minor| Resolution: fixed Keywords: patch| Difficulty: Unknown Testcase: N/A | Architecture: Multiple Os: Multiple | -+-- Changes (by simonmar): * status: new = closed * resolution: = fixed * milestone: 6.8 branch = 6.8.1 Comment: And indeed replicateM_ does deforest in 6.8.1. Bug closed. -- Ticket URL: http://hackage.haskell.org/trac/ghc/ticket/638#comment:4 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
Re: [GHC] #638: Patch to make Control.Monad.replicateM_ faster
#638: Patch to make Control.Monad.replicateM_ faster +--- Reporter: [EMAIL PROTECTED] |Owner: Type: task | Status: new Priority: normal |Milestone: 6.8 Component: libraries/base | Version: 6.4.1 Severity: minor| Resolution: Keywords: patch| Difficulty: Unknown Os: Multiple | Testcase: N/A Architecture: Multiple | +--- Comment (by simonmar): It looks like the existing definition of `replicateM_` should deforest. We should investigate whether it does, and if not, why not. -- Ticket URL: http://hackage.haskell.org/trac/ghc/ticket/638 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
Re: [GHC] #638: Patch to make Control.Monad.replicateM_ faster
#638: Patch to make Control.Monad.replicateM_ faster -+-- Reporter: ekarttun@cs.helsinki.fi | Owner: Type: task | Status: new Priority: normal | Milestone: 6.8 Component: libraries/base |Version: 6.4.1 Severity: minor| Resolution: Keywords: patch| Difficulty: Unknown Testcase: N/A | Architecture: Multiple Os: Multiple | -+-- Changes (by igloo): * milestone: = 6.8 * keywords: = patch * testcase: = N/A -- Ticket URL: http://hackage.haskell.org/trac/ghc/ticket/638 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
[GHC] #638: Patch to make Control.Monad.replicateM_ faster
#638: Patch to make Control.Monad.replicateM_ faster +--- Reporter: ekarttun@cs.helsinki.fi |Owner: Type: task | Status: new Priority: normal |Milestone: Component: libraries/base | Version: 6.4.1 Severity: minor| Keywords: Os: Multiple | Difficulty: Unknown Architecture: Multiple | +--- Here is a darcs patch to the HEAD which makes Control.Monad.replicateM_ faster. -- Ticket URL: http://hackage.haskell.org/trac/ghc/ticket/638 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
Re: [GHC] #638: Patch to make Control.Monad.replicateM_ faster
On Sat, Dec 17, 2005 at 05:26:33PM +0100, Tomasz Zielonka wrote: Are you sure it is really more efficient? I remember that I was amazed that GHC compiled my (sequence_ $ repeat $ ...) code to a really tight loop with no allocations. Hmmm... perhaps no allocations is not surprising with repeat, which simply creates a self-referring list, but still AFAIR the generated code did not create lists at all. Best regards Tomasz -- I am searching for a programmer who is good at least in some of [Haskell, ML, C++, Linux, FreeBSD, math] for work in Warsaw, Poland ___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
Re: [GHC] #638: Patch to make Control.Monad.replicateM_ faster
On Sat, Dec 17, 2005 at 03:58:19PM -, GHC wrote: #638: Patch to make Control.Monad.replicateM_ faster --+- Reporter: ekarttun@cs.helsinki.fi | Owner: Type: task | Status: new Priority: normal | Milestone: Component: libraries/base |Version: 6.4.1 Severity: minor| Resolution: Keywords: | Os: Multiple Difficulty: Unknown | Architecture: Multiple --+- Comment (by ekarttun@cs.helsinki.fi): Patch available as http://cs.helsinki.fi/u/ekarttun/haskell/replicateM_.patch Trac does not seem to like me uploading attachments... Are you sure it is really more efficient? I remember that I was amazed that GHC compiled my (sequence_ $ repeat $ ...) code to a really tight loop with no allocations. Best regards Tomasz -- I am searching for a programmer who is good at least in some of [Haskell, ML, C++, Linux, FreeBSD, math] for work in Warsaw, Poland ___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
