Please log in to watch this conference skillscast.
All of these have shortcomings. Hickey tries are magically indexable but the only other thing you can do to them is add things to the end. Finger trees are absurdly flexible but you can’t index them efficiently. And so the search goes on…
And today, you’re going to learn about the ultimate list data structure: the RRB tree ('relaxed radix balanced tree'). It is an improved version of the tried-and-tested Hickey trie and has achieved the impossible: every basic operation is efficient - push and pop on either end, index lookup, split and join. RRB trees pull no punches.
Watch as Bodil shares diagrams with brightly coloured boxes in an enthusiastic effort to explain why RRB trees are amazingly exciting.
YOU MAY ALSO LIKE:
- The Realist's Guide to Language Design (SkillsCast recorded in July 2016)
- Essential Effects | ScalaCon Workshop (Online Course on 10th - 13th May 2021)
- Akka Streams for Scala | ScalaCon Workshop (Online Course on 10th - 12th May 2021)
- ScalaCon 2021 (Online Conference on 18th - 22nd May 2021)
- F# eXchange 2021 (Online Conference on 20th - 21st October 2021)
- An Introduction to Cats Effect with Adam Rosien (Online Meetup on 22nd April 2021)
- Intro to OCaml (SkillsCast recorded in June 2020)
- Keynote: (Programming Languages) in Agda = Programming (Languages in Agda) (SkillsCast recorded in October 2019)
Meetings With Remarkable Trees
Bodil works as a computer science researcher for a secretive think tank, and is a world renowned expert in varied fields such as pizza and persistent data structures. Contrary to popular rumour, she only has five fingers on each hand, but is still an Emacs user.