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

4
test/std/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp
View File

@@ -23,11 +23,11 @@
// TEST_CONSTEXPR bool test_constexpr() {
// int ia[] = {1, 2, 3, 4, 5};
// int ic[] = {6, 6, 6, 6, 6, 6, 6};
//
//
// auto p = std::copy(std::begin(ia), std::end(ia), std::begin(ic));
// return std::equal(std::begin(ia), std::end(ia), std::begin(ic), p)
// && std::all_of(p, std::end(ic), [](int a){return a == 6;})
// ;
// ;
// }
// #endif

4
test/std/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp
View File

@@ -25,12 +25,12 @@
// TEST_CONSTEXPR bool test_constexpr() {
// int ia[] = {1, 2, 3, 4, 5};
// int ic[] = {6, 6, 6, 6, 6, 6, 6};
//
//
// size_t N = std::size(ia);
// auto p = std::copy_backward(std::begin(ia), std::end(ia), std::begin(ic) + N);
// return std::equal(std::begin(ic), p, std::begin(ia))
// && std::all_of(p, std::end(ic), [](int a){return a == 6;})
// ;
// ;
// }
// #endif

4
test/std/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp
View File

@@ -25,11 +25,11 @@
// TEST_CONSTEXPR bool test_constexpr() {
// int ia[] = {2, 4, 6, 8, 6};
// int ic[] = {0, 0, 0, 0, 0, 0};
//
//
// auto p = std::copy_if(std::begin(ia), std::end(ia), std::begin(ic), is6);
// return std::all_of(std::begin(ic), p, [](int a){return a == 6;})
// && std::all_of(p, std::end(ic), [](int a){return a == 0;})
// ;
// ;
// }
// #endif

4
test/std/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp
View File

@@ -24,11 +24,11 @@
// TEST_CONSTEXPR bool test_constexpr() {
// int ia[] = {1, 2, 3, 4, 5};
// int ic[] = {6, 6, 6, 6, 6, 6, 6};
//
//
// auto p = std::copy_n(std::begin(ia), 4, std::begin(ic));
// return std::equal(std::begin(ic), p, std::begin(ia))
// && std::all_of(p, std::end(ic), [](int a){return a == 6;})
// ;
// ;
// }
// #endif

2
test/std/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp
View File

@@ -25,7 +25,7 @@ TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 1, 2, 3, 4};
std::fill(std::begin(ia), std::end(ia), 5);
return std::all_of(std::begin(ia), std::end(ia), [](int a) {return a == 5; })
;
}

2
test/std/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp
View File

@@ -26,7 +26,7 @@ TEST_CONSTEXPR bool test_constexpr() {
const size_t N = 5;
int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger than N
auto it = std::fill_n(std::begin(ib), N, 5);
auto it = std::fill_n(std::begin(ib), N, 5);
return it == (std::begin(ib) + N)
&& std::all_of(std::begin(ib), it, [](int a) {return a == 5; })
&& *it == 0 // don't overwrite the last value in the output array

2
test/std/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp
View File

@@ -32,7 +32,7 @@ TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 1, 2, 3, 4};
std::generate(std::begin(ia), std::end(ia), gen_test());
return std::all_of(std::begin(ia), std::end(ia), [](int x) { return x == 1; })
;
}

2
test/std/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp
View File

@@ -38,7 +38,7 @@ TEST_CONSTEXPR bool test_constexpr() {
int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger than N
auto it = std::generate_n(std::begin(ib), N, gen_test());
return it == (std::begin(ib) + N)
&& std::all_of(std::begin(ib), it, [](int x) { return x == 2; })
&& *it == 0 // don't overwrite the last value in the output array

4
test/std/algorithms/alg.modifying.operations/alg.partitions/partition_copy.pass.cpp
View File

@@ -32,8 +32,8 @@ TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 4, 6};
int r1[10] = {0};
int r2[10] = {0};
auto p = std::partition_copy(std::begin(ia), std::end(ia),
auto p = std::partition_copy(std::begin(ia), std::end(ia),
std::begin(r1), std::begin(r2), is_odd());
return std::all_of(std::begin(r1), p.first, is_odd())

2
test/std/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp
View File

@@ -25,7 +25,7 @@
#if TEST_STD_VER > 17
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 5, 6};
auto it = std::remove(std::begin(ia), std::end(ia), 5);
return (std::begin(ia) + std::size(ia) - 2) == it // we removed two elements

2
test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp
View File

@@ -24,7 +24,7 @@
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 5, 6};
int ib[std::size(ia)] = {0};
auto it = std::remove_copy(std::begin(ia), std::end(ia), std::begin(ib), 5);
return std::distance(std::begin(ib), it) == (std::size(ia) - 2) // we removed two elements

2
test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp
View File

@@ -28,7 +28,7 @@ TEST_CONSTEXPR bool equalToTwo(int v) { return v == 2; }
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 5, 6};
int ib[std::size(ia)] = {0};
auto it = std::remove_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo);
return std::distance(std::begin(ib), it) == (std::size(ia) - 1) // we removed one element

2
test/std/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp
View File

