Understanding and Mastering C++'s Complexity
summary
Claims concrete examples and fixes: C++ survives four decades and the talk demonstrates why with real code — argument-dependent lookup makes std::swap visible for std::string but not for int; virtual destructors are required only when code deletes via a base pointer; an LRU cache example forces use of typename until C++20; vector<bool> returns proxy refs so forwarding references matter; use move semantics to pop_back efficiently; ranges chaining order is fixed in C++17. Recommends cppreference and Stack Overflow for practical answers.
AI-written summary · about
chapters (22)
- 0:00Introduction
- 8:31Complexity
- 15:36Question Results
- 16:48Why Programming is Complex
- 18:42Why C is Complex
- 20:37Too Many Ways
- 24:40No Silver Bullet
- 26:20Essence and Accident
- 29:30Can the compiler deduce the class
- 31:43Cache
- 38:49Essence or Accident
- 40:29Vector Booleans
- 41:42Hiding
- 43:30Essence
- 44:13Retraining
- 45:16Principles
- 46:55The Bending Bearing
- 48:13Loves programming
- 48:47Implications of Innocent Ignorance
- 49:41Curiosity
- 52:41Chrono
- 53:00QA
related talks
01h 30m50 shades of C++
01h 05mThe real problem of C++
01h 10mAn Overview of C++11/14, Part II
01h 03mUnlocking the value of C++20
01h 30mC++ in Constrained Environments
01h 00mSTL Features And Implementation Techniques
01h 40mBack to the Basics! Essentials of Modern C++ Style
01h 02mC++20 - My Favorite Code Examples