std::flat_multiset<Key,Compare,KeyContainer>:: empty
|
(C++17)
|
||||
| Sequence | ||||
|
(C++11)
|
||||
|
(C++26)
|
||||
|
(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 |
| Member types | ||||
| Member functions | ||||
| Non-member functions | ||||
| Helper classes | ||||
| Tags | ||||
| Deduction guides | ||||
|
bool
empty
(
)
const
noexcept
;
|
(自 C++23 起) | |
检查底层容器是否为空。等价于: return begin ( ) == end ( ) ; 。
目录 |
参数
(无)
返回值
若底层容器为空则为 true ,否则为 false 。
复杂度
常量。
示例
以下代码使用
empty
检查
std::
flat_multiset
<
int
>
是否包含任何元素:
#include <iostream> #include <flat_set> int main() { std::flat_multiset<int> numbers; std::cout << std::boolalpha; std::cout << "Initially, numbers.empty(): " << numbers.empty() << '\n'; numbers.insert(42); numbers.insert(19937); std::cout << "After adding elements, numbers.empty(): " << numbers.empty() << '\n'; }
输出:
Initially, numbers.empty(): true After adding elements, numbers.empty(): false
另请参阅
|
返回元素数量
(公开成员函数) |
|
|
(C++17)
|
检查容器是否为空
(函数模板) |