Reference DocumentationΒΆ
- Library Configuration
- Concepts
- Type aliases
- Concepts
cursor
regular_cursor
ordered_cursor
sequence
multipass_sequence
bidirectional_sequence
random_access_sequence
bounded_sequence
sized_sequence
contiguous_sequence
infinite_sequence
read_only_sequence
const_iterable_sequence
writable_sequence_of
element_swappable_with
ordering_invocable
weak_ordering_for
- Sequence Access
- Adaptors
adjacent
adjacent_filter
adjacent_map
cache_last
cartesian_power
cartesian_power_map
cartesian_product
cartesian_product_map
chain
chunk
chunk_by
cursors
cycle
dedup
drop
drop_while
filter
filter_deref
filter_map
flatten
flatten_with
map
mask
pairwise
pairwise_map
prescan
read_only
reverse
scan
scan_first
set_difference
set_intersection
set_symmetric_difference
set_union
slide
split
stride
take
take_while
unchecked
zip
zip_map
- Algorithms
all
any
compare
contains
count
count_eq
count_if
ends_with
equal
fill
find
find_if
find_if_not
find_max
find_min
find_minmax
fold
fold_first
for_each
for_each_while
inplace_reverse
max
min
minmax
none
output_to
product
search
sort
starts_with
sum
swap_elements
to
write_to
zip_find_if
zip_fold
zip_for_each
zip_for_each_while
- Factories