[priqueue.members] (original) (raw)

23 Containers library [containers]

23.6 Container adaptors [container.adaptors]

23.6.4 Class template priority_queue [priority.queue]

23.6.4.4 Members [priqueue.members]

constexpr void push(const value_type& x);

Effects: As if by:c.push_back(x); push_heap(c.begin(), c.end(), comp);

constexpr void push(value_type&& x);

Effects: As if by:c.push_back(std::move(x)); push_heap(c.begin(), c.end(), comp);

Effects: Inserts all elements of rg in c viac.append_range(std​::​forward<R>(rg)) if that is a valid expression, orranges​::​copy(rg, back_inserter(c)) otherwise.

Then restores the heap property as if bymake_heap(c.begin(), c.end(), comp).

Postconditions: is_heap(c.begin(), c.end(), comp) is true.

template<class... Args> constexpr void emplace(Args&&... args);

Effects: As if by:c.emplace_back(std::forward<Args>(args)...); push_heap(c.begin(), c.end(), comp);

Effects: As if by:pop_heap(c.begin(), c.end(), comp); c.pop_back();