std::priority_queue<T,Container,Compare>::emplace - cppreference.com

From cppreference.com

template<class...Args>voidemplace(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 calls

c.emplace_back(std::forward<Args>(args)...);std::push_heap(c.begin(),c.end(),comp);Parameters

args - arguments to forward to the constructor of the element Complexity

Logarithmic number of comparisons plus the complexity of Container::emplace_back.

Example

Run this code

#include<iostream>#include<queue>structS{intid;S(inti,doubled,std::strings):id{i}{std::cout<<"S::S("<<i<<", "<<d<<", \""<<s<<"\");\n";}friendbooloperator<(Sconst&x,Sconst&y){returnx.id<y.id;}};intmain(){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 See also

inserts element and sorts the underlying container
(public member function)

[edit]

removes the top element
(public member function)

[edit]