Hello, I just read some of the clojure.core source, and when reading map and range, I noticed that inside lazy-seq, recursion doesn't seem to stack overflow. I then tried it myself on some trivial examples, and indeed, I can take hundreds of thousands of entries from such a list without anything happening (and when I went higher, I ran out of memory, not stack space).
So, my question is, why exactly DOESN'T it crash and burn horribly with the cries of dying bits in the background? I suppose it has something to do with how lazy-seqs work (another mystery for me). Thanks in advance. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
