Clojure doesn't do TCO with recursive functions--you have to use
`loop`/`recur`[1]. This is one of the (thankfully few) "gotchas" in
Clojure, at least/especially for people coming from other functional
languages (or so I assume--coming from Python, I hadn't heard that much
about TCO in the firs
OK, great. You may wish to add that contact info to the website or the
book page at NoStarch.com
Alan
On Thu, Nov 5, 2015 at 8:30 AM, Daniel Higginbotham
wrote:
> Thank you :)
>
> For errata, you can send an email to Mackenzie Dolginow,
> macken...@nostarch.com.
>
> Thanks!
> Daniel
>
> On Wedn
Thank you :)
For errata, you can send an email to Mackenzie
Dolginow, macken...@nostarch.com.
Thanks!
Daniel
On Wednesday, November 4, 2015 at 12:06:51 AM UTC-5, Alan Thompson wrote:
>
> Hi Daniel - Just finished the book and think it is one of the best places
> to start Clojure.
>
> Is there
Thanks, Sergio - this is a good way to construct the sieve.
It took me a little while to convince myself that it's the same, but it's
definitely a good solution.
In general, I guess it's not possible to generate an infinite sequence that
utilizes the tail-call optimization it makes sense as
Hi!
Thank you for your hints.
...
One thing to do is look at your Org mode's ob-clojure.el and figure out whether
it mentions cider. (The older or "stable" versions use only slime or nrepl.)
The Org website is a house of mirrors, but somewhere you should find a tidy
tar.gz of a nicely assemb
See also cond-> (Clojure core) and even condas->
(http://blog.juxt.pro/posts/condas.html)
Oliy
--
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 moderat
