std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set (3) - Linux Manuals

std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set: std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set

Command to display std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set manual in Linux: $ man 3 std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set

NAME

std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set - std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set

Synopsis

~unordered_set(); (since C++11)

Destructs the container. The destructors of the elements are called and the used storage is deallocated. Note, that if the elements are pointers, the pointed-to objects are not destroyed.

Complexity

Linear in the size of the container.

Pages related to std::unordered_set<Key,Hash,KeyEqual,Allocator>::~unordered_set

std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin(size_type), (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin(size_type),
std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin(size_type),std::unordered_set<Key,Hash,KeyEqual,Allocator>::cbegin(size_type) (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin(size_type),std::unordered_set<Key,Hash,KeyEqual,Allocator>::cbegin(size_type)
std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin, (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin,
std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin,std::unordered_set<Key,Hash,KeyEqual,Allocator>::cbegin (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::begin,std::unordered_set<Key,Hash,KeyEqual,Allocator>::cbegin
std::unordered_set<Key,Hash,KeyEqual,Allocator>::bucket (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::bucket
std::unordered_set<Key,Hash,KeyEqual,Allocator>::bucket_count (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::bucket_count
std::unordered_set<Key,Hash,KeyEqual,Allocator>::bucket_size (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::bucket_size
std::unordered_set<Key,Hash,KeyEqual,Allocator>::clear (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::clear
std::unordered_set<Key,Hash,KeyEqual,Allocator>::contains (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::contains
std::unordered_set<Key,Hash,KeyEqual,Allocator>::count (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::count
std::unordered_set<Key,Hash,KeyEqual,Allocator>::emplace (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::emplace
std::unordered_set<Key,Hash,KeyEqual,Allocator>::emplace_hint (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::emplace_hint
std::unordered_set<Key,Hash,KeyEqual,Allocator>::empty (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::empty
std::unordered_set<Key,Hash,KeyEqual,Allocator>::end(size_type), (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::end(size_type),
std::unordered_set<Key,Hash,KeyEqual,Allocator>::end(size_type),std::unordered_set<Key,Hash,KeyEqual,Allocator>::cend(size_type) (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::end(size_type),std::unordered_set<Key,Hash,KeyEqual,Allocator>::cend(size_type)
std::unordered_set<Key,Hash,KeyEqual,Allocator>::end, (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::end,
std::unordered_set<Key,Hash,KeyEqual,Allocator>::end,std::unordered_set<Key,Hash,KeyEqual,Allocator>::cend (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::end,std::unordered_set<Key,Hash,KeyEqual,Allocator>::cend
std::unordered_set<Key,Hash,KeyEqual,Allocator>::equal_range (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::equal_range
std::unordered_set<Key,Hash,KeyEqual,Allocator>::erase (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::erase
std::unordered_set<Key,Hash,KeyEqual,Allocator>::extract (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::extract
std::unordered_set<Key,Hash,KeyEqual,Allocator>::find (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::find
std::unordered_set<Key,Hash,KeyEqual,Allocator>::get_allocator (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::get_allocator
std::unordered_set<Key,Hash,KeyEqual,Allocator>::hash_function (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::hash_function
std::unordered_set<Key,Hash,KeyEqual,Allocator>::insert (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::insert
std::unordered_set<Key,Hash,KeyEqual,Allocator>::key_eq (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::key_eq
std::unordered_set<Key,Hash,KeyEqual,Allocator>::load_factor (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::load_factor
std::unordered_set<Key,Hash,KeyEqual,Allocator>::max_bucket_count (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::max_bucket_count
std::unordered_set<Key,Hash,KeyEqual,Allocator>::max_load_factor (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::max_load_factor
std::unordered_set<Key,Hash,KeyEqual,Allocator>::max_size (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::max_size
std::unordered_set<Key,Hash,KeyEqual,Allocator>::merge (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::merge
std::unordered_set<Key,Hash,KeyEqual,Allocator>::operator= (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::operator=
std::unordered_set<Key,Hash,KeyEqual,Allocator>::rehash (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::rehash
std::unordered_set<Key,Hash,KeyEqual,Allocator>::reserve (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::reserve
std::unordered_set<Key,Hash,KeyEqual,Allocator>::size (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::size
std::unordered_set<Key,Hash,KeyEqual,Allocator>::swap (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::swap
std::unordered_set<Key,Hash,KeyEqual,Allocator>::unordered_set (3) - std::unordered_set<Key,Hash,KeyEqual,Allocator>::unordered_set
std::unordered_set (3) - std::unordered_set