c++ map implementation

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?
There is map based on hash, read the link below

http://www.sgi.com/tech/stl/hash_map.html
If you use g++ you may want to look at the headers ext/hash_map (or tr1/unordered_map in newer versions).
Topic archived. No new replies allowed.