On Dec 24, 2003, at 2:29 AM, Sean L. Palmer wrote:
It occurs to me that Haskell would be quite a bit easier for OO and
traditional programmers to grasp if Haskell would actually use the
correct, or at least more commonly used, names for things.
I don't think changing a few keywords will have any
Hi,
I have some code (http://www.acooke.org/andrew/ReadTest.hs) that reads
data from a file (an image in ppm format; example data (256*256 pixels) at
http://www.acooke.org/andrew/test.ppm) and stores it in an array of Word8
values. The aim is to read a file that contains 5000 * 5000 * 3 Word8
va
(1) use unboxed arrays, otherwise you're wasting too much space with
pointers. that is, unless you need laziness on the elements, which i
don't think you do based on your list
(2) (maybe) use imperative arrays; this will help you ensure that
everything is being evaluated quickly.
On Wed, 24 D
Thanks. I should have added that I will only use the array for reading
once it's created. I don't mind whether creating is lazy or eager (it's
currently eager because I was fighting a space leak, but I think that was
down to some other error).
I don't fully understand how either of the suggesti
one other thing you might find useful is to read it imperatively and then
use unsafeFreezeArray (i think that's the name) to get a pure array out of
it. since all you'll be doing is reading, this should work nicely for
you.
On Wed, 24 Dec 2003, andrew cooke wrote:
>
> Thanks. I should have
On Tue, Dec 16, 2003 at 02:05:14PM -, Simon Marlow wrote:
>
>
> The (Interactive) Glasgow Haskell Compiler -- version 6.2
>
And, for Christmas, we at Debian brin
Ian Lynagh <[EMAIL PROTECTED]> writes:
>>
>> The (Interactive) Glasgow Haskell Compiler -- version 6.2
>>
>
> And, for Christmas, we at Debian bring you sackful of de
