std::priority_queue<T,Container,Compare>::push (3) - Linux Manuals
std::priority_queue<T,Container,Compare>::push: std::priority_queue<T,Container,Compare>::push
NAME
std::priority_queue<T,Container,Compare>::push - std::priority_queue<T,Container,Compare>::push
Synopsis
void push( const value_type& value );
void push( value_type&& value ); (since C++11)
Pushes the given element value to the priority queue.
1) Effectively calls c.push_back(value); std::push_heap(c.begin(), c.end(), comp);
2) Effectively calls c.push_back(std::move(value)); std::push_heap(c.begin(), c.end(), comp);
Parameters
value - the value of the element to push
Return value
(none)
Complexity
Logarithmic number of comparisons plus the complexity of Container::push_back.
See also
emplace constructs element in-place and sorts the underlying container
(C++11)
pop (public member function)