std::priority_queue<T,Container,Compare>::emplace (3) - Linux Manuals
std::priority_queue<T,Container,Compare>::emplace: std::priority_queue<T,Container,Compare>::emplace
Command to display std::priority_queue<T,Container,Compare>::emplace
manual in Linux: $ man 3 std::priority_queue<T,Container,Compare>::emplace
NAME
std::priority_queue<T,Container,Compare>::emplace - std::priority_queue<T,Container,Compare>::emplace
Synopsis
template< class... Args > (since C++11)
void emplace( Args&&... args );
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
Return value
(none)
Complexity
Logarithmic number of comparisons plus the complexity of Container::emplace_back.
See also
inserts element and sorts the underlying container
push (public member function)
removes the top element
pop (public member function)
Pages related to std::priority_queue<T,Container,Compare>::emplace
- std::priority_queue<T,Container,Compare>::empty (3) - std::priority_queue<T,Container,Compare>::empty
- std::priority_queue<T,Container,Compare>::operator= (3) - std::priority_queue<T,Container,Compare>::operator=
- std::priority_queue<T,Container,Compare>::pop (3) - std::priority_queue<T,Container,Compare>::pop
- std::priority_queue<T,Container,Compare>::priority_queue (3) - std::priority_queue<T,Container,Compare>::priority_queue
- std::priority_queue<T,Container,Compare>::push (3) - std::priority_queue<T,Container,Compare>::push
- std::priority_queue<T,Container,Compare>::size (3) - std::priority_queue<T,Container,Compare>::size
- std::priority_queue<T,Container,Compare>::swap (3) - std::priority_queue<T,Container,Compare>::swap
- std::priority_queue<T,Container,Compare>::top (3) - std::priority_queue<T,Container,Compare>::top
- std::priority_queue<T,Container,Compare>::~priority_queue (3) - std::priority_queue<T,Container,Compare>::~priority_queue
- std::priority_queue (3) - std::priority_queue
- std::printf,std::fprintf,std::sprintf,std::snprintf (3) - std::printf,std::fprintf,std::sprintf,std::snprintf
- std::prev (3) - std::prev