RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.cppreference.com/w/cpp/algorithm/../../cpp/header/../experimental/deque/erase_if.html below:

std::experimental::erase_if (std::deque) - cppreference.com

Merged into ISO C++ The functionality described on this page was merged into the mainline ISO C++ standardas of 11/2018, see std::erase_if (since C++20) template< class T, class Alloc, class Pred > void erase_if( std::deque<T, Alloc>& c, Pred pred ); (library fundamentals TS v2)

Erases all elements that satisfy the predicate pred from the container. Equivalent to c.erase(std::remove_if(c.begin(), c.end(), pred), c.end());.

[edit] Parameters c - container from which to erase pred - predicate that determines which elements should be erased [edit] Complexity

Linear.

[edit] Example

#include <experimental/deque>
#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::deque<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:
{ 3 3 4 5 5 6 6 7 2 1 0 }
Erase all items divisible by 3:
{ 4 5 5 7 2 1 }

[edit] See also

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4