fix test files in deque.special

Author: changkhothuychung

libcxx/test/std/containers/sequences/deque/deque.special/copy.pass.cpp

@@ -76,7 +76,7 @@ void testN(int start, int N) {
   LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
 }
 
-int main(int, char**) {
+TEST_CONSTEXPR_CXX26 bool tests() {
   {
     int rng[]   = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
     const int N = sizeof(rng) / sizeof(rng[0]);
@@ -93,6 +93,14 @@ int main(int, char**) {
         testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
   }
 #endif
+  return true;
+}
+
+int main(int, char**) {
+  tests();
+#if TEST_STD_VER >= 26
+  static_assert(tests());
+#endif
 
   return 0;
 }

libcxx/test/std/containers/sequences/deque/deque.special/copy_backward.pass.cpp

@@ -75,7 +75,7 @@ void testN(int start, int N) {
   LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
 }
 
-int main(int, char**) {
+TEST_CONSTEXPR_CXX26 bool tests() {
   {
     int rng[]   = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
     const int N = sizeof(rng) / sizeof(rng[0]);
@@ -92,6 +92,14 @@ int main(int, char**) {
         testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
   }
 #endif
+  return true;
+}
+
+int main(int, char**) {
+  tests();
+#if TEST_STD_VER >= 26
+  static_assert(tests());
+#endif
 
   return 0;
 }

libcxx/test/std/containers/sequences/deque/deque.special/move.pass.cpp

@@ -75,7 +75,7 @@ void testN(int start, int N) {
   LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
 }
 
-int main(int, char**) {
+TEST_CONSTEXPR_CXX26 bool tests() {
   {
     int rng[]   = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
     const int N = sizeof(rng) / sizeof(rng[0]);
@@ -92,6 +92,14 @@ int main(int, char**) {
         testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
   }
 #endif
+  return true;
+}
+
+int main(int, char**) {
+  tests();
+#if TEST_STD_VER >= 26
+  static_assert(tests());
+#endif
 
   return 0;
 }

libcxx/test/std/containers/sequences/deque/deque.special/move_backward.pass.cpp

@@ -75,7 +75,7 @@ void testN(int start, int N) {
   LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
 }
 
-int main(int, char**) {
+TEST_CONSTEXPR_CXX26 bool tests() {
   {
     int rng[]   = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
     const int N = sizeof(rng) / sizeof(rng[0]);
@@ -92,6 +92,14 @@ int main(int, char**) {
         testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]);
   }
 #endif
+  return true;
+}
+
+int main(int, char**) {
+  tests();
+#if TEST_STD_VER >= 26
+  static_assert(tests());
+#endif
 
   return 0;
 }

libcxx/test/std/containers/sequences/deque/deque.special/swap.pass.cpp

@@ -52,7 +52,7 @@ void testN(int start, int N, int M) {
   LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2_save));
 }
 
-int main(int, char**) {
+TEST_CONSTEXPR_CXX26 bool tests() {
   {
     int rng[]   = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
     const int N = sizeof(rng) / sizeof(rng[0]);
@@ -113,6 +113,14 @@ int main(int, char**) {
     LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));
   }
 #endif
+  return true;
+}
+
+int main(int, char**) {
+  tests();
+#if TEST_STD_VER >= 26
+  static_assert(tests());
+#endif
 
   return 0;
 }

libcxx/test/std/containers/sequences/deque/deque.special/swap_noexcept.pass.cpp

@@ -52,7 +52,7 @@ struct some_alloc2 {
   typedef std::true_type is_always_equal;
 };
 
-int main(int, char**) {
+TEST_CONSTEXPR_CXX26 bool test() {
   {
     typedef std::deque<MoveOnly> C;
     static_assert(noexcept(swap(std::declval<C&>(), std::declval<C&>())), "");
@@ -83,6 +83,14 @@ int main(int, char**) {
     static_assert(noexcept(swap(std::declval<C&>(), std::declval<C&>())), "");
   }
 #endif
+  return true;
+}
+
+int main(int, char**) {
+  test();
+#if TEST_STD_VER >= 26
+  static_assert(test());
+#endif
 
   return 0;
 }