Hey, I read http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf a while ago and noticed you had referenced the paper and implemented the naive algorithm in contrib and thought I could chip in and do the sieve for you but get an error in my current implementation with only a million primes. "Exception in thread "main" java.lang.OutOfMemoryError: Java heap space (core.clj:1)"
The code is at https://github.com/thattommyhall/primes/blob/master/src/primes/core.clj , its only my second week in clojure so I'm not sure im using lazy-seq correctly, if sorted-map is the correct datastructure to use or if I'm missing something else obvious. Tom -- 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
