#661: Serious Data.HashTable bug
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority: high| Milestone: 6.4.2
On 17 January 2006 21:40, Bulat Ziganshin wrote:
Hello GHC,
Monday, January 16, 2006, 2:01:53 PM, you wrote:
Some notes on why this bug is still here: I suspect there is a bug
in the compacting GC, at least in 6.4.x.
i also occasionally coming through this bug, especially in 6.4.0. i
John Goerzen [EMAIL PROTECTED] writes:
Meanwhile, I noted that the HaXml repo on darcs.haskell.org seems
to be a verbatim copy of the darcs repo at York.
Ahh. You are correct.
Re-converting now, since you've presumably committed patches to the
darcs side, is probably not going to be
Hi List,
I'm running GHC and GCC head-to-head on the task of adding a bunch of
long IOUArray-Vectors really fast. My machine is a Linux-ppc PowerBook
and gets a runtime for the GHC-compiled binary that's about 10x as long
as for GCC. Simon M. tells me this should be much better. Here are the
Sven Moritz Hallberg [EMAIL PROTECTED] writes:
I'm running GHC and GCC head-to-head on the task of adding a bunch of
long IOUArray-Vectors really fast. My machine is a Linux-ppc PowerBook
and gets a runtime for the GHC-compiled binary that's about 10x as long
as for GCC.
Is it possible that
Hello Sven,
Wednesday, January 18, 2006, 3:33:40 PM, you wrote:
SMH and gets a runtime for the GHC-compiled binary that's about 10x as long
SMH as for GCC. Simon M. tells me this should be much better. Here are the
attached version is only 5 times slower :) please note that
1)
Bulat Ziganshin wrote:
Wednesday, January 18, 2006, 3:33:40 PM, you wrote:
SMH and gets a runtime for the GHC-compiled binary that's about 10x as long
SMH as for GCC. Simon M. tells me this should be much better. Here are the
attached version is only 5 times slower :) please note that
1)
Hello Malcolm,
Wednesday, January 18, 2006, 4:22:23 PM, you wrote:
I'm running GHC and GCC head-to-head on the task of adding a bunch of
long IOUArray-Vectors really fast. My machine is a Linux-ppc PowerBook
and gets a runtime for the GHC-compiled binary that's about 10x as long
as for GCC.
Simon Peyton-Jones wrote:
I'm very interested to know whether you like it or hate it.
In the latter case, I'd also like to know whether you also
have programs that will be broken by the change.
I don't use GADTs yet and I assume this change will not (seriously)
break our code, but let me/us
Hello Simon,
Wednesday, January 18, 2006, 5:31:25 PM, you wrote:
2) generating random values takes about 1.5-2 seconds by itself.
Haskell's RNG is very different from C's one
SM I squeezed a bit more out (see attached).
x `seq` v `seq` return ()
it's new trick for me :) now the
I'm trying to run the following sequence on ghc 6.4: ghc -fglasgow-exts --make Main ghc -o exec Main.o Exemplo1.oBut I always get this error message after the second command:/usr/lib/ghc-6.4/libHSrts.a(Main.o)(.text+0xe): In function `main':: undefined reference to
Hello Bulat,
Wednesday, January 18, 2006, 8:34:54 PM, you wrote:
BZ the only cause that this code is only 3 times slower is that C version
BZ is really limited by memory speed. when tested on 1000-element
BZ arrays, it is 20 times slower. i'm not yet tried SSE optimization for
BZ gcc ;)
sorry,
On 1/18/06, Tays Soares [EMAIL PROTECTED] wrote:
I'm trying to run the following sequence on ghc 6.4:
ghc -fglasgow-exts --make Main
ghc -o exec Main.o Exemplo1.o
But I always get this error message after the second command:
/usr/lib/ghc-6.4/libHSrts.a(Main.o)(.text+0xe): In function
On Wed, Jan 18, 2006 at 06:18:29PM +0300, Bulat Ziganshin wrote:
:) even C version performs only 20 millions of additions in one second
because this program is most limited by memory throughput - it access
to 24 memory bytes per each addition. GHC just can't produce simple
loops even for
On Wed, Jan 18, 2006 at 08:54:43PM +0300, Bulat Ziganshin wrote:
sorry, with the gcc -O3 -ffast-math -fstrict-aliasing -funroll-loops
the C version is 50 times faster than best Haskell one... it's the
loop from C version:
I believe something similar to what I noted here is the culprit:
I really like the way you use a set of constraints
(IN m1 ms, IN m2 ms, IN m3 ms)
to maintain the set of marks. Previously I've thought of using a nested
tuple type
(m1, (m2, (m3 (
to maintain the set, but that is far less convenient. Very neat.
Why do you need the
Simon Peyton-Jones simonpj at microsoft.com writes:
I really like the way you use a set of constraints
(IN m1 ms, IN m2 ms, IN m3 ms)
to maintain the set of marks. Previously I've thought of using a nested
tuple type
(m1, (m2, (m3 (
to maintain the set, but that is far
I have a program that I *know* can run faster... I know there's
duplicated effort in there somewhere, the question is where. The
heap profile reflects exactly what I would expect it to, so I want a
reasonably accurate time profile. Is there any way to get such a thing?
Thanks
Bob
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Dominic Steinitz wrote:
I really like the way you use a set of constraints
(IN m1 ms, IN m2 ms, IN m3 ms)
to maintain the set of marks. Previously I've thought of using a nested
tuple type
(m1, (m2, (m3 (
to maintain the set, but
Thomas Davie wrote:
I have a program that I *know* can run faster... I know there's
duplicated effort in there somewhere, the question is where. The heap
profile reflects exactly what I would expect it to, so I want a
reasonably accurate time profile. Is there any way to get such a thing?
On Wednesday 18 January 2006 11:33, Simon Peyton-Jones wrote:
I really like the way you use a set of constraints
(IN m1 ms, IN m2 ms, IN m3 ms)
to maintain the set of marks. Previously I've thought of using a
nested tuple type
(m1, (m2, (m3 (
to maintain the set, but that is
Introduction: Bluespec, Inc. is a hardware design startup based in
Waltham, Massachusetts that is building the next generation of
Electronic Design Automation (EDA) tools. Bluespec's toolset, which is
based on functional programming technology, delivers a high-level design
and verification
Tom Hawkins wrote:
I have a chunk of Haskell code I would like wrap up and distribute as
a library. Is there a way to build a static library (*.a) that
includes my code plus the Haskell runtime, which C programs can easily
link against? Here is what I have tried so far...
ghc --make -fffi
Taral wrote:
On 1/17/06, Keean Schupke [EMAIL PROTECTED] wrote:
Just made a few modifications and thought it might be useful to
people. I have rewritten the functions as
liftR and bracketR over a MonadIO monad interface (allowing
monad-transformers to be used).
I'm sorry, but what
On 1/18/06, Keean Schupke [EMAIL PROTECTED] wrote:
It didnt when I wrote the MonadIO stuff that I use! Here is the missing
file ... I tried to put it all in
one, but missed the use of up3. (see attached)
All I see is up3 = undefined... somehow I don't think that will work.
As far as I know,
up3 is quite easy to define, but it is specific to the monad-transformer
you are lifting through... see attached for definition for
the state-monad-transformer.
Keean.
Taral wrote:
On 1/18/06, Keean Schupke [EMAIL PROTECTED] wrote:
It didnt when I wrote the MonadIO stuff that I use!
On 1/18/06, Keean Schupke [EMAIL PROTECTED] wrote:
up3 is quite easy to define, but it is specific to the monad-transformer
you are lifting through... see attached for definition for
the state-monad-transformer.
Ah, you're using undefined for the state. If you're going to do that,
though, why
Sorry if this is too off-topic for this list.
I'm a hobbyist programmer and I've recently become interested in lazy
functional languages, particularly the optimization strategies available
to them during compilation. I've been playing around with Haskell for
about a year and it has been an
On 1/18/06, Sam Goldman [EMAIL PROTECTED] wrote:
Sorry if this is too off-topic for this list.
I'm a hobbyist programmer and I've recently become interested in lazy
functional languages, particularly the optimization strategies available
to them during compilation. I've been playing around
On Wed, 18 Jan 2006, Dimitry Golubovsky wrote:
Is it possible to redirect a Handle (say stdout) somewhere only within
a running thread (started with forkIO) not touching the same handle
for the main and other threads?
I think it's fairly simple, if I have understood your requirement.
I assume
On Wednesday 18 January 2006 19:01, Dimitry Golubovsky wrote:
Is it possible to redirect a Handle (say stdout) somewhere only
within a running thread (started with forkIO) not touching the same
handle for the main and other threads?
I have a lot of code written with putStr(Ln) which was used
On Jan 18, 2006, at 2:59 PM, Benjamin Franksen wrote:
On Wednesday 18 January 2006 19:01, Dimitry Golubovsky wrote:
Is it possible to redirect a Handle (say stdout) somewhere only
within a running thread (started with forkIO) not touching the same
handle for the main and other threads?
I
To read a file using a packed string, I need to use this function,
right?
hGetPS :: Handle - Int - IO PackedString
What's the Int? Do you have to specify the length in advance? I don't
know how packed strings are implemented, and I'm having trouble finding
much documentation.
I'm trying to
Hello Dimitry,
Wednesday, January 18, 2006, 9:01:28 PM, you wrote:
DG new Handle. Rewriting the code is not a convenient way (but will be
DG done if nothing else helps) because then I will need to pass that
DG handle around.
implicit parameter or global IORef may save father of russian
On Wed, 2006-01-18 at 13:38 -0500, Sam Goldman wrote:
Sorry if this is too off-topic for this list.
I'm a hobbyist programmer and I've recently become interested in lazy
functional languages, particularly the optimization strategies available
to them during compilation. I've been playing
Thanks everybody who answered.
Indeed, forkProcess is something I completely overlooked...
--
Dimitry Golubovsky
Anywhere on the Web
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Jan 17, 2006 at 06:13:14PM +, Keean Schupke wrote:
Just made a few modifications and thought it might be useful to
people. I have rewritten the functions as
liftR and bracketR over a MonadIO monad interface (allowing
monad-transformers to be used). This is now
usable as
37 matches
Mail list logo
