Simple Solutions for High Performance: StaticFlatMap
summary
Claim: replacing std::map with a tiny specialized container yields huge practical wins. Implementation is a StaticFlatMap built as a sorted array with binary search and published on GitHub. Measured copy time drops from about 25 µs to <1 µs, iteration and cache locality are much faster, lookup stays logarithmic, inserts/removes and resizing are expensive, and it requires known fixed keys and small total size. Use when copies/iteration dominate.
AI-written summary · about
related talks
27mFast C++ to QML properties
01h 02mImplementing static_vector: How Hard Could it Be?
57mHow to Design a Slimmer Vector of Variants in C++
55mBack to Basics: Algorithmic Complexity
01h 00mTrading at light speed: designing low latency systems in C++
55mC++ Cache Friendly Data + Functional + Ranges = ❤️
01h 00mC++ Mythbusters
45mYou need to know Algorithms and Data Structures in Front-end, anyway