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

llvm-svn: 324959

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp
index 7f75e01..57aa11e 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy.pass.cpp
@@ -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
 

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp
index 4185354..aaad25f 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_backward.pass.cpp
@@ -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
 

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp
index ae94ab4..2ec8325 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_if.pass.cpp
@@ -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
 

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp
index 24e5577..a268cd9 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.copy/copy_n.pass.cpp
@@ -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
 

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp
index 8b9e109..1c08fee 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill.pass.cpp
@@ -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; })
         ;
     }

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp
index fea7165..1e96299 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.fill/fill_n.pass.cpp
@@ -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

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp
index 8be501c..1b15628 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate.pass.cpp
@@ -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; })
         ;
     }

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp
index 98b7bea..3613244 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.generate/generate_n.pass.cpp
@@ -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

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/partition_copy.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/partition_copy.pass.cpp
index 0fd24c1..9738fef 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/partition_copy.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/partition_copy.pass.cpp
@@ -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())

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp
index 557984f..70b3316 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove.pass.cpp
@@ -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

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp
index ae7b341..4ace149 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy.pass.cpp
@@ -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

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp
index 111c59e..c137886 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_copy_if.pass.cpp
@@ -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

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp
index d8123ee..7a0f340 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/remove_if.pass.cpp
@@ -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

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp
index aad7f9f..32be4e5 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy.pass.cpp
@@ -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))

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp
index 6ba74ff..3d9a5bb 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/replace_copy_if.pass.cpp
@@ -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))

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp
index ec9aa9e..e5aa427 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/reverse_copy.pass.cpp
@@ -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)

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp
index 2294c79..e0e096a 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/rotate_copy.pass.cpp
@@ -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))

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp
index 27d3a96..b2b8949 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/binary_transform.pass.cpp
@@ -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)

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp
index b6f9cba..a929291 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/unary_transform.pass.cpp
@@ -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))

diff --git a/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp b/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp
index 1c25b48..b61196c 100644 (file)
--- a/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp
@@ -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))

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 bc5d50c..afcf27b 100644 (file)
--- 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 bd92974..2212285 100644 (file)
--- 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 b2db22b..6c6824f 100644 (file)
--- 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 fd83cbc..4b5ddb1 100644 (file)
--- 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 490309a..ed9ba05 100644 (file)
--- 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
 

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 9f70428..a429361 100644 (file)
--- a/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.sorting/alg.merge/merge.pass.cpp
@@ -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

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 3d2bbfb..1506a8c 100644 (file)
--- 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
@@ -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))

diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp
index 60a5d2b..ca1b422 100644 (file)
--- a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes.pass.cpp
@@ -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))
            ;

diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp
index 82cf043..06192f9 100644 (file)
--- a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/includes_comp.pass.cpp
@@ -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)

diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp
index 96a1eae..8d18027 100644 (file)
--- a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection.pass.cpp
@@ -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));
 

diff --git a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp
index 7531692..6b0cfe1 100644 (file)
--- a/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp
+++ b/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/set_intersection_comp.pass.cpp
@@ -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);

