On Thu, 2007-06-21 at 08:14 +0400, Bulat Ziganshin wrote:
Hello Duncan,
Thursday, June 21, 2007, 7:36:13 AM, you wrote:
The smallest possible would be 2 words overhead by just using a
ByteArray#,
i tried it once and found that ByteArray# size is returned rounded to 4 -
there is no
Hello Anatoly,
Thursday, June 21, 2007, 3:11:13 AM, you wrote:
implementation. You should be able to stay within an order of
magnitude from C with haskell without resorting to weird compiler
tricks.
why you believe in it? are you ever implemented anything in Haskell
without tricks and it
Hello David,
Thursday, June 21, 2007, 3:49:55 AM, you wrote:
A list of Word8 is -extremely- inefficient.
To expand on that terse (but very true) statement, a list of Word8
increases the space usage by a factor of probably around an order of
magnitude (two pointers + 1 byte vs 1 byte),
Hello Duncan,
Thursday, June 21, 2007, 7:36:13 AM, you wrote:
The smallest possible would be 2 words overhead by just using a
ByteArray#,
i tried it once and found that ByteArray# size is returned rounded to 4 -
there is no way in GHC runtime to alloc, say, exactly 37 bytes. and
don't forget
