diff options
author | Marshall Clow <mclow.lists@gmail.com> | 2018-01-22 01:51:49 +0000 |
---|---|---|
committer | Marshall Clow <mclow.lists@gmail.com> | 2018-01-22 01:51:49 +0000 |
commit | ac471d6db2674ffd74a8be1680ae1e6e2bef50b8 (patch) | |
tree | 242520a1e1629245e6bab81cabe3f7f73e4c2b0e /libcxx/test/std/algorithms | |
parent | 785ae3e8c053a8f2b14851e09a27fc343c4d37dd (diff) | |
download | bcm5719-llvm-ac471d6db2674ffd74a8be1680ae1e6e2bef50b8.tar.gz bcm5719-llvm-ac471d6db2674ffd74a8be1680ae1e6e2bef50b8.zip |
Really comment out the constexpr tests.
llvm-svn: 323072
Diffstat (limited to 'libcxx/test/std/algorithms')
-rw-r--r-- | libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp | 28 | ||||
-rw-r--r-- | libcxx/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp | 32 |
2 files changed, 30 insertions, 30 deletions
diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp index 4ebf3438933..9f70428f920 100644 --- a/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp +++ b/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp @@ -26,20 +26,20 @@ #include "test_iterators.h" -#if TEST_STD_VER > 17 -TEST_CONSTEXPR bool test_constexpr() { - int ia[] = {0, 1, 2, 3, 4}; - int ib[] = {2, 4, 6, 8}; - int ic[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; - const int expected[] = {0, 1, 2, 2, 3, 4, 4, 6, 8}; - - auto it = std::merge(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), std::begin(ic)); - return std::distance(std::begin(ic), it) == (std::size(ia) + std::size(ib)) - && *it == 0 - && std::equal(std::begin(ic), it, std::begin(expected), std::end(expected)) - ; - } -#endif +// #if TEST_STD_VER > 17 +// TEST_CONSTEXPR bool test_constexpr() { +// int ia[] = {0, 1, 2, 3, 4}; +// int ib[] = {2, 4, 6, 8}; +// int ic[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; +// const int expected[] = {0, 1, 2, 2, 3, 4, 4, 6, 8}; +// +// auto it = std::merge(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), std::begin(ic)); +// return std::distance(std::begin(ic), it) == (std::size(ia) + std::size(ib)) +// && *it == 0 +// && std::equal(std::begin(ic), it, std::begin(expected), std::end(expected)) +// ; +// } +// #endif std::mt19937 randomness; diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp index b122fdfdb26..3d2bbfb14c6 100644 --- a/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp +++ b/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp @@ -29,22 +29,22 @@ #include "test_iterators.h" #include "counting_predicates.hpp" -#if TEST_STD_VER > 17 -TEST_CONSTEXPR bool test_constexpr() { - int ia[] = {0, 1, 2, 3, 4}; - int ib[] = {2, 4, 6, 8}; - int ic[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; - const int expected[] = {0, 1, 2, 2, 3, 4, 4, 6, 8}; - - auto it = std::merge(std::begin(ia), std::end(ia), - std::begin(ib), std::end(ib), - std::begin(ic), [](int a, int b) {return a == b; }); - return std::distance(std::begin(ic), it) == (std::size(ia) + std::size(ib)) - && *it == 0 - && std::equal(std::begin(ic), it, std::begin(expected), std::end(expected)) - ; - } -#endif +// #if TEST_STD_VER > 17 +// TEST_CONSTEXPR bool test_constexpr() { +// int ia[] = {0, 1, 2, 3, 4}; +// int ib[] = {2, 4, 6, 8}; +// int ic[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; +// const int expected[] = {0, 1, 2, 2, 3, 4, 4, 6, 8}; +// +// auto it = std::merge(std::begin(ia), std::end(ia), +// std::begin(ib), std::end(ib), +// std::begin(ic), [](int a, int b) {return a == b; }); +// return std::distance(std::begin(ic), it) == (std::size(ia) + std::size(ib)) +// && *it == 0 +// && std::equal(std::begin(ic), it, std::begin(expected), std::end(expected)) +// ; +// } +// #endif std::mt19937 randomness; |