Hi all,
[Hoping it's not too late.]
During my work on parallelising 'ghc --make' [1] I encountered a
stumbling block: running 'ghc --make' can be often much faster than
using separate compile ('ghc -c') and link stages, which means that
any parallel build tool built on top of 'ghc -c' will be
Questions:
Would implementing this optimisation be a worthwhile/realistic GSoC project?
What are other potential ways to bring 'ghc -c' performance up to par
with 'ghc --make'?
I implemented a ghc server that runs several persistent ghcs, and
distributes compiles among them. It seemed to
Dear all,
I ran a small example program, and this is what I got from using the -s flag:
486,550,118,368 bytes allocated in the heap
323,749,418,440 bytes copied during GC
1,842,979,344 bytes maximum residency (219 sample(s))
204,653,688 bytes maximum slop
4451 MB total memory
Lesson learned: for next year, write a Haskell program that tells if a
given -cafe thread or reddit discussion is a April Fool's joke or not.
On Sun, Apr 1, 2012 at 7:10 PM, Christopher Done
chrisd...@googlemail.comwrote:
I actually read the first couple paragraphs and thought “sounds
On 2 April 2012 14:41, Michael Snoyman mich...@snoyman.com wrote:
import Data.Time
main = do
now - getCurrentTime
let (_, month, day) = toGregorian $ utctDay now
putStrLn $
if month == 4 day == 1
then It's a joke
else It's real
import Data.Time
main
Thanks,
that was a rather curious problem then. With more version annotations,
hackage compiled everything.
Thanks for for testing!
Gruss,
Christian
* Albert Y. C. Lai tre...@vex.net [31.03.2012 03:58]:
On 12-03-30 06:37 PM, Christian Höner zu Siederdissen wrote:
I fail to remember or
I for one think this would make a good GSoC project. Make sure you get
your application in in time though.
-- Johan
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
On Mon, Apr 2, 2012 at 5:41 AM, Michael Snoyman mich...@snoyman.com wrote:
On Mon, Apr 2, 2012 at 3:38 PM, Alp Mestanogullari alpmes...@gmail.com
wrote:
Lesson learned: for next year, write a Haskell program that tells if a given
-cafe thread or reddit discussion is a April Fool's joke or
ROTFL!
Ben
Gershom B wrote:
The records discussion has been really complicated and confusing. But
I have a suggestion that should provide a great deal of power to
records, while being mostly[1] backwards-compatible with Haskell 2010.
Consider this example:
data A a = A{a:a, aa::a, aaa
On 02/04/2012, at 10:10 PM, Jurriaan Hage wrote:
Can anyone tell me what the exact difference is between
1,842,979,344 bytes maximum residency (219 sample(s))
and
4451 MB total memory in use (0 MB lost due to fragmentation)
I could not find this information in the docs anywhere, but I
10 matches
Mail list logo
