A clean and minimal map API

on YouTube ↗08m

" summary

Proposes a map with four concrete operations lookup insert update remove where lookup returns success plus key and value, insert returns whether an insertion happened plus key/value, update inserts if missing and otherwise replaces, and remove returns ownership of the removed key/value. Implements lazy and emplacement overloads that call user callables only on actual inserts, a small‑size optimization with inline buffer plus a type eraser map_ref and a fast read‑only map_view that precomputes buffer pointers for much faster repeated reads.

AI-written summary · about

" chapters (15)

1. 0:00Introduction
2. 0:22Four fundamental map APIs
3. 0:39Model
4. 0:58Key
5. 1:18Update
6. 2:16Other APIs
7. 2:55Map API
8. 3:08Overloads
9. 3:37Updating
10. 3:49Overload
11. 4:05lambdas
12. 4:40vote
13. 5:43map ref type
14. 6:04type ratio
15. 7:09conversion operators

" related talks

• 49mSee the tries for the treesJared Wyles · Web Directions Code 2013
• 55mBreaking Dependencies: Type Erasure - The Implementation DetailsKlaus Iglberger · NDC TechTown 2022
• 28mDeep Dive Into API MachineryStefan Schimanski, Antoine Pelisse · KubeCon + CloudNativeCon North America 2019
• 01h 31mWhen Abstractions Fix Too Much - Towards Flexible Library DesignPatrick Roberts · C++Now 2026
• 48mJourneys with Maps, Riemann, http.async.client, Canon fodderSam Newman, Chris Ford, Robert Rees, Hubert Iwaniuk · EuroClojure 2012
• 01h 20mBetter Code: RelationshipsSean Parent · CppCon 2019
• 56m“High Performance Code 201: Hybrid Data Structures"Chandler Carruth · CppCon 2016
• 59mThe Most Valuable ValuesJuan Pedro Bolivar Puente · CppCon 2018