Explore the Hash Array Mapped Trie (HAMT) data structure for C++ in this 36-minute conference talk by Phil Nash. Dive into the limitations of existing associative containers like set, map, unordered_set, and unordered_map. Discover how HAMT combines the best characteristics of trees and hash tables, offering superior memory efficiency and easy persistence. Learn about the structure's implementation, its potential inclusion in Boost and the C++ standard, and its implications for concurrency and functional programming. Gain insights into the benefits and characteristics of this "holy grail" data structure that promises to revolutionize C++ programming.
The Holy Grail - A Hash Array Mapped Trie for C++
Overview
Syllabus
The Holy Grail - A Hash Array Mapped Trie for C++ - Phil Nash
Taught by
NDC Conferences
