Please log in to watch this conference skillscast.
Clojure's sequence library and the threading macro make lazy sequence operations like map, filter, and reduce composable, and their immutable semantics allow efficient re-use of intermediate results. Core.reducers combine multiple map, filter, takes, et al into a single *fold*, taking advantage of stream fusion--and in the upcoming Clojure 1.7, transducers abstract away the underlying collection entirely.
I've been working on concurrent folds, where we sacrifice some order in exchange for parallelism. Tesser generalizes reducers to a two-dimensional fold: concurrent reductions over independent chunks of a sequence, and a second reduction over those values. Higher-order fold combinators allow us to build up faceted data structures which compute many properties of a dataset in a single pass. The same fold can be run efficiently on multicore systems or transparently distributed--e.g. over Hadoop.
YOU MAY ALSO LIKE:
- DDD eXchange 2017 (in London on 27th - 28th April 2017)
- Greg Young's CQRS, Domain Events, Event Sourcing and how to apply DDD (in Stockholm on 22nd - 24th May 2017)
- Simon Brown's Software Architecture for Developers Workshop (in London on 22nd - 23rd May 2017)
- Serverless Architecture with Azure Functions with Christos Matskas! (in London on 29th November 2017)
Tesser: Another Level of Indirection
Kyle Kingsbury (aphyr) is a software engineer at Factual, the lead author of the Riemann monitoring system, and principal instigator behind Jepsen: an exploration of distributed systems safety. He's obsessed with Clojure, databases, and networks.