The Cache Locality Tax: Why CPP STL list Fails Modern Hardware скачать в хорошем качестве

The Cache Locality Tax: Why CPP STL list Fails Modern Hardware

Practical C++ coruse https://cpp.rougeneuron.in Is std::list really as bad as the performance jokes suggest? In this episode, we explore the rise and fall of the standard doubly linked list. We trace its origins back to the generic programming revolution at HP Labs and explain why its "topological" design was a brilliant trade-off in the flatter memory hierarchies of the 1990s. Discover the technical drama of the C++11 Complexity Pivot, the ABI crisis that forced GCC into dual-binary workarounds, and why std::list is now finding a "sci-fi" second life as a meta-programming tool for the C++26 constexpr revolution. 00:00 The Villain of Data-Oriented Design? 01:50 Genesis at HP Labs: Generic Programming Roots 02:30 The Topological Approach: Math vs. Arithmetic 03:00 1993 Hardware: Acceptable Pointer Chasing 03:40 Referential Integrity: The std::vector Counter-Contract 04:40 The Memory Wall: Why Silicon Betrayed Abstraction 05:30 Pointer Chasing and the Instruction Pipeline Stall 06:20 Stroustrup’s 2012 Keynote: Vector Wins by Brute Force 07:00 The 400% Space Penalty 07:55 The Great Size Debate: O(1) vs. O(N) 08:50 The GCC ABI Nightmare: Breaking the Interface 10:00 The Dual ABI Solution: std::__cxx11::list 11:50 Why Not Intrusive Lists? Safety vs. Generosity 13:10 Killer Feature: Stable Iterators and Observer Patterns 14:30 C++26: The constexpr Renaissance