All Range Algorithms

All Range Algorithms

A compact scan page for the ranges-based algorithm family that operates directly on ranges and supports projections.

How to use this reference page

Use reference pages to confirm names, categories, nearby facilities, and the constraints that matter before writing or reviewing code.

Scan the top of the page first to identify the primary types, functions, or algorithm families involved.
Use the nearby-page links when your question is really about a companion header, related algorithm family, or broader subsystem.
Validate tricky behavior with a small compileable example before relying on memory for details like invalidation, ordering, allocation, or lifetime rules.

All Range Algorithms

Search and query algorithms

std::ranges::find
std::ranges::find_if
std::ranges::all_of, any_of, none_of
std::ranges::count, count_if
std::ranges::binary_search, lower_bound, upper_bound

Ordering and partitioning algorithms

std::ranges::sort
std::ranges::stable_sort
std::ranges::partial_sort
std::ranges::nth_element
std::ranges::partition
std::ranges::stable_partition

Copying, transforming, and removal-style algorithms

std::ranges::copy
std::ranges::move
std::ranges::transform
std::ranges::replace
std::ranges::remove
std::ranges::remove_if
std::ranges::unique

Heap and set-style algorithms

std::ranges::make_heap
std::ranges::push_heap
std::ranges::pop_heap
std::ranges::set_union
std::ranges::set_intersection

Practical rules

Prefer ranges algorithms when you already have a range object and want projection support.
Keep predicates pure unless the algorithm contract explicitly depends on mutation.
Remember that algorithms operate eagerly even when views are lazy.

Example in practice

#include <algorithm>
#include <vector>

int main() {
    std::vector<int> values{7, 2, 5, 1};
    std::ranges::make_heap(values);
    std::ranges::pop_heap(values);
    return values.back();
}