std::set<Key,Compare,Allocator>::size (3) - Linux Manuals
std::set<Key,Compare,Allocator>::size: std::set<Key,Compare,Allocator>::size
Command to display std::set<Key,Compare,Allocator>::size
manual in Linux: $ man 3 std::set<Key,Compare,Allocator>::size
NAME
std::set<Key,Compare,Allocator>::size - std::set<Key,Compare,Allocator>::size
Synopsis
size_type size() const; (until C++11)
size_type size() const noexcept; (since C++11)
Returns the number of elements in the container, i.e. std::distance(begin(), end()).
Parameters
(none)
Return value
The number of elements in the container.
Complexity
Constant.
Example
The following code uses size to display the number of elements in a std::set<int>:
// Run this code
#include <set>
#include <iostream>
int main()
{
std::set<int> nums {1, 3, 5, 7};
std::cout << "nums contains " << nums.size() << " elements.\n";
}
Output:
nums contains 4 elements.
See also
checks whether the container is empty
empty (public member function)
returns the maximum possible number of elements
max_size (public member function)
Pages related to std::set<Key,Compare,Allocator>::size
- std::set<Key,Compare,Allocator>::set (3) - std::set<Key,Compare,Allocator>::set
- std::set<Key,Compare,Allocator>::swap (3) - std::set<Key,Compare,Allocator>::swap
- std::set<Key,Compare,Allocator>::begin,std::set<Key,Compare,Allocator>::cbegin (3) - std::set<Key,Compare,Allocator>::begin,std::set<Key,Compare,Allocator>::cbegin
- std::set<Key,Compare,Allocator>::clear (3) - std::set<Key,Compare,Allocator>::clear
- std::set<Key,Compare,Allocator>::contains (3) - std::set<Key,Compare,Allocator>::contains
- std::set<Key,Compare,Allocator>::count (3) - std::set<Key,Compare,Allocator>::count
- std::set<Key,Compare,Allocator>::emplace (3) - std::set<Key,Compare,Allocator>::emplace
- std::set<Key,Compare,Allocator>::emplace_hint (3) - std::set<Key,Compare,Allocator>::emplace_hint
- std::set<Key,Compare,Allocator>::empty (3) - std::set<Key,Compare,Allocator>::empty
- std::set<Key,Compare,Allocator>::end,std::set<Key,Compare,Allocator>::cend (3) - std::set<Key,Compare,Allocator>::end,std::set<Key,Compare,Allocator>::cend
- std::set<Key,Compare,Allocator>::equal_range (3) - std::set<Key,Compare,Allocator>::equal_range
- std::set<Key,Compare,Allocator>::erase (3) - std::set<Key,Compare,Allocator>::erase
- std::set<Key,Compare,Allocator>::extract (3) - std::set<Key,Compare,Allocator>::extract
- std::set<Key,Compare,Allocator>::find (3) - std::set<Key,Compare,Allocator>::find
- std::set<Key,Compare,Allocator>::get_allocator (3) - std::set<Key,Compare,Allocator>::get_allocator
- std::set<Key,Compare,Allocator>::insert (3) - std::set<Key,Compare,Allocator>::insert
- std::set<Key,Compare,Allocator>::key_comp (3) - std::set<Key,Compare,Allocator>::key_comp
- std::set<Key,Compare,Allocator>::lower_bound (3) - std::set<Key,Compare,Allocator>::lower_bound
- std::set<Key,Compare,Allocator>::max_size (3) - std::set<Key,Compare,Allocator>::max_size
- std::set<Key,Compare,Allocator>::merge (3) - std::set<Key,Compare,Allocator>::merge
- std::set<Key,Compare,Allocator>::operator= (3) - std::set<Key,Compare,Allocator>::operator=
- std::set<Key,Compare,Allocator>::rbegin,std::set<Key,Compare,Allocator>::crbegin (3) - std::set<Key,Compare,Allocator>::rbegin,std::set<Key,Compare,Allocator>::crbegin
- std::set<Key,Compare,Allocator>::rend,std::set<Key,Compare,Allocator>::crend (3) - std::set<Key,Compare,Allocator>::rend,std::set<Key,Compare,Allocator>::crend
- std::set<Key,Compare,Allocator>::upper_bound (3) - std::set<Key,Compare,Allocator>::upper_bound
- std::set<Key,Compare,Allocator>::value_comp (3) - std::set<Key,Compare,Allocator>::value_comp
- std::set<Key,Compare,Allocator>::~set (3) - std::set<Key,Compare,Allocator>::~set
- std::set (3) - std::set