.
Simon
| -Original Message-
| From: Joe English [mailto:[EMAIL PROTECTED]]
| Sent: 25 November 2001 00:12
| To: [EMAIL PROTECTED]
| Subject: Re: heap and walking through a very long list
|
|
|
| Simon Peyton-Jones wrote:
|
| There should really be a strict accumArray, just
Simon Peyton-Jones wrote:
There should really be a strict accumArray, just as there
should be a strict foldl.
Yes, please!
Is there a way to write a strict version of accumArray in
Haskell 98, or does this need to be done by the implementation?
--Joe English
[EMAIL PROTECTED]
PROTECTED]
| Subject: heap and walking through a very long list
|
|
|
| Hi. I wonder if there are any methods of walking through a
| very long list without a huge heap. It is good that a
| laziness makes creation of large stuctures delayed, but it
| seems that destruction of never again used
Hi. I wonder if there are any methods of walking through a very long list
without a huge heap. It is good that a laziness makes creation of
large stuctures delayed, but it seems that destruction of never again
used beginning of a list is also delayed (probably because of other
reason).
Consider
