std::priority_queue<T,Container,Compare>::empty
From cppreference.com
< cpp | container | priority queue
bool empty() const; |
||
Checks if the underlying container has no elements. Equivalent to return c.empty();.
Contents |
[edit] Parameters
(none)
[edit] Return value
true if the underlying container is empty, false otherwise.
[edit] Complexity
Constant.
[edit] Example
Run this code
#include <algorithm> #include <iostream> #include <queue> int main() { std::cout << std::boolalpha; std::priority_queue<int> queue; std::cout << "Initially, queue.empty(): " << queue.empty() << '\n'; queue.push(42); std::cout << "After adding elements, queue.empty(): " << queue.empty() << '\n'; }
Output:
Initially, queue.empty(): true After adding elements, queue.empty(): false
[edit] See also
returns the number of elements (public member function) | |
(C++17) |
checks whether the container is empty (function template) |