U++ framework: U++ Core » operator< for container sorting (small confusion)

Home » U++ Library support » U++ Core » operator< for container sorting (small confusion)

Show: Today's Messages :: Polls :: Message Navigator
E-mail to friend

Re: operator< for container sorting (small confusion) [message #13081 is a reply to message #13080]

Sun, 09 December 2007 16:18

mirek
Messages: 14290
Registered: November 2005

Ultimate Member

Andy2222 wrote on Sun, 09 December 2007 08:48

ah oki,

is there a std::map<> equivalent container?

No.

Quote:

Or do i call Sort on Vector<> / Array<> before i need it sorted or use the GetSortOrder() call?

In most cases, GetSortOrder for Index / ArrayMap / VectorMap is the best aproach (also generally faster than the cost of maintaining nodebased tree structure like std::map).

Mirek

Report message to a moderator

[Message index]

		operator< for container sorting (small confusion) By: Andy2222 on Sat, 08 December 2007 20:10
		Re: operator< for container sorting (small confusion) By: mirek on Sun, 09 December 2007 07:54
		Re: operator< for container sorting (small confusion) By: Andy2222 on Sun, 09 December 2007 14:48
		Re: operator< for container sorting (small confusion) By: mirek on Sun, 09 December 2007 16:18

Previous Topic:	<<= and <<
Next Topic:	A couple of issues with a test app

Goto Forum:

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Apr 29 10:09:34 GMT+2 2026

Total time taken to generate the page: 0.00556 seconds