std::priority_queue<T,Container,Compare>::empty
From cppreference.com
< cpp | container | priority queue
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::priority_queue bool empty() const;
Checks if the underlying container has no elements. Equivalent to: return c .empty().
[edit] Parameters
(none)
[edit] Return value
true if the underlying container is empty, false otherwise.
[edit] Complexity
Constant.
[edit] Example
Run this code
#include <cassert> #include <queue> int main() { std::priority_queue <int> queue; assert (queue.empty()); queue.push(42); assert (!queue.empty()); queue.pop(); assert (queue.empty()); }