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 {} |