By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
424,963 Members | 941 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 424,963 IT Pros & Developers. It's quick & easy.

STL Hash_Map question

P: n/a
I want to search the key which is lower or equal than
a given key in a hash_map.

I am using the MS Visual C++ hash_map, which is not included in the STL
http://msdn2.microsoft.com/en-us/lib...bx(VS.71).aspx
and in my opinion there is no method which
could do this directly (There are only a upper_bound() and lower_bound()
function
which deliver the first key equal or greater than the given key).

How would you search for the key which is lower or equal to the given
exploiting the
const time characteristics of a hash_map efficiently?

Greetings

A.Galllus

Aug 10 '07 #1
Share this question for a faster answer!
Share on Google+

This discussion thread is closed

Replies have been disabled for this discussion.