std::priority_queue<T,Container,Compare>:: empty
From cppreference.com
<
cpp
|
container
|
priority queue
C++
Containers library
Sequence | ||||
(C++11)
|
||||
(C++26)
|
||||
(C++11)
|
||||
Associative | ||||
Unordered associative | ||||
(C++11)
|
||||
(C++11)
|
||||
(C++11)
|
||||
(C++11)
|
||||
Adaptors | ||||
(C++23)
|
||||
(C++23)
|
||||
(C++23)
|
||||
(C++23)
|
||||
Views | ||||
(C++20)
|
||||
(C++23)
|
||||
Tables | ||||
Iterator invalidation | ||||
Member function table | ||||
Non-member function table |
std::priority_queue
Member functions | ||||
Element access | ||||
Capacity | ||||
priority_queue::empty
|
||||
Modifiers | ||||
(C++23)
|
||||
(C++11)
|
||||
(C++11)
|
||||
Non-member functions | ||||
(C++11)
|
||||
Helper classes | ||||
(C++23)
|
||||
Deduction guides (C++17) |
bool
empty
(
)
const
;
|
||
Checks if the underlying container has no elements. Equivalent to:
return
c
.
empty
(
)
.
Parameters
(none)
Return value
true if the underlying container is empty, false otherwise.
Complexity
Constant.
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()); }
See also
returns the number of elements
(public member function) |
|
(C++17)
|
checks whether the container is empty
(function template) |
Retrieved from "
https://en.cppreference.com/mwiki/index.php?title=cpp/container/priority_queue/empty&oldid=133060
"