Range-adapted Sequence algorithms.
|
Namespaces |
namespace | rangelib |
Functions |
template<typename S, typename T> |
T | sr_accumulate (S &s, T val) |
template<typename S, typename T, typename P> |
T | sr_accumulate (S &s, T val, P pred) |
template<typename S, typename O> |
O | sr_copy (S &s, O o) |
template<typename S, typename O, typename P> |
O | sr_copy_if (S &s, O o, P pred) |
template<typename S, typename V> |
size_t | sr_count (S &s, V const &val) |
template<typename S, typename P> |
size_t | sr_count_if (S &s, P pred) |
template<typename S> |
ss_ptrdiff_t | sr_distance (S &s) |
template<typename S1, typename S2> |
bool | sr_equal (S1 &s1, S2 &s2) |
template<typename S, typename T> |
bool | sr_exists (S &s, T const &val) |
template<typename S, typename P> |
bool | sr_exists_if (S &s, P pred) |
template<typename S, typename T> |
void | sr_fill (S &s, T const &val) |
template<typename S, typename N, typename T> |
void | sr_fill_n (S &s, N n, T const &val) |
template<typename S, typename F> |
F | sr_for_each (S &s, F f) |
template<typename S, typename F> |
void | sr_generate (S &s, F f) |
template<typename S> |
ss_typename_type_ret_k
S::value_type | sr_max_element (S &s) |
template<typename S, typename F> |
ss_typename_type_ret_k
S::value_type | sr_max_element (S &s, F f) |
template<typename S> |
ss_typename_type_ret_k
S::value_type | sr_min_element (S &s) |
template<typename S, typename F> |
ss_typename_type_ret_k
S::value_type | sr_min_element (S &s, F f) |
template<typename S, typename T> |
void | sr_replace (S &s, T oldVal, T newVal) |
template<typename S, typename P, typename T> |
void | sr_replace_if (S &s, P pred, T newVal) |