Re: STL list - advanced sorting

From:

"Igor Tandetnik" <itandetnik@mvps.org>

Newsgroups:

microsoft.public.vc.language

Date:

Sat, 2 Dec 2006 15:23:17 -0500

Message-ID:

<Or#xp#kFHHA.1252@TK2MSFTNGP02.phx.gbl>

"neilsolent" <neil@solenttechnology.co.uk> wrote in message
news:1165082888.598324.78900@j44g2000cwa.googlegroups.com

When a new element joins the list, its position is completely random -
because the list is sorted and the elment itself could be absolutely
anything (there is no knowing what the database under the covers might
throw out).
This is what I am meaning by "random access".

That's quite different from the usual, widely accepted meaning of the
term: a container is said to provide random access when any element may
be accessed in O(1) time, regardless of its position in the container,
order it was added and so on. Plain C array, vector and deque are
examples of containers providing random access.
--
With best wishes,
Igor Tandetnik

With sufficient thrust, pigs fly just fine. However, this is not
necessarily a good idea. It is hard to be sure where they are going to
land, and it could be dangerous sitting under them as they fly
overhead. -- RFC 1925