std::priority_queue<T,Container,Compare>::size
From cppreference.com
< cpp | container | priority queue
size_type size() const; |
||
Returns the number of elements in the container adaptor. Equivalent to return c.size().
Contents |
[edit] Parameters
(none)
[edit] Return value
The number of elements in the container adaptor.
[edit] Complexity
Constant.
[edit] Example
Run this code
#include <algorithm> #include <cassert> #include <queue> int main() { std::priority_queue<int> queue; assert(queue.size() == 0); const int count = 8; for (int i = 0; i != count; ++i) queue.push(i); assert(queue.size() == count); }
[edit] See also
checks whether the container adaptor is empty (public member function) | |
(C++17)(C++20) |
returns the size of a container or array (function template) |