sorting with std::map

[A. Saksena]

Hi guys,
Question regrading std::map. If I have a std::map like
std::map < unsigned int, SOME_USER_DEFINED_DATA_TYPE > request_map;
how I can sort this request_map for given value of unsigned int.
I have a understanding that STL sort algorithm cannot be used with a
associative containers like map.Is there is any other way?

Abhishek

 

[David Harmon]

On Wed, 2 Feb 2005 11:30:56 +0100 in comp.lang.c++, " A. Saksena"

Hi guys,
Question regrading std::map. If I have a std::map like
std::map < unsigned int, SOME_USER_DEFINED_DATA_TYPE > request_map;
how I can sort this request_map for given value of unsigned int.

A std::map always sorts itself according to the predicate you created
it with (default std::less<T>). It's speedy key lookup depends on
that. You cannot sort it differently later.

What does "sort for a given value" mean, anyway?