(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::priority_queue| Member functions | ||||
| Element access | ||||
| Capacity | ||||
| Modifiers | ||||
(C++23) | ||||
priority_queue::emplace (C++11) | ||||
(C++11) | ||||
| Non-member functions | ||||
(C++11) | ||||
| Helper classes | ||||
| Deduction guides(C++17) |
template<class...Args> void emplace( Args&&...args); | (since C++11) | |
Pushes a new element to the priority queue. The element is constructed in-place, i.e. no copy or move operations are performed. The constructor of the element is called with exactly the same arguments as supplied to the function.
Effectively callsc.emplace_back(std::forward<Args>(args)...);std::push_heap(c.begin(), c.end(), comp);
Contents |
| args | - | arguments to forward to the constructor of the element |
(none)
Logarithmic number of comparisons plus the complexity ofContainer::emplace_back.
#include <iostream>#include <queue> struct S{int id; S(int i,double d,std::string s): id{i}{std::cout<<"S::S("<< i<<", "<< d<<",\""<< s<<"\");\n";}friendbool operator<(Sconst& x, Sconst& y){return x.id< y.id;}}; int main(){std::priority_queue<S> queue; queue.emplace(42,3.14,"C++");std::cout<<"id: "<< queue.top().id<<'\n';}
Output:
S::S(42, 3.14, "C++")id = 42
| inserts element and sorts the underlying container (public member function)[edit] | |
| removes the top element (public member function)[edit] |
