Please log in to watch this conference skillscast.

Everybody knows the classic cons list. Clojeurs brag about their bitmapped vector tries. Haskell weenies took it up a notch with their impossible finger trees. Rustaceans turned back the clock and gave us simple arrays again.

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)
• Elasticsearch for Developers with Itamar Syn-Hershko (in London on 16th - 18th December 2019)
• CloudNative London 2019 (in London on 25th - 27th September 2019)
• Converting Architectural Requirements into Code using CloudFormation (in London on 18th September 2019)
• Lightbend Scala Language - Professional (in London on 9th - 10th September 2019)
• Lightbend Scala Language - Expert (in London on 11th - 13th September 2019)
• Haskell eXchange 2019 (in London on 10th - 11th October 2019)
• Clojure eXchange 2019 (in London on 2nd - 3rd December 2019)
• London Java Community August Meetup (in London on 28th August 2019)
• London Java Community August (in London on 28th August 2019)
• The Last Frontier and Beyond (SkillsCast recorded in August 2019)
• Why API Design Matters, and Why Yours Sucks! (and mine sucks too!) (SkillsCast recorded in June 2019)