Fingertrees: The Ultimate Persistent Data Structure

Efficient immutable data structures are the foundation of functional programming: without them, you wouldn't be able to write much useful functional code!

In this meetup, fingertrees are introduced, and a simple implementation given. Finger trees are a purely functional data structure used in efficiently implementing other functional data structures.

A miraculous creature, finger trees can provide efficient implementation of lots of different data structures, including sequences, search trees, and priority queues!

Come learn about this powerful, versatile, and surprisingly easy to implement a persistent data structure.

---------------

Free Colorado-local pizza provided at 6:00.