25 Mar
2015
25 Mar
'15
6 p.m.
Hi martin,
Check dlist (https://hackage.haskell.org/package/dlist-0.7.1.1).
On Wed, Mar 25, 2015 at 11:21 PM, martin
Hello all,
when I write my own recursions, I often end up with something like
a : b : c : (f x)
where f x returns a list. I assume this avoids the costly (++) function, right?
But when I use list comprehensions I always get a complete list and it is costly to append something to it. How can I use the power of list comprehensions, but return an [a]->[a] instead of an [a]?
Is this a good idea at all, or will I pile up thunks?
_______________________________________________ Beginners mailing list Beginners@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners