* Christian Maeder [EMAIL PROTECTED]:
I also had to adapt again the call of ctime_r in ghc/rts/RtsUtils.c
#if HAVE_CTIME_R
- ctime_r(now, nowstr, 26);
+ ctime_r(now, nowstr);
#else
26 is supposed to be the size of the buffer nowstr. Maybe 27 is also
fine? According to the man
Tomasz Zielonka wrote:
On Wed, Apr 19, 2006 at 01:56:25PM +0400, Bulat Ziganshin wrote:
generational GC (at least one used in GHC) is better suited for
functional (immutable) data. this conception by itself based on that
new allocated data can contain references to old ones but not vice
versa.
Bulat Ziganshin wrote:
1) lazyGet/lazyPut. it's no problem to copy your implementation but i
still don't understand how lazyGet should work - it share the same
buffer pointer as one used in `get`. so `get` and consuming structure
returned by lazyGet should interfere
lazyGet can only be used
Christian Maeder wrote:
Christian Maeder wrote:
The files in the binary distribution are:
ghc - ghc-6.4.2
ghc-6.4.2
due to a missing dvips make binary-dist does not finish properly and
does not create a ghc-6.4.2.sh (and other .sh) file(s).
Should it not be possible to build a binary
Christian Maeder wrote:
Simon Marlow wrote:
--- ghc/rts/package.conf.inplaceThu Apr 13 15:49:49 2006
+++ ghc/rts/package.conf.inplace~ Wed Apr 12 19:44:55 2006
@@ -429,7 +429,6 @@
extra-libraries: m
, gmp
-
Hello John,
Wednesday, April 19, 2006, 3:27:49 AM, you wrote:
if that is due to the time of reading .hi files, my alternative Binary
library should help in some future
Interesting, A big bottleneck
big bottleneck? ;)
in jhc right now is reading the (quite
large) binary ho and hl files on
Volker Stolz wrote:
Without the 3rd arg is according to POSIX (check your Solaris man page).
'buf' is required to be at least 26 bytes.
You're right, but it does not compile without the 3rd argument! Maybe
this is due to gcc_4.0.3_s10 ? Should one simply rely on ctime?
Cheers Christian
man
Am 20. Apr 2006 um 11:19 CEST schrieb Christian Maeder:
Volker Stolz wrote:
Without the 3rd arg is according to POSIX (check your Solaris man page).
'buf' is required to be at least 26 bytes.
You're right, but it does not compile without the 3rd argument! Maybe
this is due to gcc_4.0.3_s10
Volker Stolz wrote:
Now I'm confused...or is the patch reverted?
yes, sorry I've done:
-bash-3.00$ diff -u RtsUtils.c RtsUtils.c~
--- RtsUtils.c Wed Apr 19 13:15:29 2006
+++ RtsUtils.c~ Thu Jan 12 13:43:03 2006
@@ -187,7 +187,7 @@
if (now == 0) {
time(now);
#if HAVE_CTIME_R
-
Simon Marlow wrote:
Christian Maeder wrote:
Should it not be possible to build a binary distribution without
documentation?
Try
make binary-dist Project=Ghc BINDIST_DOC_WAYS=html
Thanks, this worked!
C.
___
Glasgow-haskell-users mailing list
Hello,
a friend and I were recently experimenting with mutable arrays. We tried
to implement a simple dot product on STUArrays using a 'while' loop.
Unfortunately, every implementation we produced caused a stack overflow.
Switching to other implementations of 'while' or to IOUArrays did not
help
On 20.04 12:06, Bulat Ziganshin wrote:
my Streams library mainly consists of two parts - Streams and
AltBinary. The streams part implements Handle-like interface
(including such functions as vGetChar, vGetByte, vPutBuf, vSeek and so
on) for various data sources - files, memory buffers, pipes,
I've put up a wiki page listing the platforms that GHC supports and
which features are supported on each platform:
http://hackage.haskell.org/trac/ghc/wiki/Platforms
I've no doubt made mistakes and there are a few empty boxes where I
wasn't sure. Please improve the information here if you
Hi,
my stage2 compiler under solaris is unusable. gmake bootstrap3 does
not terminate and even compiling the simplest file does not terminate:
Christian
-bash-3.00$ ghc -v --make hello.hs
Glasgow Haskell Compiler, Version 6.4.2, for Haskell 98, compiled by GHC
version 6.4.2
Using package
Hello Gunnar,
Thursday, April 20, 2006, 4:29:29 PM, you wrote:
a friend and I were recently experimenting with mutable arrays. We tried
to implement a simple dot product on STUArrays using a 'while' loop.
Unfortunately, every implementation we produced caused a stack overflow.
it seems that
Hello Simon,
Thursday, April 20, 2006, 5:17:55 PM, you wrote:
http://hackage.haskell.org/trac/ghc/wiki/Platforms
This replaces the section in the Building Guide that was becoming rather out
of date.
for my libs, i just have wiki pages that contains current
documentation and include
Simon Marlow wrote:
=
The (Interactive) Glasgow Haskell Compiler -- version 6.4.2
=
I notice that everything except the standalone Windows port is now available
Hello Bulat,
Bulat Ziganshin wrote:
it seems that you just construct huge unevaluated thunk. making things
stricter is a whole art, in this case try the following:
[...]
Thanks a lot, it works now. I believed that writeSTRef would always
evaluate its arguments because ST is strict, but
Hello Simon,
Thursday, April 20, 2006, 11:54:59 AM, you wrote:
Bulat Ziganshin wrote:
1) lazyGet/lazyPut. it's no problem to copy your implementation but i
still don't understand how lazyGet should work - it share the same
buffer pointer as one used in `get`. so `get` and consuming
On 4/20/06, Gunnar Kedenburg [EMAIL PROTECTED] wrote:
Hello,
a friend and I were recently experimenting with mutable arrays. We tried
to implement a simple dot product on STUArrays using a 'while' loop.
Unfortunately, every implementation we produced caused a stack overflow.
Switching to
Hello Gunnar,
Thursday, April 20, 2006, 7:34:33 PM, you wrote:
Thanks a lot, it works now. I believed that writeSTRef would always
evaluate its arguments because ST is strict, but apparently I was
mistaken :)
strict ST monad means that all operations inside it are performed
immediately and
Bulat Ziganshin wrote:
i'm tried to say that there is no such dynamic beast as virtual
functions in C++
I think you can use existential types to simulate virtual functions:
-- 'a' is a stream of b's
class StreamClass a b where
get :: a - IO b
-- hide the particular 'a' to get any stream
Hello Bulat,
Bulat Ziganshin wrote:
the fastest way to calculate dot product is:
dot :: STUArray s Int Double - STUArray s Int Double - ST s Double
dot x y = do
let (l,r) = bounds x
cycle sum i | sum `seq` ir = return sum
cycle sum i = do xi -
Currently
-fglasgow-exts
implies
-fth
That is, you get Template Haskell if you specify -fglasgow-exts. The
trouble is that if you don't know about TH, then the error messages can
be deeply strange, as Marc found.
Suggestion: if you want TH, you must specify -fth explicitly;
Are there any plans to release an OS X Intel version of this ?If
not, has anyone has any success in getting the PowerPC version to run
under Rosetta (complains about invalid intel instructions) ?-- Forwarded message --From: Simon Marlow
[EMAIL PROTECTED]Date: Apr 19, 2006 1:52
25 matches
Mail list logo
