diff options
author | Stephan T. Lavavej <stl@exchange.microsoft.com> | 2018-02-12 22:54:35 +0000 |
---|---|---|
committer | Stephan T. Lavavej <stl@exchange.microsoft.com> | 2018-02-12 22:54:35 +0000 |
commit | 6b1ae9b854bd186c8dab4784d287f38ce61459d2 (patch) | |
tree | cdc0b96afc32b469b6af86c350ebbc0c5912111f /libcxx/test/std/algorithms/alg.nonmodifying | |
parent | 031a00c6607ef823942db1ed4269badd7c50f0ef (diff) | |
download | bcm5719-llvm-6b1ae9b854bd186c8dab4784d287f38ce61459d2.tar.gz bcm5719-llvm-6b1ae9b854bd186c8dab4784d287f38ce61459d2.zip |
[libcxx] [test] Strip trailing whitespace, NFC.
llvm-svn: 324959
Diffstat (limited to 'libcxx/test/std/algorithms/alg.nonmodifying')
5 files changed, 9 insertions, 9 deletions
diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp index bc5d50cd5dd..afcf27b5555 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp @@ -28,7 +28,7 @@ TEST_CONSTEXPR bool test_constexpr() { typedef forward_iterator<int*> FI; typedef bidirectional_iterator<int*> BI; typedef random_access_iterator<int*> RI; - + return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia))) == FI(ic+15)) && (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == FI(std::end(ic))) && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+15)) diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp index bd929749004..2212285ae47 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp @@ -28,7 +28,7 @@ TEST_CONSTEXPR bool test_constexpr() { typedef forward_iterator<int*> FI; typedef bidirectional_iterator<int*> BI; typedef random_access_iterator<int*> RI; - + return (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia))) == FI(ic+1)) && (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == FI(std::end(ic))) && (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == BI(ic+1)) diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/for_each_n.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/for_each_n.pass.cpp index b2db22b1e82..6c6824fafa0 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/for_each_n.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/alg.foreach/for_each_n.pass.cpp @@ -26,7 +26,7 @@ TEST_CONSTEXPR bool test_constexpr() { int ia[] = {1, 3, 6, 7}; int expected[] = {3, 5, 8, 9}; const size_t N = 4; - + auto it = std::for_each_n(std::begin(ia), N, [](int &a) { a += 2; }); return it == (std::begin(ia) + N) && std::equal(std::begin(ia), std::end(ia), std::begin(expected)) diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp index fd83cbcb423..4b5ddb191d4 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp @@ -35,11 +35,11 @@ TEST_CONSTEXPR bool test_constexpr() { auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic)); if (p1.first != ia+2 || p1.second != ic+2) return false; - + auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)); if (p2.first != ia+2 || p2.second != ic+2) return false; - + auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); if (p3.first != ib+2 || p3.second != ic+2) return false; @@ -55,7 +55,7 @@ TEST_CONSTEXPR bool test_constexpr() { if (p6.first != BI(ib+2) || p6.second != BI(ic+2)) return false; - return true; + return true; } #endif diff --git a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp index 490309a81e7..ed9ba055aab 100644 --- a/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp +++ b/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp @@ -40,11 +40,11 @@ TEST_CONSTEXPR bool test_constexpr() { auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), eq); if (p1.first != ia+2 || p1.second != ic+2) return false; - + auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq); if (p2.first != ia+2 || p2.second != ic+2) return false; - + auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); if (p3.first != ib+2 || p3.second != ic+2) return false; @@ -60,7 +60,7 @@ TEST_CONSTEXPR bool test_constexpr() { if (p6.first != BI(ib+2) || p6.second != BI(ic+2)) return false; - return true; + return true; } #endif |