@@ -29,7 +29,7 @@ TEST_CONSTEXPR bool equal2 ( int i ) { return i == 2; }
#if TEST_STD_VER > 17
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 5, 6};
auto it = std::remove_if(std::begin(ia), std::end(ia), equal2);
return (std::begin(ia) + std::size(ia) - 1) == it // we removed one element

2
test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp
View File

@@ -31,7 +31,7 @@ TEST_CONSTEXPR bool test_constexpr() {
const int expected[] = {0, 1, 5, 3, 4};
auto it = std::replace_copy(std::begin(ia), std::end(ia), std::begin(ib), 2, 5);
return it == (std::begin(ib) + std::size(ia))
&& *it == 0 // don't overwrite the last value in the output array
&& std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))

2
test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp
View File

@@ -34,7 +34,7 @@ TEST_CONSTEXPR bool test_constexpr() {
const int expected[] = {0, 1, 5, 3, 4};
auto it = std::replace_copy_if(std::begin(ia), std::end(ia), std::begin(ib), equalToTwo, 5);
return it == (std::begin(ib) + std::size(ia))
&& *it == 0 // don't overwrite the last value in the output array
&& std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))

2
test/std/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp
View File

@@ -23,7 +23,7 @@
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 3, 5, 2, 5, 6};
int ib[std::size(ia)] = {0};
auto it = std::reverse_copy(std::begin(ia), std::end(ia), std::begin(ib));
return std::distance(std::begin(ib), it) == std::size(ia)

4
test/std/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp
View File

@@ -23,11 +23,11 @@
// TEST_CONSTEXPR bool test_constexpr() {
// int ia[] = {1, 3, 5, 2, 5, 6};
// int ib[std::size(ia)] = {0};
//
//
// const size_t N = 2;
// const auto middle = std::begin(ia) + N;
// auto it = std::rotate_copy(std::begin(ia), middle, std::end(ia), std::begin(ib));
//
//
// return std::distance(std::begin(ib), it) == std::size(ia)
// && std::equal (std::begin(ia), middle, std::begin(ib) + std::size(ia) - N)
// && std::equal (middle, std::end(ia), std::begin(ib))

6
test/std/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp
View File

@@ -28,10 +28,10 @@ TEST_CONSTEXPR bool test_constexpr() {
const int ib[] = {2, 4, 7, 8};
int ic[] = {0, 0, 0, 0, 0}; // one bigger
const int expected[] = {3, 7, 13, 15};
auto it = std::transform(std::begin(ia), std::end(ia),
auto it = std::transform(std::begin(ia), std::end(ia),
std::begin(ib), std::begin(ic), std::plus<int>());
return it == (std::begin(ic) + std::size(ia))
&& *it == 0 // don't overwrite the last value in the output array
&& std::equal(std::begin(expected), std::end(expected), std::begin(ic), it)

2
test/std/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp
View File

@@ -32,7 +32,7 @@ TEST_CONSTEXPR bool test_constexpr() {
const int expected[] = {2, 4, 7, 8};
auto it = std::transform(std::begin(ia), std::end(ia), std::begin(ib), plusOne);
return it == (std::begin(ib) + std::size(ia))
&& *it == 0 // don't overwrite the last value in the output array
&& std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))

2
test/std/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp
View File

@@ -27,7 +27,7 @@ TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {0, 1, 1, 3, 4};
const int expected[] = {0, 1, 3, 4};
const size_t N = 4;
auto it = std::unique(std::begin(ia), std::end(ia));
return it == (std::begin(ia) + N)
&& std::equal(std::begin(ia), it, std::begin(expected), std::end(expected))

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

2
test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp
View File

@@ -32,7 +32,7 @@
// 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

4
test/std/algorithms/alg.sorting/alg.merge/merge_comp.pass.cpp
View File

@@ -35,8 +35,8 @@
// 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),
//
// 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))

2
test/std/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp
View File

@@ -26,7 +26,7 @@ TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
int ib[] = {2, 4};
int ic[] = {3, 3, 3, 3};
return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib))
&& !std::includes(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic))
;

2
test/std/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp
View File

@@ -27,7 +27,7 @@ TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
int ib[] = {2, 4};
int ic[] = {3, 3, 3, 3};
auto comp = [](int a, int b) {return a < b; };
return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), comp)
&& !std::includes(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), comp)

2
test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp
View File

@@ -29,7 +29,7 @@ TEST_CONSTEXPR bool test_constexpr() {
const int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
const int ib[] = {2, 4, 4, 6};
int results[std::size(ia)] = {0};
auto it = std::set_intersection(std::begin(ia), std::end(ia),
std::begin(ib), std::end(ib), std::begin(results));

2
test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp
View File

@@ -31,7 +31,7 @@ TEST_CONSTEXPR bool test_constexpr() {
const int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
const int ib[] = {2, 4, 4, 6};
int results[std::size(ia)] = {0};
auto comp = [](int a, int b) {return a < b; };
auto it = std::set_intersection(std::begin(ia), std::end(ia),
std::begin(ib), std::end(ib), std::begin(results), comp);