Cache Locality：为什么 vector 常常击败 list | STL
本章覆盖：contiguous memory；spatial locality；cache line；pointer chasing；branch prediction 高层认知；allocation overhead；iteration throughput；list O(1) insert 的隐藏成本；CPU 真实成本模型；complexity ≠ hardware performance；benchmark with realistic workload。
本章知识点
- contiguous memory
- spatial locality
- cache line
- pointer chasing
- branch prediction 高层认知
- allocation overhead
- iteration throughput
- list O(1) insert 的隐藏成本
- CPU 真实成本模型
- complexity ≠ hardware performance
- benchmark with realistic workload