Hi,
what about avoid the use of the unfold over the tree and construct it
directly (e.g. see http://hpaste.org/13919#a3)? I wonder if there is (an
easy) possibility to construct the tree lazily so that output start
immediately for large trees.
best,
Massimiliano Gubinelli
--
View this message
Don Stewart ha scritto:
manlio_perillo:
Hi.
During a tentative (quite unsuccessfull) to convert a simple Python
script that prints on stdout a directory and all its subdirectory [1] in
a good Haskell (mostly to start to do real practice with the language),
I came across this blog post:
manlio_perillo:
Hi.
During a tentative (quite unsuccessfull) to convert a simple Python
script that prints on stdout a directory and all its subdirectory [1] in
a good Haskell (mostly to start to do real practice with the language),
I came across this blog post:
There's no iteratee/fold-based IO system yet.
What about
http://sites.google.com/site/haskell/notes/lazy-io-considered-harmful-way-to-go-left-fold-enumerator
?
It's not on hackage, but at least it's public domain.
Oleg, of course.
2009/1/13 Don Stewart d...@galois.com:
manlio_perillo:
