Skip to content

[libc++] Support sorting consteval-only ranges #134623

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 10 commits into
base: main
Choose a base branch
from
Open

[libc++] Support sorting consteval-only ranges #134623

Show file tree
Hide file tree
Changes from 5 commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
d4f2563
[libc++] Support sorting consteval-only ranges
frederick-vs-ja Apr 7, 2025
9625fe9
Create `test_consteval_iterators.h` and include it
frederick-vs-ja Apr 11, 2025
421e46e
Remove workaround for other standard libraries
frederick-vs-ja Apr 11, 2025
3aa6f3e
Merge branch 'main' into sort-consteval-iter
frederick-vs-ja Apr 11, 2025
2ce3060
Merge branch 'main' into sort-consteval-iter
frederick-vs-ja Apr 15, 2025
5d68c59
Merge branch 'main' into sort-consteval-iter
frederick-vs-ja Sep 10, 2025
90d2ac2
Avoid violating precondition of `__bit_log2`
frederick-vs-ja Sep 10, 2025
c189d67
Fix typo
frederick-vs-ja Sep 10, 2025
6cd3e63
Eliminate `__sort` branches and fix uses of `_AlgPolicy`
frederick-vs-ja Oct 11, 2025
f06b9cc
Merge branch 'main' into sort-consteval-iter
frederick-vs-ja Oct 11, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
107 changes: 69 additions & 38 deletions libcxx/include/__algorithm/sort.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@
#include <__bit/countl.h>
#include <__bit/countr.h>
#include <__config>
#include <__cstddef/ptrdiff_t.h>
#include <__cstddef/size_t.h>
#include <__debug_utils/randomize_range.h>
#include <__debug_utils/strict_weak_ordering_check.h>
#include <__functional/operations.h>
Expand Down Expand Up @@ -140,7 +142,7 @@ template <class,
class _Compare,
class _RandomAccessIterator,
__enable_if_t<__use_branchless_sort<_Compare, _RandomAccessIterator>, int> = 0>
inline _LIBCPP_HIDE_FROM_ABI void
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__sort4(_RandomAccessIterator __x1,
_RandomAccessIterator __x2,
_RandomAccessIterator __x3,
Expand All @@ -157,7 +159,7 @@ template <class _AlgPolicy,
class _Compare,
class _RandomAccessIterator,
__enable_if_t<!__use_branchless_sort<_Compare, _RandomAccessIterator>, int> = 0>
inline _LIBCPP_HIDE_FROM_ABI void
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__sort4(_RandomAccessIterator __x1,
_RandomAccessIterator __x2,
_RandomAccessIterator __x3,
Expand All @@ -182,7 +184,7 @@ template <class _AlgPolicy,
class _Compare,
class _RandomAccessIterator,
__enable_if_t<__use_branchless_sort<_Compare, _RandomAccessIterator>, int> = 0>
inline _LIBCPP_HIDE_FROM_ABI void
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__sort5(_RandomAccessIterator __x1,
_RandomAccessIterator __x2,
_RandomAccessIterator __x3,
Expand All @@ -201,7 +203,7 @@ template <class _AlgPolicy,
class _Compare,
class _RandomAccessIterator,
__enable_if_t<!__use_branchless_sort<_Compare, _RandomAccessIterator>, int> = 0>
inline _LIBCPP_HIDE_FROM_ABI void
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__sort5(_RandomAccessIterator __x1,
_RandomAccessIterator __x2,
_RandomAccessIterator __x3,
Expand Down Expand Up @@ -240,7 +242,7 @@ __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last,
// Sort the iterator range [__first, __last) using the comparator __comp using
// the insertion sort algorithm.
template <class _AlgPolicy, class _Compare, class _BidirectionalIterator>
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 void
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
using _Ops = _IterOps<_AlgPolicy>;

Expand Down Expand Up @@ -270,7 +272,7 @@ __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last,
// Assumes that there is an element in the position (__first - 1) and that each
// element in the input range is greater or equal to the element at __first - 1.
template <class _AlgPolicy, class _Compare, class _RandomAccessIterator>
_LIBCPP_HIDE_FROM_ABI void
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__insertion_sort_unguarded(_RandomAccessIterator const __first, _RandomAccessIterator __last, _Compare __comp) {
using _Ops = _IterOps<_AlgPolicy>;
typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
Expand Down Expand Up @@ -298,7 +300,7 @@ __insertion_sort_unguarded(_RandomAccessIterator const __first, _RandomAccessIte
}

template <class _AlgPolicy, class _Comp, class _RandomAccessIterator>
_LIBCPP_HIDE_FROM_ABI bool
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
__insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Comp __comp) {
using _Ops = _IterOps<_AlgPolicy>;

Expand Down Expand Up @@ -352,7 +354,7 @@ __insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator
}

template <class _AlgPolicy, class _RandomAccessIterator>
inline _LIBCPP_HIDE_FROM_ABI void __swap_bitmap_pos(
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __swap_bitmap_pos(
_RandomAccessIterator __first, _RandomAccessIterator __last, uint64_t& __left_bitset, uint64_t& __right_bitset) {
using _Ops = _IterOps<_AlgPolicy>;
typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type difference_type;
Expand All @@ -370,7 +372,7 @@ inline _LIBCPP_HIDE_FROM_ABI void __swap_bitmap_pos(
template <class _Compare,
class _RandomAccessIterator,
class _ValueType = typename iterator_traits<_RandomAccessIterator>::value_type>
inline _LIBCPP_HIDE_FROM_ABI void
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__populate_left_bitset(_RandomAccessIterator __first, _Compare __comp, _ValueType& __pivot, uint64_t& __left_bitset) {
// Possible vectorization. With a proper "-march" flag, the following loop
// will be compiled into a set of SIMD instructions.
Expand All @@ -386,7 +388,7 @@ __populate_left_bitset(_RandomAccessIterator __first, _Compare __comp, _ValueTyp
template <class _Compare,
class _RandomAccessIterator,
class _ValueType = typename iterator_traits<_RandomAccessIterator>::value_type>
inline _LIBCPP_HIDE_FROM_ABI void
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__populate_right_bitset(_RandomAccessIterator __lm1, _Compare __comp, _ValueType& __pivot, uint64_t& __right_bitset) {
// Possible vectorization. With a proper "-march" flag, the following loop
// will be compiled into a set of SIMD instructions.
Expand All @@ -403,7 +405,7 @@ template <class _AlgPolicy,
class _Compare,
class _RandomAccessIterator,
class _ValueType = typename iterator_traits<_RandomAccessIterator>::value_type>
inline _LIBCPP_HIDE_FROM_ABI void __bitset_partition_partial_blocks(
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __bitset_partition_partial_blocks(
_RandomAccessIterator& __first,
_RandomAccessIterator& __lm1,
_Compare __comp,
Expand Down Expand Up @@ -450,7 +452,7 @@ inline _LIBCPP_HIDE_FROM_ABI void __bitset_partition_partial_blocks(
}

template <class _AlgPolicy, class _RandomAccessIterator>
inline _LIBCPP_HIDE_FROM_ABI void __swap_bitmap_pos_within(
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __swap_bitmap_pos_within(
_RandomAccessIterator& __first, _RandomAccessIterator& __lm1, uint64_t& __left_bitset, uint64_t& __right_bitset) {
using _Ops = _IterOps<_AlgPolicy>;
typedef typename std::iterator_traits<_RandomAccessIterator>::difference_type difference_type;
Expand Down Expand Up @@ -491,7 +493,7 @@ inline _LIBCPP_HIDE_FROM_ABI void __swap_bitmap_pos_within(
// __bitset_partition uses bitsets for storing outcomes of the comparisons
// between the pivot and other elements.
template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
_LIBCPP_HIDE_FROM_ABI std::pair<_RandomAccessIterator, bool>
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 std::pair<_RandomAccessIterator, bool>
__bitset_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
using _Ops = _IterOps<_AlgPolicy>;
typedef typename std::iterator_traits<_RandomAccessIterator>::value_type value_type;
Expand Down Expand Up @@ -583,7 +585,7 @@ __bitset_partition(_RandomAccessIterator __first, _RandomAccessIterator __last,
// the provided range is already sorted, false otherwise. We assume that the
// length of the range is at least three elements.
template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
_LIBCPP_HIDE_FROM_ABI std::pair<_RandomAccessIterator, bool>
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 std::pair<_RandomAccessIterator, bool>
__partition_with_equals_on_right(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
using _Ops = _IterOps<_AlgPolicy>;
typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
Expand Down Expand Up @@ -651,7 +653,7 @@ __partition_with_equals_on_right(_RandomAccessIterator __first, _RandomAccessIte
// Similar to the above function. Elements equivalent to the pivot are put to
// the left of the pivot. Returns the iterator to the pivot element.
template <class _AlgPolicy, class _RandomAccessIterator, class _Compare>
_LIBCPP_HIDE_FROM_ABI _RandomAccessIterator
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _RandomAccessIterator
__partition_with_equals_on_left(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) {
using _Ops = _IterOps<_AlgPolicy>;
typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
Expand Down Expand Up @@ -714,11 +716,12 @@ __partition_with_equals_on_left(_RandomAccessIterator __first, _RandomAccessIter
// The implementation is partly based on Orson Peters' pattern-defeating
// quicksort, published at: <https://github.com/orlp/pdqsort>.
template <class _AlgPolicy, class _Compare, class _RandomAccessIterator, bool _UseBitSetPartition>
void __introsort(_RandomAccessIterator __first,
_RandomAccessIterator __last,
_Compare __comp,
typename iterator_traits<_RandomAccessIterator>::difference_type __depth,
bool __leftmost = true) {
_LIBCPP_CONSTEXPR_SINCE_CXX20 void
__introsort(_RandomAccessIterator __first,
_RandomAccessIterator __last,
_Compare __comp,
typename iterator_traits<_RandomAccessIterator>::difference_type __depth,
bool __leftmost = true) {
using _Ops = _IterOps<_AlgPolicy>;
typedef typename iterator_traits<_RandomAccessIterator>::difference_type difference_type;
using _Comp_ref = __comp_ref_type<_Compare>;
Expand Down Expand Up @@ -895,30 +898,63 @@ using __sort_is_specialized_in_library _LIBCPP_NODEBUG = __is_any_of<
long double>;

template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::value, int> = 0>
_LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, __less<>&) {
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __sort_dispatch(_Type* __first, _Type* __last, __less<>&) {
#if _LIBCPP_STD_VER >= 20
if (std::is_constant_evaluated()) {
auto __depth_limit = static_cast<ptrdiff_t>(2 * std::__bit_log2(static_cast<size_t>(__last - __first)));
std::__introsort<_ClassicAlgPolicy, ranges::less, _Type*, __use_branchless_sort<ranges::less, _Type*>>(
__first, __last, ranges::less{}, __depth_limit);
} else
#endif
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't understand this. How is this changing anything compared to the general __libcpp_is_constant_evaluated? IIUC you claim this has got something to do with instantiating an undefined template, but this is instantiating __sort exactly the same as the old code.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I guarded this with _LIBCPP_STD_VER >= 20 because ranges::less is used in __sort and I wanted the same operations to be performed. And given _LIBCPP_STD_VER >= 20 is required, IMO its a bit better to use std::is_constant_evaluated. (Or even C++23 if consteval?)

IIUC you claim this has got something to do with instantiating an undefined template, but this is instantiating __sort exactly the same as the old code.

No, the changes in __sort_dispatch didn't change instantiation of __sort. I just attempted to add constexpr-friend branches to them.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Then please revert these changes. It's not at all obvious to me what changes actually fix anything (and FWIW I'm not convinced these changes are a good idea).

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hmm, I think the changes here "fix" an ironic inconsistency.

Some functions needs to be constexpr to make instantiation sort involving consteval-only operations well-formed, while without these changes they are not even called in constant evaluation. If we keep these functions not called in constant evaluation, maybe someone will get confused and attempt to remove constexpr in the future.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I don't understand. How does it make a difference whether some functions that aren't constexpr are instantiated or not? How does it not make a difference when they can't be instantiated because they're not defined?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

How does it not make a difference when they can't be instantiated because they're not defined?

No, the error is not about undefined functions. It is about functions templates that are defined but not constexpr (i.e. __introsort etc. in the status quo).

I don't understand. How does it make a difference whether some functions that aren't constexpr are instantiated or not?

The expression __last - __first inside __introsort can't be a constant expression because __first and __last are function parameters. When the operator- for the iterator is a consteval function and __introsort is not constexpr, __last - __first would be required to be a constant expression, which makes instantiation of __introsort ill-formed.

Marking __introsort constexpr makes the __introsort specialization gets immediate-escalated and becomes an immediate function, and thus its instantiation can be well-formed.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

How does it not make a difference when they can't be instantiated because they're not defined?

No, the error is not about undefined functions. It is about functions templates that are defined but not constexpr (i.e. __introsort etc. in the status quo).

I don't understand. How does it make a difference whether some functions that aren't constexpr are instantiated or not?

The expression __last - __first inside __introsort can't be a constant expression because __first and __last are function parameters. When the operator- for the iterator is a consteval function and __introsort is not constexpr, __last - __first would be required to be a constant expression, which makes instantiation of __introsort ill-formed.

Marking __introsort constexpr makes the __introsort specialization gets immediate-escalated and becomes an immediate function, and thus its instantiation can be well-formed.

That is quite unfortunate. IMO it shouldn't make a difference whether we define a function or not. Anyways, can't we just replace the if (__libcpp_is_constant_evaluated()) with if consteval? That would make the diff significantly smaller.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Anyways, can't we just replace the if (__libcpp_is_constant_evaluated()) with if consteval?

This doesn't work, because instantiation of __introsort is still triggered. AFAIK __introsort needs to be instantiated for most iterator types, and there's no mechanism to avoid instantiation of some function only during constant evaluation.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

OK, IMO this is CWG issue territory. It can't be that consteval goes this viral. This basically means that we can't have non-constexpr code in constexpr functions, which is simply not acceptable.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

OK, IMO this is CWG issue territory. It can't be that consteval goes this viral. This basically means that we can't have non-constexpr code in constexpr functions, which is simply not acceptable.

The crux is the combination of non-constant consteval operations and non-constexpr functions. Currently non-constexpr functions, along with non-template non-lambda non-defaulted constexpr functions, are never immediate-escalated. Perhaps it's also possible to escalate some non-constexpr functions to "error-on-call-only" things.

However, is it a bad thing to use __introsort in constant evaluation? If not, it seems plausible to mark it and its depended functions _LIBCPP_CONSTEXPR_SINCE_CXX20.

{
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
}
}

template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::value, int> = 0>
_LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, less<_Type>&) {
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __sort_dispatch(_Type* __first, _Type* __last, less<_Type>&) {
#if _LIBCPP_STD_VER >= 20
if (std::is_constant_evaluated()) {
auto __depth_limit = static_cast<ptrdiff_t>(2 * std::__bit_log2(static_cast<size_t>(__last - __first)));
std::__introsort<_ClassicAlgPolicy, ranges::less, _Type*, __use_branchless_sort<ranges::less, _Type*>>(
__first, __last, ranges::less{}, __depth_limit);
} else
#endif
{
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
}
}

#if _LIBCPP_STD_VER >= 14
template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::value, int> = 0>
_LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, less<>&) {
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void __sort_dispatch(_Type* __first, _Type* __last, less<>&) {
# if _LIBCPP_STD_VER >= 20
if (std::is_constant_evaluated()) {
auto __depth_limit = static_cast<ptrdiff_t>(2 * std::__bit_log2(static_cast<size_t>(__last - __first)));
std::__introsort<_ClassicAlgPolicy, ranges::less, _Type*, __use_branchless_sort<ranges::less, _Type*>>(
__first, __last, ranges::less{}, __depth_limit);
} else
# endif
{
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
}
}
#endif

#if _LIBCPP_STD_VER >= 20
template <class _AlgPolicy, class _Type, __enable_if_t<__sort_is_specialized_in_library<_Type>::value, int> = 0>
_LIBCPP_HIDE_FROM_ABI void __sort_dispatch(_Type* __first, _Type* __last, ranges::less&) {
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
_LIBCPP_HIDE_FROM_ABI constexpr void __sort_dispatch(_Type* __first, _Type* __last, ranges::less&) {
if (std::is_constant_evaluated()) {
auto __depth_limit = static_cast<ptrdiff_t>(2 * std::__bit_log2(static_cast<size_t>(__last - __first)));
std::__introsort<_ClassicAlgPolicy, ranges::less, _Type*, __use_branchless_sort<ranges::less, _Type*>>(
__first, __last, ranges::less{}, __depth_limit);
} else {
__less<_Type> __comp;
std::__sort<__less<_Type>&, _Type*>(__first, __last, __comp);
}
}
#endif

Expand All @@ -927,12 +963,7 @@ inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 void
__sort_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, _Comp& __comp) {
std::__debug_randomize_range<_AlgPolicy>(__first, __last);

if (__libcpp_is_constant_evaluated()) {
std::__partial_sort<_AlgPolicy>(
std::__unwrap_iter(__first), std::__unwrap_iter(__last), std::__unwrap_iter(__last), __comp);
} else {
std::__sort_dispatch<_AlgPolicy>(std::__unwrap_iter(__first), std::__unwrap_iter(__last), __comp);
}
std::__sort_dispatch<_AlgPolicy>(std::__unwrap_iter(__first), std::__unwrap_iter(__last), __comp);
std::__check_strict_weak_ordering_sorted(std::__unwrap_iter(__first), std::__unwrap_iter(__last), __comp);
}

Expand Down
6 changes: 3 additions & 3 deletions libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ranges.sort.pass.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,6 +29,7 @@

#include "almost_satisfies_types.h"
#include "test_iterators.h"
#include "test_consteval_iterators.h"

// SFINAE tests.

Expand Down Expand Up @@ -115,6 +116,8 @@ constexpr void test_iterators() {
test_iterators_1<random_access_iterator<int*>>();
test_iterators_1<contiguous_iterator<int*>>();
test_iterators_1<int*>();
test_iterators_1<consteval_random_access_iterator<int*>>();
test_iterators_1<consteval_contiguous_iterator<int*>>();
}

constexpr bool test() {
Expand Down Expand Up @@ -187,8 +190,6 @@ constexpr bool test() {
[[maybe_unused]] std::same_as<std::ranges::dangling> decltype(auto) result = std::ranges::sort(std::array{1, 2, 3});
}

// TODO: Enable the tests once the implementation switched to use iter_move/iter_swap
/*
{ // ProxyIterator
{
std::array in = {2, 1, 3};
Expand All @@ -205,7 +206,6 @@ constexpr bool test() {
assert((in == std::array{1, 2, 3}));
}
}
*/

return true;
}
Expand Down
32 changes: 32 additions & 0 deletions libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/sort_constexpr.pass.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,6 +19,7 @@

#include "test_macros.h"
#include "test_iterators.h"
#include "test_consteval_iterators.h"
#include "MoveOnly.h"

const int LargeN = 128;
Expand Down Expand Up @@ -112,6 +113,37 @@ int main(int, char**)
static_assert(test_pointers<17, int, int**>());
static_assert(test_pointers<17, int, random_access_iterator<int**>>());
static_assert(test_pointers<17, int, contiguous_iterator<int**>>());

// Test consteval-only operations
(void)test<7, int, consteval_random_access_iterator<int*>>();
(void)test<7, int, consteval_contiguous_iterator<int*>>();
(void)test<LargeN, int, consteval_random_access_iterator<int*>>();
(void)test<LargeN, int, consteval_contiguous_iterator<int*>>();
(void)test<7, MoveOnly, consteval_random_access_iterator<MoveOnly*>>();
(void)test<7, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>();
(void)test<LargeN, MoveOnly, consteval_random_access_iterator<MoveOnly*>>();
(void)test<LargeN, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>();
(void)test_pointers<17, char, consteval_random_access_iterator<char**>>();
(void)test_pointers<17, char, consteval_contiguous_iterator<char**>>();
(void)test_pointers<17, const char, consteval_random_access_iterator<const char**>>();
(void)test_pointers<17, const char, consteval_contiguous_iterator<const char**>>();
(void)test_pointers<17, int, consteval_random_access_iterator<int**>>();
(void)test_pointers<17, int, consteval_contiguous_iterator<int**>>();

static_assert(test<7, int, consteval_random_access_iterator<int*>>());
static_assert(test<7, int, consteval_contiguous_iterator<int*>>());
static_assert(test<LargeN, int, consteval_random_access_iterator<int*>>());
static_assert(test<LargeN, int, consteval_contiguous_iterator<int*>>());
static_assert(test<7, MoveOnly, consteval_random_access_iterator<MoveOnly*>>());
static_assert(test<7, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>());
static_assert(test<LargeN, MoveOnly, consteval_random_access_iterator<MoveOnly*>>());
static_assert(test<LargeN, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>());
static_assert(test_pointers<17, char, consteval_random_access_iterator<char**>>());
static_assert(test_pointers<17, char, consteval_contiguous_iterator<char**>>());
static_assert(test_pointers<17, const char, consteval_random_access_iterator<const char**>>());
static_assert(test_pointers<17, const char, consteval_contiguous_iterator<const char**>>());
static_assert(test_pointers<17, int, consteval_random_access_iterator<int**>>());
static_assert(test_pointers<17, int, consteval_contiguous_iterator<int**>>());
#endif

return 0;
Expand Down
32 changes: 32 additions & 0 deletions libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/sort_constexpr_comp.pass.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,6 +20,7 @@

#include "test_macros.h"
#include "test_iterators.h"
#include "test_consteval_iterators.h"
#include "MoveOnly.h"

const int LargeN = 128;
Expand Down Expand Up @@ -113,6 +114,37 @@ int main(int, char**)
static_assert(test_pointers<17, int, int**>());
static_assert(test_pointers<17, int, random_access_iterator<int**>>());
static_assert(test_pointers<17, int, contiguous_iterator<int**>>());

// Test consteval-only operations
(void)test<7, int, consteval_random_access_iterator<int*>>();
(void)test<7, int, consteval_contiguous_iterator<int*>>();
(void)test<LargeN, int, consteval_random_access_iterator<int*>>();
(void)test<LargeN, int, consteval_contiguous_iterator<int*>>();
(void)test<7, MoveOnly, consteval_random_access_iterator<MoveOnly*>>();
(void)test<7, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>();
(void)test<LargeN, MoveOnly, consteval_random_access_iterator<MoveOnly*>>();
(void)test<LargeN, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>();
(void)test_pointers<17, char, consteval_random_access_iterator<char**>>();
(void)test_pointers<17, char, consteval_contiguous_iterator<char**>>();
(void)test_pointers<17, const char, consteval_random_access_iterator<const char**>>();
(void)test_pointers<17, const char, consteval_contiguous_iterator<const char**>>();
(void)test_pointers<17, int, consteval_random_access_iterator<int**>>();
(void)test_pointers<17, int, consteval_contiguous_iterator<int**>>();

static_assert(test<7, int, consteval_random_access_iterator<int*>>());
static_assert(test<7, int, consteval_contiguous_iterator<int*>>());
static_assert(test<LargeN, int, consteval_random_access_iterator<int*>>());
static_assert(test<LargeN, int, consteval_contiguous_iterator<int*>>());
static_assert(test<7, MoveOnly, consteval_random_access_iterator<MoveOnly*>>());
static_assert(test<7, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>());
static_assert(test<LargeN, MoveOnly, consteval_random_access_iterator<MoveOnly*>>());
static_assert(test<LargeN, MoveOnly, consteval_contiguous_iterator<MoveOnly*>>());
static_assert(test_pointers<17, char, consteval_random_access_iterator<char**>>());
static_assert(test_pointers<17, char, consteval_contiguous_iterator<char**>>());
static_assert(test_pointers<17, const char, consteval_random_access_iterator<const char**>>());
static_assert(test_pointers<17, const char, consteval_contiguous_iterator<const char**>>());
static_assert(test_pointers<17, int, consteval_random_access_iterator<int**>>());
static_assert(test_pointers<17, int, consteval_contiguous_iterator<int**>>());
#endif

return 0;
Expand Down
Loading
Loading