[libcxx-commits] [libcxx] [libc++][C++26] P2562R1: `constexpr` Stable Sorting (PR #110320)

[A. Jiang via libcxx-commits]

================
@@ -80,66 +80,149 @@ test_sort_()
     }
 }
 
-void
-test_larger_sorts(int N, int M)
-{
-    assert(N != 0);
-    assert(M != 0);
-    // create array length N filled with M different numbers
-    int* array = new int[N];
-    int x = 0;
-    for (int i = 0; i < N; ++i)
-    {
-        array[i] = x;
-        if (++x == M)
-            x = 0;
+template <int N, int M>
+_LIBCPP_CONSTEXPR_SINCE_CXX26 std::array<int, N> init_saw_tooth_pattern() {
----------------
frederick-vs-ja wrote:

Let's use `TEST_CONSTEXPR_CXX26` instead, ditto below.
```suggestion
TEST_CONSTEXPR_CXX26 std::array<int, N> init_saw_tooth_pattern() {
```

https://github.com/llvm/llvm-project/pull/110320