Hi there, First, thanks for this great language and all the media available. Clojure talks are really good !
Just in one of these talks, Rich talks about "Array Mapped Trees" and I have read that Bagwell's paper : "Ideal Hash Trees". Maybe my question is pretty dummy but Bagwell talks about key insertion/search in these hashes and I do not get how to distinguish between a bucket that is a Key/Value pair (so it is a terminal node) and a Map/Base one (so it is a pointer to another hash table) neither during initial insertions nor searching for keys. Any help to clarify this ? Thx ! Best regards, Raúl --~--~---------~--~----~------------~-------~--~----~ 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 To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
