LineageOS/android_external_libcxx
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

[libcxx] [test] Strip trailing whitespace, NFC.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@324959 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Stephan T. Lavavej
2018-02-12 22:54:35 +00:00
parent 806a6ec645
commit a2b7665eb2
37 changed files with 57 additions and 57 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
test/std/algorithms/alg.nonmodifying/alg.find.end/find_end.pass.cpp
View File

@@ -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))

2
test/std/algorithms/alg.nonmodifying/alg.find.first.of/find_first_of.pass.cpp
View File

@@ -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))

2
test/std/algorithms/alg.nonmodifying/alg.foreach/for_each_n.pass.cpp
View File

@@ -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))

6
test/std/algorithms/alg.nonmodifying/mismatch/mismatch.pass.cpp
View File

@@ -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

6
test/std/algorithms/alg.nonmodifying/mismatch/mismatch_pred.pass.cpp
View File

@@ -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