Removed trailing whitespaces

Author: igaztanaga

bench/bench_adaptive_node_pool.cpp

@@ -144,7 +144,7 @@ void list_test_template(std::size_t num_iterations, std::size_t num_elements, bo
       }
       timer.stop();
       tinsert = timer.elapsed().wall;
-      
+
       insert_inuse = boost_cont_in_use_memory();
       insert_stats = boost_cont_malloc_stats();
 /*
@@ -248,7 +248,7 @@ void list_test_template(std::size_t num_iterations, std::size_t num_elements, bo
 
 void print_header()
 {
-   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";" 
+   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";"
                << "Insertion time(ns)" << ";"
                << "System bytes" << ";"
                << "System overhead(%)" << ";"

bench/bench_alloc_expand_bwd.cpp

@@ -86,8 +86,8 @@ struct has_trivial_destructor_after_move<MyInt>
 
 void print_header()
 {
-   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";" 
-               << "Capacity" << ";" << "push_back(ns)" << ";" << "Allocator calls" << ";" 
+   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";"
+               << "Capacity" << ";" << "push_back(ns)" << ";" << "Allocator calls" << ";"
                << "New allocations" << ";" << "Bwd expansions" << std::endl;
 }
 

bench/bench_alloc_expand_fwd.cpp

@@ -228,8 +228,8 @@ void vector_test_template(unsigned int num_iterations, unsigned int num_elements
 
 void print_header()
 {
-   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";" 
-               << "Capacity" << ";" << "push_back(ns)" << ";" << "Allocator calls" << ";" 
+   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";"
+               << "Capacity" << ";" << "push_back(ns)" << ";" << "Allocator calls" << ";"
                << "New allocations" << ";" << "Fwd expansions" << std::endl;
 }
 

bench/bench_alloc_shrink_to_fit.cpp

@@ -65,7 +65,7 @@ class MyInt
 
 void print_header()
 {
-   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";" 
+   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";"
                << "num_shrink" << ";" << "shrink_to_fit(ns)" << std::endl;
 }
 

bench/bench_alloc_stable_vector_burst_allocation.cpp

@@ -148,7 +148,7 @@ void stable_vector_test_template(unsigned int num_iterations, unsigned int num_e
          timer.start();
 
          for(unsigned int r = 0; r != num_iterations; ++r){
-            std::size_t init_pos = (num_iterations-1)-r; 
+            std::size_t init_pos = (num_iterations-1)-r;
             l.erase(ranges_to_erase[init_pos], l.end());
          }
          timer.stop();
@@ -180,7 +180,7 @@ void stable_vector_test_template(unsigned int num_iterations, unsigned int num_e
 
 void print_header()
 {
-   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";" 
+   std::cout   << "Allocator" << ";" << "Iterations" << ";" << "Size" << ";"
                << "Insertion time(ns)" << ";" << "Erasure time(ns)" << ";"
                << std::endl;
 }

bench/detail/varray.hpp

@@ -53,13 +53,13 @@ template <typename Value, std::size_t Capacity, typename Strategy>
 class varray;
 
 namespace strategy {
-    
+
 // TODO: Improve error messages
 //       possibly include N in the strategy, and provide size as an optoinal allocate_failed parameter?
 //       Example of current error with reserve(4) when capacity is 3:
 //          "boost/container/varray.hpp(66): size can't exceed the capacity"
 //       Could say
-//          "cannot reserve(4) due to fixed capacity of 3 elements"    
+//          "cannot reserve(4) due to fixed capacity of 3 elements"
 
 //! @brief The default strategy.
 //!
@@ -189,12 +189,12 @@ struct varray_traits
  * change in size, along with the static allocation, low overhead, and fixed capacity of boost::array.
  *
  * A varray is a sequence that supports random access to elements, constant time insertion and
- * removal of elements at the end, and linear time insertion and removal of elements at the beginning or 
+ * removal of elements at the end, and linear time insertion and removal of elements at the beginning or
  * in the middle. The number of elements in a varray may vary dynamically up to a fixed capacity
- * because elements are stored within the object itself similarly to an array. However, objects are 
+ * because elements are stored within the object itself similarly to an array. However, objects are
  * initialized as they are inserted into varray unlike C arrays or std::array which must construct
  * all elements on instantiation. The behavior of varray enables the use of statically allocated
- * elements in cases with complex object lifetime requirements that would otherwise not be trivially 
+ * elements in cases with complex object lifetime requirements that would otherwise not be trivially
  * possible.
  *
  * @par Error Handling
@@ -219,7 +219,7 @@ class varray
     typedef container_detail::varray_traits<
         Value, Capacity, Strategy
     > vt;
-    
+
     typedef typename vt::error_handler errh;
 
     BOOST_MPL_ASSERT_MSG(
@@ -354,7 +354,7 @@ class varray
         : m_size(0)
     {
         //BOOST_CONCEPT_ASSERT((boost_concepts::ForwardTraversal<Iterator>)); // Make sure you passed a ForwardIterator
-        
+
         this->assign(first, last);                                                    // may throw
     }
 
@@ -393,7 +393,7 @@ class varray
         : m_size(other.size())
     {
         errh::check_capacity(*this, other.size());                                  // may throw
-        
+
         namespace sv = varray_detail;
         sv::uninitialized_copy(other.begin(), other.end(), this->begin());          // may throw
     }
@@ -610,7 +610,7 @@ class varray
         typedef typename
         vt::use_optimized_swap use_optimized_swap;
 
-        this->swap_dispatch(other, use_optimized_swap()); 
+        this->swap_dispatch(other, use_optimized_swap());
     }
 
     //! @pre <tt>count <= capacity()</tt>
@@ -672,7 +672,7 @@ class varray
         else
         {
             errh::check_capacity(*this, count);                                     // may throw
-            
+
             std::uninitialized_fill(this->end(), this->begin() + count, value);     // may throw
         }
         m_size = count; // update end
@@ -716,7 +716,7 @@ class varray
         typedef typename vt::disable_trivial_init dti;
 
         errh::check_capacity(*this, m_size + 1);                                    // may throw
-        
+
         namespace sv = varray_detail;
         sv::construct(dti(), this->end(), value);                                          // may throw
         ++m_size; // update end
@@ -844,7 +844,7 @@ class varray
             namespace sv = varray_detail;
 
             difference_type to_move = std::distance(position, this->end());
-            
+
             // TODO - should following lines check for exception and revert to the old size?
 
             if ( count < static_cast<size_type>(to_move) )
@@ -945,9 +945,9 @@ class varray
 
         errh::check_iterator_end_eq(*this, first);
         errh::check_iterator_end_eq(*this, last);
-        
+
         difference_type n = std::distance(first, last);
-        
+
         //TODO - add invalid range check?
         //BOOST_ASSERT_MSG(0 <= n, "invalid range");
         //TODO - add this->size() check?
@@ -1346,7 +1346,7 @@ class varray
         return boost::addressof(*(this->ptr()));
     }
 
-    
+
     //! @brief Returns iterator to the first element.
     //!
     //! @return iterator to the first element contained in the vector.
@@ -1606,7 +1606,7 @@ class varray
             typename varray<value_type, C, S>::aligned_storage_type
         >::type
         storage_type;
-        
+
         storage_type temp;
         Value * temp_ptr = reinterpret_cast<Value*>(temp.address());
 
@@ -1729,9 +1729,9 @@ class varray
     void insert_dispatch(iterator position, Iterator first, Iterator last, boost::random_access_traversal_tag const&)
     {
         //BOOST_CONCEPT_ASSERT((boost_concepts::RandomAccessTraversal<Iterator>)); // Make sure you passed a RandomAccessIterator
-        
+
         errh::check_iterator_end_eq(*this, position);
-        
+
         typename boost::iterator_difference<Iterator>::type
             count = std::distance(first, last);
 
@@ -1766,7 +1766,7 @@ class varray
 
             std::ptrdiff_t d = std::distance(position, this->begin() + Capacity);
             std::size_t count = sv::uninitialized_copy_s(first, last, position, d);                     // may throw
-            
+
             errh::check_capacity(*this, count <= static_cast<std::size_t>(d) ? m_size + count : Capacity + 1);  // may throw
 
             m_size += count;
@@ -1775,7 +1775,7 @@ class varray
         {
             typename boost::iterator_difference<Iterator>::type
                 count = std::distance(first, last);
-            
+
             errh::check_capacity(*this, m_size + count);                                                // may throw
 
             this->insert_in_the_middle(position, first, last, count);                                   // may throw
@@ -1977,7 +1977,7 @@ class varray<Value, 0, Strategy>
         errh::check_capacity(*this, count);                                         // may throw
     }
 
-    
+
     // nothrow
     void reserve(size_type count)
     {

bench/detail/varray_concept.hpp

@@ -13,7 +13,7 @@
 #include <boost/concept_check.hpp>
 
 namespace boost { namespace container { namespace container_detail { namespace concept {
-  
+
 /**
  * VArrayStrategyConcept
  *
@@ -41,7 +41,7 @@ struct VArrayStrategy {
 
             // must implement allocate_failed
             str->allocate_failed();
-            
+
             boost::ignore_unused_variable_warning(str);
         }
     };

bench/detail/varray_util.hpp

@@ -52,9 +52,9 @@ namespace boost { namespace container { namespace varray_detail {
 template <typename I>
 struct are_elements_contiguous : boost::is_pointer<I>
 {};
-    
+
 #if defined(BOOST_CONTAINER_VARRAY_ENABLE_VECTORS_OPTIMIZATION) && !defined(BOOST_NO_EXCEPTIONS)
-    
+
 template <typename Pointer>
 struct are_elements_contiguous<
     boost::container::container_detail::vector_const_iterator<Pointer>
@@ -68,7 +68,7 @@ struct are_elements_contiguous<
 {};
 
 #if defined(BOOST_DINKUMWARE_STDLIB)
-    
+
 template <typename T>
 struct are_elements_contiguous<
     std::_Vector_const_iterator<T>
@@ -101,7 +101,7 @@ struct are_elements_contiguous<
 #else // OTHER_STDLIB
 
 // TODO - add other iterators implementations
-    
+
 #endif // STDLIB
 
 #endif // BOOST_CONTAINER_VARRAY_ENABLE_VECTORS_OPTIMIZATION && !BOOST_NO_EXCEPTIONS
@@ -212,7 +212,7 @@ inline O copy(I first, I last, O dst)
         >
     >::type
     use_memmove;
-    
+
     return copy_dispatch(first, last, dst, use_memmove());                       // may throw
 }
 

bench/varray.hpp

@@ -32,12 +32,12 @@ namespace boost { namespace container {
  * change in size, along with the static allocation, low overhead, and fixed capacity of boost::array.
  *
  * A varray is a sequence that supports random access to elements, constant time insertion and
- * removal of elements at the end, and linear time insertion and removal of elements at the beginning or 
+ * removal of elements at the end, and linear time insertion and removal of elements at the beginning or
  * in the middle. The number of elements in a varray may vary dynamically up to a fixed capacity
- * because elements are stored within the object itself similarly to an array. However, objects are 
+ * because elements are stored within the object itself similarly to an array. However, objects are
  * initialized as they are inserted into varray unlike C arrays or std::array which must construct
  * all elements on instantiation. The behavior of varray enables the use of statically allocated
- * elements in cases with complex object lifetime requirements that would otherwise not be trivially 
+ * elements in cases with complex object lifetime requirements that would otherwise not be trivially
  * possible.
  *
  * @par Error Handling

build/Jamfile.v2

@@ -1,4 +1,4 @@
-# (C) Copyright Vladimir Prus, David Abrahams, Michael Stevens, Hartmut Kaiser, 
+# (C) Copyright Vladimir Prus, David Abrahams, Michael Stevens, Hartmut Kaiser,
 # Ion Gaztanaga 2007-2008
 # Use, modification and distribution are subject to the
 # Boost Software License, Version 1.0. (See accompanying file

doc/Jamfile.v2

@@ -61,22 +61,22 @@ boostbook standalone
         <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
 
         # Build requirements go here:
-       
+
         # <auto-index>on (or off) one turns on (or off) indexing:
         <auto-index>on
-       
+
         # Turns on (or off) auto-index-verbose for diagnostic info.
         # This is highly recommended until you have got all the many details correct!
         <auto-index-verbose>on
-       
+
         # Choose the indexing method (separately for html and PDF) - see manual.
         # Choose indexing method for PDFs:
         <format>pdf:<auto-index-internal>off
-       
+
         # Choose indexing method for html:
         <format>html:<auto-index-internal>on
         <format>docbook:<auto-index-internal>on
-       
+
         # Set the name of the script file to use (index.idx is popular):
         <auto-index-script>$(here)/index.idx
         # Commands in the script file should all use RELATIVE PATHS