On Tue, Nov 18, 2008 at 4:55 PM, mb <[EMAIL PROTECTED]> wrote:
[...]
> I don't know, whether this is more idiomatic Clojure code, but
> it works...
[...]
What revision is that? On r1099 I got:
java.lang.IllegalArgumentException: Don't know how to create ISeq
from: Symbol (NO_SOURCE_FILE:31)
so
Hi,
blindly copying code is usually not a good way to learn a new
language
I don't know, whether this is more idiomatic Clojure code, but
it works...
(defn build-tree
[item depth]
(when (< 0 depth)
(let [i (* 2 item)
d (dec depth)]
[item (build-tree (dec i) d) (build
On Tue, Nov 18, 2008 at 5:58 AM, Simon Brooke <[EMAIL PROTECTED]> wrote:
>
> However Giraud uses the Common
> LISP ASH (arithmetic shift) function, and, if there's a built-in
> function in Clojure, I did not find it;
find-doc is your friend in this case:
user=> (find-doc "shift")
---
As a learning exercise and also to continue to investigate Clojure
performance I've roughly translated the Alioth binary-tree benchmark
into Clojure. I chose the binary-tree simply because it's the first of
the Alioth benchmarks in alphabetical collation; I may do others
later.
I&#
