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:
- Building Evolutionary Architectures (in London on 16th May 2017)
- Simon Brown's Software Architecture for Developers Workshop (in London on 22nd - 23rd May 2017)
- Whole Team Approach to Agile Testing (in London on 5th - 7th June 2017)
- µCon 2017: The Microservices Conference (in London on 6th - 7th 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.