Re: Creating a map algorithmically

Thanks Justin, this is a terrific implementation. -- 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. T

Re: Creating a map algorithmically

Thanks Sumil. Does anyone know what algorithm they are implementing? It looks like a wheel factorization but I can't tell from lack ofcomments. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups

Creating a map algorithmically

Hi, I have a question regarding the map data structure. I'm trying to program a Sieve of Eratosthenes using the algorithm at Wikipedia: *Input*: an integer *n* > 1 Let *A* be an array of bool values, indexed by integers 2 to *n*, initially all set to *true*. *for* *i* = 2, 3, 4, ..., *while*

Re: Clojure now officially supported on Heroku

Terrific! Congratulations to everyone involved. -- 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

Re: Clojure Koans and others interactive exercises to learn clojure?

You can always try http://projecteuler.net using Clojure. -- 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

Re: loop/recur and tail postion

Thanks everyone. Makes perfect sense. -- 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 unsubscri

loop/recur and tail postion

Hi, I'm going through some Scheme code to learn Clojure. I defined a function rember as (defn rember [atom l] (loop [a atom lat l] (cond (empty? lat) `() (= (first lat) a) (rest lat) :else (cons (first lat) (recur a (rest lat))