English | 简体中文 | 繁體中文 | Русский язык | Français | Español | Português | Deutsch | 日本語 | 한국어 | Italiano | بالعربية
C++ The queue size() function returns the number of elements in the queue.
size_type size() const;
This function takes no parameters and returns the size of the queue.
Returns the number of elements in the queue. In other words, it gives the size of the queue.
#include <iostream> #include <queue> int main() { std::queue<int> newqueue; std::cout << "0. size: " << newqueue.size(); for(int j=0;5; j++) newqueue.push(j); std::cout << "\n"; std::cout << "1. size: " << newqueue.size(); newqueue.pop(); std::cout << "\n"; std::cout << "2. size: "<< newqueue.size(); return 0; }
Output:
0.size: 0 1.size: 5 2.size: 4
#include <iostream> #include <queue> using namespace std; int main() { int result = 0; queue<int> newqueue; newqueue.push(12); newqueue.push(24); newqueue.push(36); newqueue.push(48); cout << "queue size is "; cout << newqueue.size(); return 0; }
Output:
The size of queue is 4
The complexity is constant.
This function accesses the container. By accessing the container, the size of the queue can be evaluated.
It provides the same guarantees as operations performed on underlying container objects.