Node-based 与 Contiguous Container 的分配行为 | STL
本章覆盖:vector bulk allocation;map/list per-node allocation 的常见实现;allocation count;fragmentation;cache locality;allocator overhead;object size;node overhead;small allocation;性能问题往往来自数据布局而不只是算法复杂度。
本章知识点
- vector bulk allocation
- map/list per-node allocation 的常见实现
- allocation count
- fragmentation
- cache locality
- allocator overhead
- object size
- node overhead
- small allocation
- 性能问题往往来自数据布局而不只是算法复杂度