Table 1: Range algorithms currently provided by the STLSoft implementation of RangeLib.
| Algorithm |
STL equivalent |
Notional |
Iterable |
Indirect |
| r_accumulate() |
std::accumulate() |
Yes |
Yes |
Yes |
| r_copy() |
std::copy() |
Yes |
Yes |
Yes |
| r_count() |
std::count() |
Yes |
Yes |
Yes |
| r_count_if() |
std::count() |
Yes |
Yes |
Yes |
| r_distance() |
std::distance() |
Yes |
Yes |
Yes |
| r_equals() |
std::equals() |
Yes |
Yes |
- |
| r_exists() |
- |
Yes |
Yes |
Yes |
| r_exist_if() |
- |
Yes |
Yes |
Yes |
| r_fill() |
std::fill() |
- |
Yes |
- |
| r_fill_n() |
std::fill_n() |
- |
Yes |
- |
| r_find() |
std::find() |
Yes |
Yes |
- |
| r_find_if() |
std::find_if() |
Yes |
Yes |
- |
| r_for_each() |
std::for_each() |
Yes |
Yes |
Yes |
| r_generate() |
std::generate() |
- |
Yes |
- |
| r_max_element() |
std::max_element() |
Yes |
Yes |
Yes |
| r_min_element() |
std::min_element() |
Yes |
Yes |
Yes |
| r_replace() |
std::replace() |
- |
Yes |
Yes |
| r_replace_if() |
std::replace_if() |
- |
Yes |
Yes |