STL Features And Implementation Techniques
summary
Covers specific STL changes from C++11/14 and how they are implemented in Visual C++ via Dinkumware sources including working code on GitHub, demonstrates dual-range algorithms that prevent undefined behavior and optimize equal/is_permutation, shows minimal allocators plus allocator_traits that preserve move semantics, introduces heterogeneous lookup using transparent comparators to avoid constructing heavy keys, and exposes implementation tricks like tag dispatch and deleted const rvalue overloads that detect temporaries; all techniques are shown with real code and compiler-portable results.
AI-written summary · about
chapters (8)
- 0:00Start
- 0:58UDLS And Inline Namespaces
- 6:21equal(), mismatch(), is_permutation()
- 26:26Minimal Allocators
- 31:34Heterogeneous Associative Lookup
- 41:41Const Rvalue References
- 43:04What's wrong with this code? • Undefined behavior in C++11
- 49:36Questions?
related talks
58mUnderstanding and Mastering C++'s Complexity
59mBetter Algorithm Intuition
27mThe Dark Corner of STL in Cpp: MinMax Algorithms
01h 02mC++20 - My Favorite Code Examples
58mFrom Iterators to Ranges: The Upcoming Evolution Of the STL
01h 03mUnlocking the value of C++20
01h 03mWriting sustainable software. The how and the what!
49mA Journey Into Non-Virtual Polymorphism in C++