Great, I like VSCode, so certainly very helpful, thank you.
--
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
Alex, you are doing a wonderful job with the videos. InfoQ is helping us all by
making a business out of quality videos. From experience, I know there are
always people wanting things quicker and cheaper. I bet the same complains will
be here if the videos are releases in half the time.
Of
I was wondering if there are Clojure users in Medellín. A user group maybe?
--
--
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
Right now, there is nothing like leiningen for .NET
Did you take a look at NuGet?
http://nuget.codeplex.com/
--
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
The obvious way is like the following, which traverse the sequence 2 times.
Wondering what will be the efficient way...
(defn avg [coll]
(loop [c coll tot 0 cnt 0]
(if (empty? c)
(/ tot cnt)
(recur (rest c) (+ tot (first c)) (inc cnt)
This will loop only once.
It happens
