On Dec 16, 2005, at 1:41 PM, Bulat Ziganshin wrote:
JR I do not have several fixed waiting periods, they are
determined by
JR the user.
by the user of library? by the poker player? what you exactly mean?
By the user of the library. Timers are used imprecisely, to send a
timeout event if
On Dec 15, 2005, at 9:51 PM, Bulat Ziganshin wrote:
if half-second precision of performing events is appropriate for you,
why don't use solution which holds all events for given second in one
list? you can use array of such lists, or map of lists, or even
ordered list of lists - it will
On Fri, Dec 16, 2005 at 04:41:05PM +0300, Bulat Ziganshin wrote:
Hello Joel,
Friday, December 16, 2005, 3:22:46 AM, you wrote:
TZ You don't have to check every few seconds. You can determine
TZ exactly how much you have to sleep - just check the timeout/
event with
TZ the lowest
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], Haskell-Cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] Substring replacements
Date: Fri, 16 Dec 2005 16:51:32 +0300
Hello Branimir,
Friday,
Hi again,
Now I've actually tested the barrier implementation by counting the
number of times each worker thread reaches the barrier. It's not a
proof, but I take it as strong indication, that it's not as bad, as I
first thought. If all workers have run the same number of times
(that is a
Scherrer, Chad writes:
When I'm using ghci, I have lots of modules that I
sometimes want to load as Main, and sometimes I only
want them loaded as a dependency from another module.
Currently, I have to go into each file to change the
module Foo where line to do this.
Maybe the -main-is
I thought I would get the _complete_ ghc tree so that I could build
ghc with patches of my own. I decided to get the libraries while I'm
at it. I got two errors and don't know what to do now.
Do I need to get the whole tree again? Can I somehow reapply the
patches that did not get applied?
Joel Reymont [EMAIL PROTECTED] writes:
I thought I would get the _complete_ ghc tree so that I could build
ghc with patches of my own. I decided to get the libraries while I'm
at it. I got two errors and don't know what to do now.
My guess is that at least one of these errors is something
I bit the bullet and... did a partial checkout. That worked but now
I'm missing a configure file. I did things like this:
aclocal
autoconf
./configure
checking for printf... yes
configure: creating ./config.status
config.status: creating mk/config.mk
config.status: creating mk/config.h
It is caused by the incompatiblity change of ffihugs
in Hugs 20050308 version.
To solve it, change a few lines in GraphicsLib/lib/x11/Makefile
78c78
ffihugs +G +L$*_stub_ffi.c $*.hs
---
ffihugs '-i$*_stub_ffi.c' $*.hs
129,130c129,130
Hi,
On 12/17/05, Joel Reymont [EMAIL PROTECTED] wrote:
I bit the bullet and... did a partial checkout. That worked but now
I'm missing a configure file. I did things like this:
aclocal
autoconf
./configure
checking for printf... yes
configure: creating ./config.status
config.status:
I thought I did :-). I just didn't get to 7.1. My bad and apologies!
On Dec 17, 2005, at 7:07 PM, wld wrote:
Well, RTBG (Building Guide) !
When building from CVS (I think, from darcs repo too),
you should do:
autoreconf
./configure
--
http://wagerlabs.com/
On Sat, Dec 17, 2005 at 06:14:55PM +, Joel Reymont wrote:
I thought I would get the _complete_ ghc tree so that I could build
ghc with patches of my own. I decided to get the libraries while I'm
at it. I got two errors and don't know what to do now.
Do I need to get the whole tree
Simon Marlow [EMAIL PROTECTED] writes:
On 16 December 2005 10:05, Joel Reymont wrote:
I'm trying to restrict GHC to 800Mb of heap at runtime by passing in
+RTS -M800M, the machine has 1Gb of memory and top shows free
physical memory dropping below 175Mb.
-M800m should do more or less the
On Sat, Dec 17, 2005 at 10:56:58PM +0100, Ketil Malde wrote:
Is there any chance there is a bug in recent GHCs (or perhaps Linux?)
affecting this? I'm fairly sure I've lately seen Haskell programs
consuming significantly larger amounts of memory than they should be
allowed to, and I can try
15 matches
Mail list logo
