(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 | |||||||||||||||||||||
|
| ||||||||||||||||||||
| Deduction guides(C++17) | |||||||||||||||||||||
size_type size()const; | (noexcept since C++11) (constexpr since C++26) | |
Returns the number of elements in the container.
Contents |
std::distance(begin(), end())
Constant.
The following code usessize to display the number of elements in astd::deque:
#include <deque>#include <iostream> int main(){std::deque<int> nums{1,3,5,7}; std::cout<<"nums contains "<< nums.size()<<" elements.\n";}
Output:
nums contains 4 elements.
| checks whether the container is empty (public member function)[edit] | |
| returns the maximum possible number of elements (public member function)[edit] | |
| changes the number of elements stored (public member function)[edit] | |
(C++17)(C++20) | returns the size of a container or array (function template)[edit] |
