Meetings With Remarkable Trees

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)
• YOW! Lambda Jam 2022 (Online Conference on 1st - 30th May 2022)
• Haskell eXchange 2022 (in Online Event on 1st - 30th November 2022)
• Steve Poole presents Log4Shell : Armageddon or Opportunity? (Online Meetup on 26th January 2022)
• A Conceptual Introduction to Nix for Haskellers (SkillsCast recorded in November 2021)
• Haskell in the Enterprise: A Report from in the Belly of the Whale (SkillsCast recorded in November 2021)