std::erase_if(std::set) (3) - Linux Manuals
std::erase_if(std::set): std::erase_if(std::set)
Command to display std::erase_if(std::set)
manual in Linux: $ man 3 std::erase_if(std::set)
NAME
std::erase_if(std::set) - std::erase_if(std::set)
Synopsis
Defined in header <set>
template< class Key, class Compare, class Alloc, class Pred > (1) (since C++20)
void erase_if(std::set<Key,Compare,Alloc>& c, Pred pred);
Erases all elements that satisfy the predicate pred from the container. Equivalent to
for (auto i = c.begin(), last = c.end(); i != last; ) {
if (pred(*i)) {
i = c.erase(i);
} else {
++i;
}
}
Parameters
c - container from which to erase
pred - predicate that returns true if the element should be erased
Complexity
Linear.
Example
This section is incomplete
Reason: no example
See also
removes elements satisfying specific criteria
remove (function template)
remove_if
Pages related to std::erase_if(std::set)
- std::erase_if(std::map) (3) - std::erase_if(std::map)
- std::erase_if(std::multimap) (3) - std::erase_if(std::multimap)
- std::erase_if(std::multiset) (3) - std::erase_if(std::multiset)
- std::erase_if(std::unordered_map) (3) - std::erase_if(std::unordered_map)
- std::erase_if(std::unordered_multimap) (3) - std::erase_if(std::unordered_multimap)
- std::erase_if(std::unordered_multiset) (3) - std::erase_if(std::unordered_multiset)
- std::erase_if(std::unordered_set) (3) - std::erase_if(std::unordered_set)
- std::erase,std::erase_if(std::basic_string) (3) - std::erase,std::erase_if(std::basic_string)
- std::erase,std::erase_if(std::deque) (3) - std::erase,std::erase_if(std::deque)
- std::erase,std::erase_if(std::forward_list) (3) - std::erase,std::erase_if(std::forward_list)
- std::erase,std::erase_if(std::list) (3) - std::erase,std::erase_if(std::list)
- std::erase,std::erase_if(std::vector) (3) - std::erase,std::erase_if(std::vector)
- std::erf,std::erff,std::erfl (3) - std::erf,std::erff,std::erfl