Multipmap of pointers, sort by key

[karen.b.lin]

I've created a multimap of pointers. The sort order by key seems
messed up.

ex:

std::multimap<B OMBImntRT*, BOMBPortfolio*u ndPortMap;

I did not try to create multimap of objects instead, b/c some classes
do not have copy constructors, and it'll be very messy to create one.

Is there anyway to have the pointer multimap sorted?

New at this ... appreciate your help~

[Roland Pibinger]

On 11 Apr 2007 07:58:09 -0700, "karen.b.lin@.. .com" wrote:

>But still don't get why overloading () ?

It's just a requirement of the STL. Alternatively the function might
have been called 'compare' or something like that. The advantage of
the STL solution is that you can use as predicate a free function and
an object with operator() alike.
--
Roland Pibinger
"The best software is simple, elegant, and full of drama" - Grady Booch

[karen.b.lin]

Thank u all for the replies. Just want to further perfect my codes,
if i want to sort first by the key, then by value. How will i specify
it in my sorter, something like this? not sure where do i put the
value type in the sorter?

key: BOMBImntRT*
value: BOMBPortfolio*

struct UnderlyingsPtrS orter
{
bool operator() (const BOMBImntRT* a, const BOMBImntRT* b) const{
if(a->ImntName == b->ImntName)
//??
else
return a->ImntName < b->ImntName;
}
};

[xperthands]

On Apr 13, 9:03 am, "karen.b....@gm ail.com" <karen.b....@gm ail.com>
wrote:

Thank u all for the replies. Just want to further perfect my codes,
if i want to sort first by the key, then by value. How will i specify
it in my sorter, something like this? not sure where do i put the
value type in the sorter?

You don't. Only the key will be passed to the predicate. If you want
the
value to be considered you should use std::set<Tand have the key
part
of the type you specify for T.