Don Stewart-2 wrote:
I'd use a strict pair and the rnf strategy.
data P = P [Something] !Int
rnf dfs' (P dfs' (n+1)
Thanks all, it definitely seems like an improvement.
--
Grzegorz
--
View this message in context:
Hi all,
Is there a less ugly way of avoiding laziness in the code pasted below then
the use of seq in the last line?
The program is supposed to split a large input file into chunks and check in
how many of those chunks each of a list of words appear, as well as the
total number of chunks.
Hi all,
Op Thursday 10 July 2008 12:16:25 schreef Grzegorz Chrupala:
Is there a less ugly way of avoiding laziness in the code pasted below then
the use of seq in the last line?
You could replace the list dfs' with a strict list type, like:
data StrictList a = Cons !a !(StrictList a) | Nil
On Thu, 2008-07-10 at 03:16 -0700, Grzegorz Chrupala wrote:
Hi all,
Is there a less ugly way of avoiding laziness in the code pasted below then
the use of seq in the last line?
The program is supposed to split a large input file into chunks and check in
how many of those chunks each of a
jonathanccast:
On Thu, 2008-07-10 at 03:16 -0700, Grzegorz Chrupala wrote:
Hi all,
Is there a less ugly way of avoiding laziness in the code pasted below then
the use of seq in the last line?
The program is supposed to split a large input file into chunks and check in
how many of
