On Feb 16, 2012, at 11:08 AM, Wolodja Wentland wrote:

> Thanks for the explanation. What would be a good way to ensure that the
> subseqeuence are lazy too?

I can't think of a good way to do this with higher-order functions, so you'll 
probably have to write a recursive function that "manually" iterates over the 
collection, looking ahead as necessary to figure out when to split. To make the 
result lazy, just wrap your function's body in a call to lazy-seq.

-- 
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

Reply via email to