diff --git a/libcxx/test/std/containers/container.adaptors/queue/queue.defn/emplace.pass.cpp b/libcxx/test/std/containers/container.adaptors/queue/queue.defn/emplace.pass.cpp
index e338c99..bcf5fb6 100644 (file)
--- a/libcxx/test/std/containers/container.adaptors/queue/queue.defn/emplace.pass.cpp
+++ b/libcxx/test/std/containers/container.adaptors/queue/queue.defn/emplace.pass.cpp
@@ -29,7 +29,7 @@ void test_return_type() {
        typedef typename Queue::container_type Container;
        typedef typename Container::value_type value_type;
        typedef decltype(std::declval<Queue>().emplace(std::declval<value_type &>()))     queue_return_type;
-       
+
 #if TEST_STD_VER > 14
        typedef decltype(std::declval<Container>().emplace_back(std::declval<value_type>())) container_return_type;
        static_assert(std::is_same<queue_return_type, container_return_type>::value, "");
@@ -42,7 +42,7 @@ int main()
 {
        test_return_type<std::queue<int> > ();
        test_return_type<std::queue<int, std::list<int> > > ();
-       
+
        typedef Emplaceable T;
        std::queue<Emplaceable> q;
 #if TEST_STD_VER > 14

diff --git a/libcxx/test/std/containers/container.adaptors/stack/stack.defn/emplace.pass.cpp b/libcxx/test/std/containers/container.adaptors/stack/stack.defn/emplace.pass.cpp
index 0fec475..bb6ff8f 100644 (file)
--- a/libcxx/test/std/containers/container.adaptors/stack/stack.defn/emplace.pass.cpp
+++ b/libcxx/test/std/containers/container.adaptors/stack/stack.defn/emplace.pass.cpp
@@ -28,7 +28,7 @@ void test_return_type() {
     typedef typename Stack::container_type Container;
     typedef typename Container::value_type value_type;
     typedef decltype(std::declval<Stack>().emplace(std::declval<value_type &>()))     stack_return_type;
-    
+
 #if TEST_STD_VER > 14
     typedef decltype(std::declval<Container>().emplace_back(std::declval<value_type>())) container_return_type;
     static_assert(std::is_same<stack_return_type, container_return_type>::value, "");
@@ -43,7 +43,7 @@ int main()
     test_return_type<std::stack<int, std::vector<int> > > ();
 
     typedef Emplaceable T;
-    std::stack<Emplaceable> q;    
+    std::stack<Emplaceable> q;
 #if TEST_STD_VER > 14
     T& r1 = q.emplace(1, 2.5);
     assert(&r1 == &q.top());

diff --git a/libcxx/test/std/containers/sequences/list/list.ops/sort_comp.pass.cpp b/libcxx/test/std/containers/sequences/list/list.ops/sort_comp.pass.cpp
index c8966f6..33f2fab 100644 (file)
--- a/libcxx/test/std/containers/sequences/list/list.ops/sort_comp.pass.cpp
+++ b/libcxx/test/std/containers/sequences/list/list.ops/sort_comp.pass.cpp
@@ -24,18 +24,18 @@ template <typename T>
 struct throwingLess {
     throwingLess() : num_(1) {}
     throwingLess(int num) : num_(num) {}
-    
+
     bool operator() (const T& lhs, const T& rhs) const
     {
     if ( --num_ == 0) throw 1;
     return lhs < rhs;
     }
-    
+
     mutable int num_;
     };
 #endif
-    
-    
+
+
 int main()
 {
     {

diff --git a/libcxx/test/std/strings/string.view/types.pass.cpp b/libcxx/test/std/strings/string.view/types.pass.cpp
index 68bbc29..00f4d60 100644 (file)
--- a/libcxx/test/std/strings/string.view/types.pass.cpp
+++ b/libcxx/test/std/strings/string.view/types.pass.cpp
@@ -28,7 +28,7 @@
 //     using size_type                 = size_t;
 //     using difference_type           = ptrdiff_t;
 //     static constexpr size_type npos = size_type(-1);
-// 
+//
 // };
 
 #include <string_view>

diff --git a/libcxx/test/std/utilities/meta/meta.type.synop/endian.pass.cpp b/libcxx/test/std/utilities/meta/meta.type.synop/endian.pass.cpp
index c71229c..cf0ab2d 100644 (file)
--- a/libcxx/test/std/utilities/meta/meta.type.synop/endian.pass.cpp
+++ b/libcxx/test/std/utilities/meta/meta.type.synop/endian.pass.cpp
@@ -33,9 +33,9 @@ int main() {
     static_assert( std::endian::little != std::endian::big );
 
 //  Technically not required, but true on all existing machines
-    static_assert( std::endian::native == std::endian::little || 
+    static_assert( std::endian::native == std::endian::little ||
                    std::endian::native == std::endian::big );
-    
+
 //  Try to check at runtime
     {
     uint32_t i = 0x01020304;

diff --git a/libcxx/test/std/utilities/utility/exchange/exchange.pass.cpp b/libcxx/test/std/utilities/utility/exchange/exchange.pass.cpp
index 0e5de03..1a5007e 100644 (file)
--- a/libcxx/test/std/utilities/utility/exchange/exchange.pass.cpp
+++ b/libcxx/test/std/utilities/utility/exchange/exchange.pass.cpp
@@ -25,13 +25,13 @@
 #if TEST_STD_VER > 17
 TEST_CONSTEXPR bool test_constexpr() {
     int v = 12;
-    
+
     if (12 != std::exchange(v,23) || v != 23)
         return false;
 
     if (23 != std::exchange(v,static_cast<short>(67)) || v != 67)
         return false;
-        
+
     if (67 != std::exchange<int, short>(v, {}) || v != 0)
         return false;
     return true;