Hello Albert,
Thursday, December 29, 2005, 11:56:12 PM, you wrote:
AL For almost a decade, most (I dare claim even all) Pascal and C
AL compilers were three-pass or two-pass.
1) Pascal was developed as one-pass compiled language.
highly-optimizing compilers used additional passes to generate
Hello Tomasz,
Friday, December 30, 2005, 12:36:37 AM, you wrote:
TZ I get results that confirm scheduler unfairness. I have numbered the
TZ So thread number 1 managed to run at least 52 or 53 reads, but thread
TZ number 1000 only 1 or 2 reads.
it may be just because slowness in threads
Hello Peter,
Thursday, December 29, 2005, 5:58:29 PM, you wrote:
PS The Fast I/O article I posted a few days ago is my
PS unfinished attempt at writing an efficient, general-purpose
PS binary I/O library for Haskell.
where i can find it?
--
Best regards,
Bulat
Hi Bulat,
general-purpose binary I/O library for Haskell.
where i can find it?
the module is available here:
http://cryp.to/blockio/fast-io.html
http://cryp.to/blockio/fast-io.lhs
The article is incomplete and a bit messy, but the code
works fine. Feedback and ideas for improvement
Bruno Oliveira wrote:
On Tue, 27 Dec 2005 16:39:34 +, Chris Kuklewicz wrote:
I was wondering if it this small snippet of code could be altered to
require fewer OPTIONS -fallow-... switches.
Here is a partial solution using only -fglasgow-exts:
...deleted...
The problem of this
Chris Kuklewicz wrote:
*MyShow main
Hello World #[17,18,19]!
I also think [4,5,6] and 7 are cool.
The extra double quotes being what I am trying to avoid with MyShow
This is your only special case, a single list of a sigle type that is
different from other lists? To avoid undecidable,
Udo Stenzel wrote:
This is your only special case, a single list of a sigle type that is
different from other lists? To avoid undecidable, incoherent and other
nasty instances, just do what the Prelude does:
class MyShow t where
swim :: t - String
swimList :: [t] - String
Hello Branimir,
Friday, December 30, 2005, 3:44:26 AM, you wrote:
BM myHashString = fromIntegral . ff''' . ff'' . ff' . foldr f 0
i use the following hash function in my program:
filenameHash = fromIntegral . foldl (\h c - h*37+(ord c)) 0
(it's written without explicit parameter in order to
Hello,
I have posted two faster versions to
http://haskell.org/hawiki/ChameneosEntry
The faster of the two uses an extra manager thread, the slower uses STM.
--
Chris
Chris Kuklewicz wrote:
Hello all,
I decided to put together an entry for one of the shooutout categories:
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] Re: Haskell Speed
Date: Fri, 30 Dec 2005 17:56:57 +0300
Hello Branimir,
Friday,
10 matches
Mail list logo
