std::experi...if(std::set)(3)
π NAME π
okay so bestie, this is the manual page for std::experi...if(std::set)(3) β the manual name is literally that β and it comes from the C++ Standard Libary. The NAME entry is std::experimental::erase_if(std::set) - std::experimental::erase_if(std::set). iconic π
πΈ Synopsis πΈ
Defined in header <experimental/set> π¦
template< class Key, class Compare, class Alloc, class Pred >
void erase_if( std::set<Key, Compare, Alloc>& c, Pred pred );
This one is tagged (library fundamentals TS v2). iykyk β¨
It 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β the container from which to erase π«Άpredβ the predicate that determines which elements should be erased π
β Complexity β
Linear. literally linear, bestie β¨
π§ Example π§
// Run this code
#include <experimental/set>
#include <iostream>
template<typename Os, typename Container>
inline Os& operator<<(Os& os, Container const& container)
{
os << "{ ";
for (const auto& item : container)
os << item << ' ';
return os << '}';
}
int main()
{
std::set<int> data{3, 3, 4, 5, 5, 6, 6, 7, 2, 1, 0};
std::cout << "Original:\n" << data << '\n';
auto divisible_by_3 = [](auto const& x) { return (x % 3) == 0; };
std::experimental::erase_if(data, divisible_by_3);
std::cout << "Erase all items divisible by 3:\n" << data << '\n';
}
π₯οΈ Output π₯οΈ
Original:
{ 0 1 2 3 4 5 6 7 }
Erase all items divisible by 3:
{ 1 2 4 5 7 }
π See also π
removeβ removes elements satisfying specific criteriaremove_if(function template)
π·οΈ Category π·οΈ
Noindexed pages
source/version: http://cppreference.com Β· date: 2024.06.10 β okay bye bestie, go erase with confidence and main character energy π
β¨π¦π
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms