map vs unordered_map：秋招与企业选型 | STL

本章覆盖：ordering；range query；average lookup；worst-case behavior；memory overhead；hash cost；comparison cost；cache locality；iterator stability；deterministic iteration；custom key；security / adversarial input；“unordered_map 一定更快”是错误结论。