Avoid huge main() functions and huge arrays. Patch from STL@microsoft.com

llvm-svn: 273354

1 files changed, 3 insertions, 3 deletions

diff --git a/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_swappable_include_order.pass.cpp b/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_swappable_include_order.pass.cpp
index cfe5906fbc4..f156e7fa8bc 100644
--- a/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_swappable_include_order.pass.cpp
+++ b/libcxx/test/std/utilities/meta/meta.unary/meta.unary.prop/is_swappable_include_order.pass.cpp
@@ -15,7 +15,7 @@
 // the following definitions in this order:
 //   1) is_swappable, is_nothrow_swappable
 //   2) iter_swap, swap_ranges
-//   3) swap(T (&)[N], T(&)[N]
+//   3) swap(T (&)[N], T (&)[N])
 // This test checks that (1) and (2) see forward declarations
 // for (3).
 #include <type_traits>
@@ -27,7 +27,7 @@
 int main()
 {
     // Use a builtin type so we don't get ADL lookup.
-    typedef double T[42][50];
+    typedef double T[17][29];
     {
         LIBCPP_STATIC_ASSERT(std::__is_swappable<T>::value, "");
 #if TEST_STD_VER > 14
@@ -38,6 +38,6 @@ int main()
         T t1 = {};
         T t2 = {};
        std::iter_swap(t1, t2);
-       std::swap_ranges(t1, t1 + 42, t2);
+       std::swap_ranges(t1, t1 + 17, t2);
     }
 }