Yup, that fixed it.
Thanks!
-Conrad
--~--~-~--~~~---~--~~
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
To unsubscribe from this group, send email to
cloj
On Jan 31, 11:41 am, Conrad wrote:
> Hi everyone- I'm a new Clojurist trying to understand how to make use
> of Clojure parallelism... I wrote this simple program that calculates
> the number of prime numbers in a number range. It is purposely
> inefficient:
>
> (defn prime [a]
> (not-any? #(
Hi everyone- I'm a new Clojurist trying to understand how to make use
of Clojure parallelism... I wrote this simple program that calculates
the number of prime numbers in a number range. It is purposely
inefficient:
(defn prime [a]
(not-any? #(integer? (/ a %)) (range 2 a)))
(defn primes [a b]
Hi everyone- I'm a new Clojurist trying to understand how to make use
of Clojure parallelism... I wrote this simple program that calculates
the number of prime numbers in a number range. It is purposely
inefficient:
(defn prime [a]
(not-any? #(integer? (/ a %)) (range 2 a)))
(defn primes [a b]
