std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor (3) - Linux Manuals
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor: std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor
Command to display std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor manual in Linux: $ man 3 std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor
NAME
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor
Synopsis
float max_load_factor() const; (1) (since C++11)
void max_load_factor( float ml ); (2) (since C++11)
Manages the maximum load factor (number of elements per bucket). The container automatically increases the number of buckets if the load factor exceeds this threshold.
1) Returns current maximum load factor.
2) Sets the maximum load factor to ml.
Parameters
ml - new maximum load factor setting
Return value
1) current maximum load factor.
2) none.
Complexity
Constant
See also
returns average number of elements per bucket
load_factor (public member function)
Pages related to std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_bucket_count (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_bucket_count
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::merge (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::merge
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::at (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::at
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type), (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type),
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin(size_type) (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin(size_type)
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin, (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin,
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_count (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_count
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_size (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_size
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::clear (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::clear
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::contains (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::contains
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::count (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::count
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::empty (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::empty
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type), (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type),
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend(size_type) (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend(size_type)
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end, (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end,
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::equal_range (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::equal_range
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::erase (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::erase
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::extract (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::extract
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::find (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::find
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::get_allocator (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::get_allocator
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::hash_function (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::hash_function
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert_or_assign (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert_or_assign
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::key_eq (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::key_eq
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::load_factor (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::load_factor
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator= (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator=
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator[] (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator[]
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::reserve (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::reserve
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::size (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::size
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::swap (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::swap
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::try_emplace (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::try_emplace
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map
- std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::~unordered_map (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::~unordered_map
- std::unordered_map (3) - std::unordered_map