473,322 Members | 1,417 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,322 software developers and data experts.

STL: find() and iteration on priority_queue

I'm using a stl-priority queue and want
- find out if a certain item is contained in the queue
- to be able iterate over all items without having to pop() them, order
does not matter.

I couldnt find methods for these which suprises me as both should be
easily solvable with access to the underlying vector.

Did I just miss these methods? Can I somehow access the vector to get .
begin() .end() and .find()?

TIA
Henning
Jul 12 '06 #1
9 28297
Henning Hasemann wrote:
I'm using a stl-priority queue and want
- find out if a certain item is contained in the queue
- to be able iterate over all items without having to pop() them, order
does not matter.

I couldnt find methods for these which suprises me as both should be
easily solvable with access to the underlying vector.
Well, they are not operations that are supposed to be done with a queue.
There is not much point in making a queue that offers random access. It
just wouldn't qualify as queue anymore.
Did I just miss these methods? Can I somehow access the vector to get .
begin() .end() and .find()?
If you want the functionality of a vector, just use a vector.

Jul 12 '06 #2
Rolf Magnus wrote:
Henning Hasemann wrote:
>I'm using a stl-priority queue and want
- find out if a certain item is contained in the queue
- to be able iterate over all items without having to pop() them, order
does not matter.

I couldnt find methods for these which suprises me as both should be
easily solvable with access to the underlying vector.

Well, they are not operations that are supposed to be done with a queue.
There is not much point in making a queue that offers random access. It
just wouldn't qualify as queue anymore.
I dont want random access. I just want a way to read all elements
without having to deconstruct the queue. (read-only acces is enough for me)
>Did I just miss these methods? Can I somehow access the vector to get .
begin() .end() and .find()?

If you want the functionality of a vector, just use a vector.
That comment was rather unhelpful.
I want the functionality of a priority_queue because I need fast access
to the "highest" element.
I also need to be able to find out if a certain element is contained.
Iterating isnt even necessary if I'd had only a contains()-method or
something.

To give you the whole picture I'm talking about a container for the
open-"list" used in the dijkstra algorithm and the 3 operations done
with it are inerting an element, getting and removing the element with
the highest value and testing if a certain element is contained.

Unfortunately the code is really time-critical and using a list and
insertion sort is simply to slow.

Any suggestions?

Jul 12 '06 #3
Did I just miss these methods? Can I somehow access the vector to get .
begin() .end() and .find()?
If you want the functionality of a vector, just use a vector.

That comment was rather unhelpful.
I want the functionality of a priority_queue because I need fast access
to the "highest" element.
I also need to be able to find out if a certain element is contained.
Iterating isnt even necessary if I'd had only a contains()-method or
something.
In that case, what's wrong with map or multimap? Seem to have all your
requirements?

Jul 12 '06 #4
Henning Hasemann wrote:
Rolf Magnus wrote:
>Henning Hasemann wrote:
>>I'm using a stl-priority queue and want
- find out if a certain item is contained in the queue
- to be able iterate over all items without having to pop() them, order
does not matter.

I couldnt find methods for these which suprises me as both should be
easily solvable with access to the underlying vector.

Well, they are not operations that are supposed to be done with a queue.
There is not much point in making a queue that offers random access. It
just wouldn't qualify as queue anymore.

I dont want random access. I just want a way to read all elements
without having to deconstruct the queue. (read-only acces is enough for
me)
>>Did I just miss these methods? Can I somehow access the vector to get .
begin() .end() and .find()?

If you want the functionality of a vector, just use a vector.

That comment was rather unhelpful.
I want the functionality of a priority_queue because I need fast access
to the "highest" element.
I also need to be able to find out if a certain element is contained.
Iterating isnt even necessary if I'd had only a contains()-method or
something.

To give you the whole picture I'm talking about a container for the
open-"list" used in the dijkstra algorithm and the 3 operations done
with it are inerting an element, getting and removing the element with
the highest value and testing if a certain element is contained.

Unfortunately the code is really time-critical and using a list and
insertion sort is simply to slow.

Any suggestions?
A) You can use a BAD HACK (tm):
#include <queue>
#include <iostream>
#include <algorithm>
#include <iterator>
typedef std::priority_queue<intint_priority_queue;

template < typename T >
T const * q_begin ( std::priority_queue<Tconst & q ) {
return ( &( q.top() ) );
}

template < typename T >
T const * q_end ( std::priority_queue<Tconst & q ) {
return ( &( q.top() ) + q.size() );
}

int main ( void ) {
int_priority_queue q;
q.push( 1 );
q.push( 2 );
q.push( 3 );
std::copy( q_begin( q ), q_end( q ),
std::ostream_iterator<int>( std::cout, " " ) );
std::cout << '\n';
}
Note that this is based on two assumptions:

a) The underlying sequence container is contiguous. This is guaranteed by
the standard for std::vector.

b) The priority_queue is implemented so that the top() element comes first
in the sequence. This is the way, heaps are organized. However, the
standard does not guarantee that priority_queue<Tworks this way. YMMV.

B) You can use a vector directly: <algorithmprovides push_heap() and
pop_heap() for any range.
C) For further speed-up, you may consider making use of the heap-structure
when deciding whether a certain element is contained in the queue: it
should take log( size() ) comparisons.
Best

Kai-Uwe Bux
Jul 12 '06 #5
Henning Hasemann wrote:
I'm using a stl-priority queue and want
- find out if a certain item is contained in the queue
- to be able iterate over all items without having to pop() them, order
does not matter.

I couldnt find methods for these which suprises me as both should be
easily solvable with access to the underlying vector.

