#include <functional>
#include <utility>
#include <concepts/concepts.hpp>
#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/find_if.hpp>
#include <range/v3/algorithm/find_if_not.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/operations.hpp>
#include <range/v3/iterator/reverse_iterator.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/utility/move.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/detail/prologue.hpp>
#include <range/v3/detail/epilogue.hpp>

Go to the source code of this file.

Functions
	ranges::template (typename I, typename C, typename P=identity)(AND permutable< I > AND indirect_unary_predicate< C
	unstable_remove have O(1) complexity for each element remove, unlike remove O(n) [for worst case]. More...

projected< I, P > constexpr I RANGES_FUNC()	ranges::unstable_remove_if (I first, I last, C pred, P proj={})

	ranges::template (typename Rng, typename C=equal_to, typename P=identity)(AND indirect_relation< C
	This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

projected< iterator_t< Rng >, P > constexpr borrowed_iterator_t< Rng > RANGES_FUNC()	ranges::unstable_remove_if (Rng &&rng, C pred, P proj=P{})

Functions