On 15 Mar 2013, at 08:28, Marko Topolnik <marko.topol...@gmail.com> wrote:
> To the best of my knowledge the only guarantee you get is the existence of an > upper bound on the size of the eagerly fetched chunk, so a potentially > infinite lazy sequence will not result in an endless loop/OOME. The whole > mechanism is based on a best-effort policy. That sounds very plausible to me. Is there an official statement to that end anywhere? -- paul.butcher->msgCount++ Snetterton, Castle Combe, Cadwell Park... Who says I have a one track mind? http://www.paulbutcher.com/ LinkedIn: http://www.linkedin.com/in/paulbutcher MSN: p...@paulbutcher.com AIM: paulrabutcher Skype: paulrabutcher -- -- 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 --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