Did I just miss these methods? Can I somehow access the vector to get .
begin() .end() and .find()?
You didn't miss them because they're not provided *on purpose*. See
http://www.sgi.com/tech/stl/priority_queue.html (scroll down to note 2)
for reasons why and what you can do about it.

Kristo

Jul 12 '06 #6
Henning Hasemann wrote:
To give you the whole picture I'm talking about a container for the
open-"list" used in the dijkstra algorithm and the 3 operations done
with it are inerting an element, getting and removing the element with
the highest value and testing if a certain element is contained.
Unfortunately the code is really time-critical and using a list and
insertion sort is simply to slow.
Any suggestions?
Other than write some code that does what you want?

--
Salu2
Jul 12 '06 #7
Henning Hasemann wrote:
Rolf Magnus wrote:
>Henning Hasemann wrote:
>>I'm using a stl-priority queue and want
- find out if a certain item is contained in the queue
- to be able iterate over all items without having to pop() them, order
does not matter.

I couldnt find methods for these which suprises me as both should be
easily solvable with access to the underlying vector.
Well, they are not operations that are supposed to be done with a queue.
There is not much point in making a queue that offers random access. It
just wouldn't qualify as queue anymore.

I dont want random access. I just want a way to read all elements
without having to deconstruct the queue. (read-only acces is enough for me)
>>Did I just miss these methods? Can I somehow access the vector to get .
begin() .end() and .find()?
If you want the functionality of a vector, just use a vector.

That comment was rather unhelpful.
I want the functionality of a priority_queue because I need fast access
to the "highest" element.
I also need to be able to find out if a certain element is contained.
Iterating isnt even necessary if I'd had only a contains()-method or
something.

To give you the whole picture I'm talking about a container for the
open-"list" used in the dijkstra algorithm and the 3 operations done
with it are inerting an element, getting and removing the element with
the highest value and testing if a certain element is contained.

Unfortunately the code is really time-critical and using a list and
insertion sort is simply to slow.
Use private inheritance to inherit from priority_queue(). The
underlying container is a protected member. Make sure you make the
inherited functions visible with using declarations.

Jul 12 '06 #8
red floyd wrote:
Use private inheritance to inherit from priority_queue(). The
underlying container is a protected member. Make sure you make the
inherited functions visible with using declarations.
I don't have a copy of the standard here, but I suspect that's an
implementation detail. I wouldn't rely on the underlying container
being protected if you're trying to write code that is portable across
compilers.

Jul 13 '06 #9
Kristo wrote:
red floyd wrote:
>Use private inheritance to inherit from priority_queue(). The
underlying container is a protected member. Make sure you make the
inherited functions visible with using declarations.

I don't have a copy of the standard here, but I suspect that's an
implementation detail. I wouldn't rely on the underlying container
being protected if you're trying to write code that is portable across
compilers.
Actually, I got that info from Josuttis. Also, I just checked -- the
Standard 23.2.3.2/1 shows the underlying container and comparison
functions as protected members. So it's not an implementation detail.
Jul 13 '06 #10

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

4
by: Tom | last post by:
Hi, I need some help with stl maps. I am using a std::map that is sorted in a very special way. Therefore I am using my own sort function. That works fine. But this is only half the problem....
30
by: Przemo Drochomirecki | last post by:
Hi, The task was indeed simple. Read 2.000.000 words (average length = 9), sort them and write it to new file. I've made this in STL, and it was almost 17 times slower than my previous...
25
by: rokia | last post by:
in a project, I use many,many stl such as stack,list,vctor etc. somewhere the vector's size is more than 2K. is this a efficient way?
3
by: Prakash Bande | last post by:
Hi, I have bool operator == (xx* obj, const string st). I have declared it as friend of class xx. I am now able to do this: xx ox; string st; if (&ox == st) { } But, when I have a vector<xx*>...
13
by: zaineb | last post by:
Hi, This is a follow-up of sort of this thread:...
8
by: olanglois | last post by:
Hi, I was asking myself to following question. What is better to erase an element from a STL map: calling (option #1) size_type erase(const key_type& k) or calling (option #2)
10
by: Christian Chrismann | last post by:
Hi, I've a question on the STL find algorithm: My code: int main( void ) { vector< ClassA* myVector; ClassA *ptrElement1 = ...;
1
by: vermarajeev | last post by:
Hi, EveryBody This question is really interesting one. My question is related to "STL Find Algorithm" Defination Direct from book Now my questions are
4
by: Anonymous | last post by:
I ahve a vector of doubles taht I need to extract values from. I was just about to use the STL find() algo, but I have a couple of questions: first: can you specify the tolerance threshold to...
0
by: DolphinDB | last post by:
Tired of spending countless mintues downsampling your data? Look no further! In this article, you’ll learn how to efficiently downsample 6.48 billion high-frequency records to 61 million...
0
by: ryjfgjl | last post by:
ExcelToDatabase: batch import excel into database automatically...
0
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
0
by: ArrayDB | last post by:
The error message I've encountered is; ERROR:root:Error generating model response: exception: access violation writing 0x0000000000005140, which seems to be indicative of an access violation...
1
by: PapaRatzi | last post by:
Hello, I am teaching myself MS Access forms design and Visual Basic. I've created a table to capture a list of Top 30 singles and forms to capture new entries. The final step is a form (unbound)...
1
by: CloudSolutions | last post by:
Introduction: For many beginners and individual users, requiring a credit card and email registration may pose a barrier when starting to use cloud servers. However, some cloud server providers now...
1
by: Defcon1945 | last post by:
I'm trying to learn Python using Pycharm but import shutil doesn't work
0
by: af34tf | last post by:
Hi Guys, I have a domain whose name is BytesLimited.com, and I want to sell it. Does anyone know about platforms that allow me to list my domain in auction for free. Thank you
0
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 3 Apr 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome former...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.