Re: Unsorted map?

From:

"Victor Bazarov" <v.Abazarov@comAcast.net>

Newsgroups:

comp.lang.c++

Date:

Thu, 8 Nov 2007 09:43:28 -0500

Message-ID:

<fgv7aj$d6k$1@news.datemas.de>

hg@x-formation.com wrote:

I'm in search of a STL datastructure which will let me implement an
unsorted map.

There is no such "STL datastructure".

I have data in the form of a key and corresponding value which needs
to be used as a FIFO queue.
In most cases I will look at the first item in this queue to see if
the key matches the expected. However in some cases I would like to
remove values with a specific key.
Furthermore "exceptions" to the FIFO can occur where values with
specific information can be taken out before the first element.

How would I implement this?

If you use a simple 'list' (or 'deque') of 'pair', you will implement
the ordered container of your key-value combinations. In order to
remove the specific pair from the collection, you just need to do
the 'find_if' with a particular predicate. If you do it rarely, the
linear search complexity shouldn't be too much of a hindrance.

There is this "priority queue" thing, but I've never used it, and do
not know if it's going to help you.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask