Arch1tect
Reputation: 4281
Why priority_queue doesn't have front() but top()
Since it's a 'queue', shouldn't the method be called front() rather than top() ? Is there some reason behind this?
Upvotes: 1
Views: 122
Answers (1)
xaxxon
Reputation: 19761
It's because (in my estimation - as I didn't name it..) they're commonly implemented with heaps which conceptually have a top - as in stuff rises to the top of the heap to be taken off next.
https://en.wikipedia.org/wiki/Priority_queue
Upvotes: 2
Related Questions
- Is < faster than <=?
- Why is processing a sorted array faster than processing an unsorted array?
- Compiling an application for use in highly radioactive environments
- Image Processing: Algorithm Improvement for 'Coca-Cola Can' Recognition
- Why is reading lines from stdin much slower in C++ than Python?
- C++11 introduced a standardized memory model. What does it mean? And how is it going to affect C++ programming?
- Why should I use a pointer rather than the object itself?
- What are the rules about using an underscore in a C++ identifier?
- Why are elementwise additions much faster in separate loops than in a combined loop?
- Where and why do I have to put the "template" and "typename" keywords?