I'm wondering why the author didn't try to use binary search on sorted std::vector. It should be as fast as std::map (if not faster). I also did some experimen

I'm wondering why the author didn't try to use binary search on sorted std::vector. It should be as fast as std::map (if not faster). I also did some experiments with lookups using collections of std::map: http://0x80.pl/notesen.html#stl-map-with-string-as-key-access-speedup-3-04-2010 http://0x80.pl/notesen.html#stl-map-with-string-as-key-acces...