Remove trailing whitespace

include/boost/dynamic_bitset/dynamic_bitset.hpp

@@ -1504,7 +1504,7 @@ bool operator<(const dynamic_bitset<Block, Allocator>& a,
 //    BOOST_ASSERT(a.size() == b.size());
 
     typedef BOOST_DEDUCED_TYPENAME dynamic_bitset<Block, Allocator>::size_type size_type;
-    
+
     size_type asize(a.size());
     size_type bsize(b.size());
 
@@ -1518,7 +1518,7 @@ bool operator<(const dynamic_bitset<Block, Allocator>& a,
         }
     else if (asize == bsize)
         {
-        for (size_type ii = a.num_blocks(); ii > 0; --ii) 
+        for (size_type ii = a.num_blocks(); ii > 0; --ii)
             {
             size_type i = ii-1;
             if (a.m_bits[i] < b.m_bits[i])
@@ -1530,9 +1530,8 @@ bool operator<(const dynamic_bitset<Block, Allocator>& a,
         }
     else
         {
-        
         size_type leqsize(std::min BOOST_PREVENT_MACRO_SUBSTITUTION(asize,bsize));
-    
+
         for (size_type ii = 0; ii < leqsize; ++ii,--asize,--bsize)
             {
             size_type i = asize-1;

include/boost/dynamic_bitset/serialization.hpp

@@ -21,7 +21,7 @@ namespace boost {
         class dynamic_bitset<Block, Allocator>::serialize_impl
         {
             public:
-                template <typename Ar> 
+                template <typename Ar>
                 static void serialize(Ar& ar, dynamic_bitset<Block, Allocator>& bs, unsigned) {
                     ar & boost::make_nvp("m_num_bits", bs.m_num_bits)
                        & boost::make_nvp("m_bits", bs.m_bits);

index.html

@@ -8,8 +8,8 @@
 Automatic redirection failed, please go to
 <a href="dynamic_bitset.html">dynamic_bitset.html</a>.&nbsp;<hr>
 <p>© Copyright Beman Dawes, 2001</p>
-<p>Distributed under the Boost Software License, Version 1.0. (See accompanying 
-file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy 
+<p>Distributed under the Boost Software License, Version 1.0. (See accompanying
+file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or copy
 at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</p>
 </body>
 </html>

test/bitset_test.hpp

@@ -1025,12 +1025,12 @@ struct bitset_test {
 
   static bool less_than(const Bitset& a, const Bitset& b)
   {
-  
+
     typedef BOOST_DEDUCED_TYPENAME Bitset::size_type size_type;
-    
+
     size_type asize(a.size());
     size_type bsize(b.size());
-    
+
     if (!bsize)
         {
         return false;
@@ -1041,17 +1041,17 @@ struct bitset_test {
         }
     else
         {
-              
+
         // Compare from most significant to least.
-    
+
         size_type leqsize(std::min BOOST_PREVENT_MACRO_SUBSTITUTION(asize,bsize));
         size_type I;
         for (I = 0; I < leqsize; ++I,--asize,--bsize)
           {
-          
+
           size_type i = asize-1;
           size_type j = bsize-1;
-            
+
           if (a[i] < b[j])
             return true;
           else if (a[i] > b[j])

test/dyn_bitset_unit_tests1.cpp

@@ -2,7 +2,7 @@
 //              Copyright (c) 2001 Jeremy Siek
 //         Copyright (c) 2003-2006, 2025 Gennaro Prota
 //             Copyright (c) 2014 Ahmed Charles
-//            Copyright (c) 2014 Riccardo Marcangelo 
+//            Copyright (c) 2014 Riccardo Marcangelo
 //
 // Copyright (c) 2014 Glen Joseph Fernandes
 // (glenjofe@gmail.com)
@@ -158,9 +158,9 @@ void run_test_cases( BOOST_EXPLICIT_TEMPLATE_TYPE(Block) )
     //
     const int sizes[] = {
         0,                     1,                                  3,
-           7*bits_per_block/10, bits_per_block, 13*bits_per_block/10, 3*bits_per_block 
+           7*bits_per_block/10, bits_per_block, 13*bits_per_block/10, 3*bits_per_block
     };
-    
+
     const bool values[] = { false, true };
 
     for (std::size_t s = 0; s < BOOST_BITSET_TEST_COUNT(sizes); ++s) {
@@ -384,7 +384,7 @@ void run_test_cases( BOOST_EXPLICIT_TEMPLATE_TYPE(Block) )
     Tests::clear(a);
   }
   //=====================================================================
-  // Test pop back 
+  // Test pop back
   {
     boost::dynamic_bitset<Block> a(std::string("01"));
     Tests::pop_back(a);

test/dyn_bitset_unit_tests4.cpp

@@ -145,7 +145,7 @@ void run_test_cases( BOOST_EXPLICIT_TEMPLATE_TYPE(Block) )
               file.width(w);
               file.fill(fill_chars[ci]);
               file.exceptions(masks[mi]);
-              Tests::stream_inserter(b, file, stf.path().string().c_str()); 
+              Tests::stream_inserter(b, file, stf.path().string().c_str());
             }
 #endif
           }

test/test_ambiguous_set.cpp

@@ -1,6 +1,6 @@
 //
 // Copyright (C) 2018 James E. King III
-// 
+//
 // Permission to copy, use, modify, sell and distribute this software
 // is granted provided this copyright notice appears in all copies.
 // This software is provided "as is" without express or implied

test/test_lowest_bit.cpp

@@ -1,6 +1,6 @@
 //
 // Copyright (C) 2018 James E. King III
-// 
+//
 // Permission to copy, use, modify, sell and distribute this software
 // is granted provided this copyright notice appears in all copies.
 // This software is provided "as is" without express or implied