Hi again, I answer myself as this is explained in that very paper: ... 3.1 Search for a key ... A small, but important implementation consideration is the identification of sub- tries or key/value nodes by a bit flag in the data structure. Using C+ + the bit uses the least significant bit of the pointer and encapsulates this within the pointer access methods ...
In any case, I will have a look at Rich's implementation as soon as I get a chance. Thx! Best regards, Raúl PS: Sometimes you see it clearer a couple of days later :-) On Oct 24, 9:48 pm, rauhersu <[EMAIL PROTECTED]> wrote: > 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 [email protected] 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 -~----------~----~----~----~------~----~------~--~---
