In article <47b55ddb$0$15001$4f793bc4@news.tdc.fi>,
nospam@thanks.invalid says...
[ ... ]
> Another relevant difference is that O(log n) operations can be
> guaranteed for a std::map, but they cannot be guaranteed for a hashmap.
A hash-based map can be designed so to guarantee O(log N) operations for
insertions, deletions, etc. Offhand I'm not sure whether TR1 and/or C++
0x make that requirement, but if they did it could be met.
--
Later,
Jerry.
The universe is a figment of its own imagination.