On Tue, Sep 13, 2011 at 4:18 AM, Stefan Kamphausen
<ska2...@googlemail.com> wrote:
> Hi,
>
> On Tuesday, September 13, 2011 6:28:01 AM UTC+2, Ken Wesson wrote:
>>
>> They're trees of arrays of 32 items, and the trees can in principle
>> have arbitrary depth. So the 2^31 limit on Java arrays doesn't impact
>> the Clojure collections, it seems.
>
> are you sure?  As far as I understood things (reading PersistentVector.java
> and [1]), there can only be 6 levels of nodes, because of the 32bit which
> are used to store an integer and because of the bit-shifting which is used
> to find the correct level.

I said the tree can *in principle* have arbitrary depth. Bit-shifting
can be done on BigIntegers, too.

-- 
Protege: What is this seething mass of parentheses?!
Master: Your father's Lisp REPL. This is the language of a true
hacker. Not as clumsy or random as C++; a language for a more
civilized age.

-- 
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 unsubscribe from this group, send email to
clojure+unsubscr...@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/clojure?hl=en

Reply via email to