Range-v3
Range algorithms, views, and actions for the Standard Library
remove_if.hpp File Reference

Classes

struct  boost::range_const_iterator< ::ranges::v3::remove_if_view< Ts... >, ::meta::if_c<(bool)::ranges::BoundedRange< ::ranges::v3::remove_if_view< Ts... > const >()> >
 
struct  boost::range_mutable_iterator< ::ranges::v3::remove_if_view< Ts... >, ::meta::if_c<(bool)::ranges::BoundedRange< ::ranges::v3::remove_if_view< Ts... > >()> >
 
struct  boost::range_size< ::ranges::v3::remove_if_view< Ts... > >
 
struct  boost::range_size< ::ranges::v3::remove_if_view< Ts... > const >
 
struct  boost::range_value< ::ranges::v3::remove_if_view< Ts... > >
 
struct  ranges::v3::remove_if_view< Rng, Pred >
 

Namespaces

 ranges
 unstable_remove have O(1) complexity for each element remove, unlike remove O(n) [for worst case] Each erased element overwritten (moved in) with last one.
 

Typedefs

using ranges::v3::view::remove_if_fn = remove_if_fn_< ident >
 Given a source range, unary predicate, and optional projection, present a view of the elements that do not satisfy the predicate.
 

Variables

constexpr view< remove_if_fn > remove_if {}