Please log in to watch this conference skillscast.
Clojure programmers are used to working with highly sophisticated persistent data structures, using managed references when mutable state is unavoidable. In some applications, however, a compelling alternative presents itself in the form of concurrent data structures with lock-free (""global progress guaranteed"") updates that admit fully persistent snapshots.
A data structure of this kind suitable for implementing maps was described by Prokopec, Bronson, Bagwell and Odersky. This talk aims to introduce it to the Clojure community, to present a Clojure implementation and to describe API choices that make using it feel natural in Clojure.
YOU MAY ALSO LIKE:
- Uncle Bob's Clean Code: Agile Software Craftsmanship (in London on 1st - 3rd November 2017)
- Whole Team Approach to Agile Testing (in London on 6th - 8th November 2017)
- Gojko Adzic's Specification by Example: From User Stories to Acceptance Tests (in London on 7th - 8th November 2017)
- Agile Testing & BDD eXchange 2017 (in London on 9th - 10th November 2017)
Ephemeral-first data structures
Longtime contributor to all parts of ClojureScript, including the compiler and the core library; most notably, author of the ClojureScript ports of the persistent map and set types and PDS-related functionality such as transients.