all_any_none_of.md

hal::all_of

Check if all of the elements satisfy some predicate.

template <typename UnaryOp, typename... Elements>
bool all_of(UnaryOp&& predicate, Elements&&... elements);

predicate is any callable accepting a single element and returning a type convertible to bool.

hal::all

Convinience function where the predicate of all_of(...) is the identity function.

template <typename... Elements>
bool all(Elements&&... elements);

✔️ hal::reverse::all_of(...)

✔️ hal::reverse::all(...)

❌ Modifying Algorithm

hal::any_of

Check if at least one element satisfies some predicate.

template <typename UnaryOp, typename... Elements>
bool any_of(UnaryOp&& predicate, Elements&&... elements);

predicate is any callable accepting a single element and returning a type convertible to bool.

hal::any

Convinience function where the predicate of any_of(...) is the identity function.

template <typename... Elements>
bool any(Elements&&... elements);

✔️ hal::reverse::any_of(...)

✔️ hal::reverse::any(...)

❌ Modifying Algorithm

hal::none_of

Check if none of the elements satisfy some predicate.

template <typename UnaryOp, typename... Elements>
bool none_of(UnaryOp&& predicate, Elements&&... elements);

predicate is any callable accepting a single element and returning a type convertible to bool.

hal::none

Convinience function where the predicate of none_of(...) is the identity function.

template <typename... Elements>
bool none(Elements&&... elements);

✔️ hal::reverse::none_of(...)

✔️ hal::reverse::none(...)

❌ Modifying Algorithm

Examples