On Tuesday, June 3, 2014 5:07:30 PM UTC+3, Stefan Kamphausen wrote: > > Hi, > > On Tuesday, June 3, 2014 4:02:45 PM UTC+2, sorin cristea wrote: >> >> Hi all, >> >> I don't know if this question was already asked by someone here but >> can you tell me(explain) or guide me to a properly documentation about how >> is internal implemented PersistenVector and PersistentHashMap , how they >> behave to an insert , remove, update; this question is came from >> presentation of Rich Hickey - >> Persistent Data Structures and Managed References( >> http://www.infoq.com/presentations/Value-Identity-State-Rich-Hickey). >> >> >> > The posts by Karl Krukow describe this very well. See > http://blog.higher-order.net/2009/02/01/understanding-clojures-persistentvector-implementation.html > > and the linked post on hash maps. Code links are outdated, though. > > > Best, > stefan >
Hi, thanks for this resource, I take a look through the description on PersistentHashMap, but was not so clear how exactly is searched for a element on level three for example ? -- 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 --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
