Cache-friendly binary search

High-speed memory caches present in modern computer architectures favor data structures with good locality of reference, i.e. the property by which elements accessed in sequence are located in memory addresses close to each other. This is the rationale behind classes such as Boost.Container flat associative containers, that emulate the functionality of standard C++ node-based associative container

[Nnwww]

この着目点自体面白いけど、むしろ最適化したい時に扱っているデータ構造のアクセス頻度のヒートマップを作ってみるというのがためになった

[mattn]

キャッシュをヒットしやすい順に置き換える。