std::ranges::rotate - cppreference.com

en.cppreference.com/w/cpp/algorithm/ranges/rotate     2025-02-11T00:00:00.0000000
The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is: . Explicit template argument lists cannot be specified when calling any of them. None of them are visible to argument-dependent lookup.; When any of them are found by normal unqualified lookup as the name to the left of the function-call operator, argument-dependent lookup ...

Constrained algorithms (since C++20) - cppreference.com

en.cppreference.com/w/cpp/algorithm/ranges     2024-11-27T00:00:00.0000000
C++20 provides constrained versions of most algorithms in the namespace std::ranges.In these algorithms, a range can be specified as either an iterator-sentinel pair or as a single range argument, and projections and pointer-to-member callables are supported. Additionally, the return types of most algorithms have been changed to return all potentially useful information computed during the ...

Algorithms library - cppreference.com

en.cppreference.com/w/cpp/algorithm     2024-05-20T00:00:00.0000000
Constrained algorithms (since C++20) C++20 provides constrained versions of most algorithms in the namespace std::ranges.In these algorithms, a range can be specified as either an iterator-sentinel pair or as a single range argument, and projections and pointer-to-member callables are supported. Additionally, the return types of most algorithms have been changed to return all potentially ...

Ranges library (since C++20) - cppreference.com

en.cppreference.com/w/cpp/ranges     2024-12-12T00:00:00.0000000
The ranges library includes range algorithms, which are applied to ranges eagerly, and range adaptors, which are applied to views lazily. Adaptors can be composed into pipelines, so that their actions take place as the view is iterated. ... __cpp_lib_ranges_to_container: 202202L (C++23) ranges:: to __cpp_lib_ranges_zip: 202110L (C++23) ranges ...

std::rotate - cppreference.com

en.cppreference.com/w/cpp/algorithm/rotate     2025-02-10T00:00:00.0000000
1) Performs a left rotation on a range of elements. Specifically, std::rotate swaps the elements in the range [ first , last ) in such a way that the elements in [ first , middle ) are placed after the elements in [ middle , last ) while the orders of the elements in both ranges are preserved.

std::ranges:: rotate_copy, std::ranges:: rotate_copy_result - Reference

en.cppreference.com/w/cpp/algorithm/ranges/rotate_copy     2025-02-26T00:00:00.0000000
The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is: . Explicit template argument lists cannot be specified when calling any of them. None of them are visible to argument-dependent lookup.; When any of them are found by normal unqualified lookup as the name to the left of the function-call operator, argument-dependent lookup ...

std::rotate_copy - cppreference.com

en.cppreference.com/w/cpp/algorithm/rotate_copy     2025-02-26T00:00:00.0000000
Return value. Output iterator to the element past the last element copied. [] ComplexitExactly std:: distance (first, last) assignments. [] ExceptionThe overload with a template parameter named ExecutionPolicy reports errors as follows: . If execution of a function invoked as part of the algorithm throws an exception and ExecutionPolicy is one of the standard policies, std::terminate is called.

std::ranges:: move, std::ranges:: move_result - Reference

en.cppreference.com/w/cpp/algorithm/ranges/move     2025-02-11T00:00:00.0000000
The elements in the moved-from range will still contain valid values of the appropriate type, but not necessarily the same values as before the move.. The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is: . Explicit template argument lists cannot be specified when calling any of them.

std::ranges::copy, std::ranges::copy_if, std::ranges::copy ... - Reference

en.cppreference.com/w/cpp/algorithm/ranges/copy     2023-08-28T00:00:00.0000000
Notes. In practice, implementations of ranges::copy avoid multiple assignments and use bulk copy functions such as std::memmove if the value type is TriviallyCopyable and the iterator types satisfy contiguous_iterator.. When copying overlapping ranges, ranges::copy is appropriate when copying to the left (beginning of the destination range is outside the source range) while ranges::copy ...

std::ranges::unique - cppreference.com

en.cppreference.com/w/cpp/algorithm/ranges/unique     2025-02-11T00:00:00.0000000
Return value. Returns {ret, last}, where ret is a past-the-end iterator for the new end of the range. [] ComplexitFor nonempty ranges, exactly ranges:: distance (first, last)-1 applications of the corresponding predicate comp and no more that twice as many applications of any projection proj. [] NoteRemoving is done by shifting (by means of move assignment) the elements in the range in such a ...
Feedback