std::experi...if(std::set)(3)

πŸ“¦ version 2024.07.05, in nixpkgs unstable, opensuse-leap 16.0

πŸ’– 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 criteria
  • remove_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