llvm/libcxx
1
0
Fork 0
mirror of https://github.com/llvm-mirror/libcxx.git synced 2025-10-23 18:38:30 +08:00
Code Issues 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.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);