On Tuesday, July 21, 2015 at 1:43:54 AM UTC+2, JvJ wrote: > > Does anyone know if there exists a paper/web page describing in detail how > each of Clojure's data structures are implemented? >
I have a formal analysis and all the core algorithms related to the Persistent Vector in Chapter 2 of my thesis: http://hypirion.com/thesis.pdf Bagwell's original paper on the Array Mapped Trie, which is the basis for the Persistent Hash Map implementation, is also a good read and probably more approachable paper: http://infoscience.epfl.ch/record/64394/files/triesearches.pdf And, as already mentioned, my informal blogpost series about them is over at http://hypirion.com/musings/understanding-persistent-vector-pt-1 I really like Okasaki's book "Purely Functional Data Structures", but if you're only interested in the Persistent Vector and Persistent Hash Map, then I think it would be overkill to read it. Variants of them are first described in chapters 9-10. Mohit gave a good link to understand the sorted sets and maps. -- Jean Niklas -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to [email protected] Note that posts from new members are moderated - please be patient with your first post. 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 --- 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 [email protected]. For more options, visit https://groups.google.com/d/optout.
