Juan Ignacio Garcia Garcia wrote:
> *P2> (fromRational ((toRational 4) - ( toRational 5.2 )))
> -1.2002
I can't explain this one, how would fromRational
know that it has to create a Double ?
Jan
___
Glasgow-haskell-users mailing list
[EMA
luc wrote:
>
> I tried FranTk with ghc 4.08 and got :
> (this is the "fixed" FrankTk, alledged working with 4.06, if im not
> wrong)
>
> are there any difference with 4.06 and 4.08 ?
Below is a list of fixes to get FranTk working with ghc4.08.
Jan
Run configure like normal, i.e.:
./configu
I implemented the programs for hash1 and hash2, but I had to
make a lot of changes to FiniteMap to get them to work:
- I changed foldl to foldl' (as defined in Hugs).
- I made foldFM strict (like foldl').
- I made the datatype FiniteMap strict (put !'s everywhere).
I put the programs below, maybe
Reducing the 46M reported on the shootout without changing the
program would be interesting. An easy way for improvement
would be to share characters and small integers like is done in Hugs.
This would mean the initial list of characters would be reduced from
40M to 24M, so the total should go do
Simon Peyton-Jones wrote:
>
> A String is a [Char] and a Char is a heap object. So
> a file represented as a string takes a massive 20 bytes/char
> (12 for the cons cell, 8 for the Char cell). Then it's all sucked
> through several functions.
>
> It's entirely possible, though, that the biggest
Reuben Thomas wrote:
>
> This one corrects a problem with the fix made in the last one that stopped
> anything to do with stat() working (e.g. hFileSize, reading directories &c.
> &c.).
>
> Sorry about that. The fix is still fragile and temporary; I'm waiting for
> the underlying mingwin problem
"Julian Seward (Intl Vendor)" wrote:
>
> I tried this, with ghc-4.08.1 -O both with and without
> profiling, on a Sparc box of I believe around 300 MHz,
> and I can't reproduce it at all. Without profiling,
> it allocates about 505 k of heap and runs in 0.02
> seconds.
>
> Ummm ?
>
> J
I didn
Hi,
I noticed ghc (version 4.08.1) floating point performance is
really slow on my computer: a 270Mhz sun ultra5. The program
below does 1 milion floating point multiplications and takes
2 seconds to run. I made a profile and it says most of the
time (93%) is spent in the function bar. Any idea wh
Simon Marlow wrote:
>
> I don't forsee any problems with the C stack - the stack pointer stays
> static during execution of Haskell code, and only moves when we do a C
> call or return to the RTS.
But how do I get the address of the bottom of the stack ? It seems I can
define a C main so I can g
Hi,
I'm trying to write an interface for a C library that
uses a Boehm type garbage collector. So, I need to get
the address of the bottom of the C stack. In a C
application this would look something like:
main()
{
int bottomOfStack;
}
Where "&bottomOfStack" would be the thing I need. S
I have a system that is compossed of many small libraries and
binaries. I wanted to be able to move the sources of some of
these libraries and binaries to other systems without a lot
of change. So, I choose to have an "install" for each library
and binary. This works really well, but there's 1 pr
Hi,
I tried getting the sources of pphs, cause my version seems to
abort when lines are too long, so I thought I'd just make a
quick patch for that, but for some reason the
fptools/ghc/CONTRIB dir is empty ?
Jan
12 matches
Mail list logo
