diff options
| author | Andrey Khalyavin <[email protected]> | 2022-04-07 08:28:36 +0300 |
|---|---|---|
| committer | Andrey Khalyavin <[email protected]> | 2022-04-07 08:28:36 +0300 |
| commit | 3bd25da701a5b6de40acbea240354462348803d6 (patch) | |
| tree | 0687f8765d3b10e90a89ccc46536591807553e5c /contrib/libs/cxxsupp/libcxx/include/algorithm | |
| parent | 93e82f85e8f923ac94b49a5e520ada8783c45e6a (diff) | |
Update libc++ to 8d23b742 (11 Jan 2022).
Notable changes:
* implement in_out_result in ranges
* implement uninitialized_copy{,_n} and uninitialized_move{,_n} in ranges
* use _LIBCPP_DEBUG_ASSERT in list
* alphabetize header includes.
* use Fuchsia-native monotonic clock for std::chrono::steady_clock
* properly handle specializations of std::is_placeholder
* add __cpo namespace to ranges::{advance, next, prev} for ADL reasons
* add template lerp function
ref:1cc313d57e8757bed1d0950624d0c3a2b7da8a4f
Diffstat (limited to 'contrib/libs/cxxsupp/libcxx/include/algorithm')
| -rw-r--r-- | contrib/libs/cxxsupp/libcxx/include/algorithm | 13 |
1 files changed, 10 insertions, 3 deletions
diff --git a/contrib/libs/cxxsupp/libcxx/include/algorithm b/contrib/libs/cxxsupp/libcxx/include/algorithm index 7dc8927d266..5f77952a9d8 100644 --- a/contrib/libs/cxxsupp/libcxx/include/algorithm +++ b/contrib/libs/cxxsupp/libcxx/include/algorithm @@ -641,6 +641,12 @@ template <class BidirectionalIterator, class Compare> constexpr bool // constexpr in C++20 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp); +namespace ranges { +// [algorithms.results], algorithm result types +template<class InputIterator, class OutputIterator> + struct in_out_result; +} + } // std */ @@ -673,8 +679,8 @@ template <class BidirectionalIterator, class Compare> #include <__algorithm/count_if.h> #include <__algorithm/equal.h> #include <__algorithm/equal_range.h> -#include <__algorithm/fill_n.h> #include <__algorithm/fill.h> +#include <__algorithm/fill_n.h> #include <__algorithm/find.h> #include <__algorithm/find_end.h> #include <__algorithm/find_first_of.h> @@ -682,9 +688,10 @@ template <class BidirectionalIterator, class Compare> #include <__algorithm/find_if_not.h> #include <__algorithm/for_each.h> #include <__algorithm/for_each_n.h> -#include <__algorithm/generate_n.h> #include <__algorithm/generate.h> +#include <__algorithm/generate_n.h> #include <__algorithm/half_positive.h> +#include <__algorithm/in_out_result.h> #include <__algorithm/includes.h> #include <__algorithm/inplace_merge.h> #include <__algorithm/is_heap.h> @@ -747,8 +754,8 @@ template <class BidirectionalIterator, class Compare> #include <__algorithm/stable_sort.h> #include <__algorithm/swap_ranges.h> #include <__algorithm/transform.h> -#include <__algorithm/unique_copy.h> #include <__algorithm/unique.h> +#include <__algorithm/unique_copy.h> #include <__algorithm/unwrap_iter.h> #include <__algorithm/upper_bound.h> |