Hi,
I read somewhere that c++ maps are implemented using height balanced trees (red black trees specifically).
Why wasn't it implemented using hash tables? wouldn't it have been faster specially since maps dont allow duplicate keys?
If you use g++ you may want to look at the headers ext/hash_map (or tr1/unordered_map in newer versions).