- queue[meta header]
- std[meta namespace]
- priority_queue[meta class]
- function[meta id-type]
void push(const value_type& x); // (1) C++03
constexpr void push(const value_type& x); // (1) C++26
void push(value_type&& x); // (2) C++11
constexpr void push(value_type&& x); // (2) C++26新たな要素を追加し、優先順に並べ替えを行う。
-
(1) :
c.push_back(x); push_heap(c.begin(), c.end(), comp);- push_heap[link /reference/algorithm/push_heap.md]
-
(2) :
c.push_back(move(x)); push_heap(c.begin(), c.end(), comp);- move[link /reference/utility/move.md]
- push_heap[link /reference/algorithm/push_heap.md]
なし
#include <iostream>
#include <queue>
int main()
{
std::priority_queue<int> que;
que.push(3);
que.push(1);
que.push(4);
while (!que.empty()) {
const int& x = que.top();
std::cout << x << std::endl;
que.pop();
}
}- push[color ff0000]
- que.empty()[link empty.md]
- que.pop()[link pop.md]
4
3
1
- Clang: ??
- GCC: 4.7.0 [mark verified]
- ICC: ??
- Visual C++: ??