filter.hpp File Reference

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::filter_fn = remove_if_fn_< not_fn_fn >
	Given a source range, unary predicate, and optional projection, present a view of the elements that satisfy the predicate.

Variables
constexpr view< filter_fn >	filter {}