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:
- Lightbend's Fast Track to Akka with Java (in London on 16th - 18th August 2017)
- FullStack Bytes with Jolyon Russ! (in London on 25th October 2017)
- F# eXchange 2018 (in London on 5th - 6th April 2018)
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.