std::flat_set<Key,Compare,KeyContainer>::size
From cppreference.com
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 |
size_type size() const noexcept; |
(since C++23) | |
Returns the number of elements in the container adaptor. Equivalent to:
return
c
.size()
Parameters
(none)
Return value
The number of elements in the container adaptor.
Complexity
Constant.
Example
Run this code
#include <cassert> #include <flat_set> int main() { std::flat_set<int> nums{4, 2, 4, 2}; assert(nums.size() == 2); }
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) |
| returns the maximum possible number of elements (public member function) |