Remove trailing whitespace in test suite. Approved by Marshall Clow.

llvm-svn: 271435

6 files changed, 17 insertions, 17 deletions

diff --git a/libcxx/test/support/Counter.h b/libcxx/test/support/Counter.h
index 2bc3642f505..eb6e04e72ef 100644
--- a/libcxx/test/support/Counter.h
+++ b/libcxx/test/support/Counter.h
@@ -13,7 +13,7 @@
 #include <functional> // for std::hash
 
 struct Counter_base { static int gConstructed; };
-    
+
 template <typename T>
 class Counter : public Counter_base
 {
@@ -27,7 +27,7 @@ public:
     Counter& operator=(Counter&& rhs) { ++gConstructed; data_ = std::move(rhs.data_); return *this; }
 #endif
     ~Counter() { --gConstructed; }
-    
+
     const T& get() const {return data_;}
 
     bool operator==(const Counter& x) const {return data_ == x.data_;}
diff --git a/libcxx/test/support/asan_testing.h b/libcxx/test/support/asan_testing.h
index 85cd08b869e..678f12a91b6 100644
--- a/libcxx/test/support/asan_testing.h
+++ b/libcxx/test/support/asan_testing.h
@@ -32,6 +32,6 @@ bool is_contiguous_container_asan_correct ( const std::vector<T, Alloc> &)
     return true;
 }
 #endif
- 
+
 
 #endif  // ASAN_TESTING_H
diff --git a/libcxx/test/support/counting_predicates.hpp b/libcxx/test/support/counting_predicates.hpp
index aab6a978577..2bd1426934e 100644
--- a/libcxx/test/support/counting_predicates.hpp
+++ b/libcxx/test/support/counting_predicates.hpp
@@ -16,11 +16,11 @@ struct unary_counting_predicate : public std::unary_function<Arg, bool>  {
 public:
     unary_counting_predicate(Predicate p) : p_(p), count_(0) {}
     ~unary_counting_predicate() {}
-    
+
     bool operator () (const Arg &a) const { ++count_; return p_(a); }
     size_t count() const { return count_; }
     void reset() { count_ = 0; }
-    
+
 private:
     Predicate p_;
     mutable size_t count_;
@@ -33,7 +33,7 @@ public:
 
     binary_counting_predicate ( Predicate p ) : p_(p), count_(0) {}
     ~binary_counting_predicate() {}
-    
+
     bool operator () (const Arg1 &a1, const Arg2 &a2) const { ++count_; return p_(a1, a2); }
     size_t count() const { return count_; }
     void reset() { count_ = 0; }
diff --git a/libcxx/test/support/is_transparent.h b/libcxx/test/support/is_transparent.h
index 58255248abc..d76b00536b5 100644
--- a/libcxx/test/support/is_transparent.h
+++ b/libcxx/test/support/is_transparent.h
@@ -10,7 +10,7 @@
 #ifndef TRANSPARENT_H
 #define TRANSPARENT_H
 
-// testing transparent 
+// testing transparent
 #if _LIBCPP_STD_VER > 11
 
 struct transparent_less
@@ -63,7 +63,7 @@ struct C2Int { // comparable to int
 private:
     int i_;
     };
-    
+
 bool operator <(int          rhs,   const C2Int& lhs) { return rhs       < lhs.get(); }
 bool operator <(const C2Int& rhs,   const C2Int& lhs) { return rhs.get() < lhs.get(); }
 bool operator <(const C2Int& rhs,            int lhs) { return rhs.get() < lhs; }
diff --git a/libcxx/test/support/nasty_containers.hpp b/libcxx/test/support/nasty_containers.hpp
index b9ef5a6a727..b571469227d 100644
--- a/libcxx/test/support/nasty_containers.hpp
+++ b/libcxx/test/support/nasty_containers.hpp
@@ -100,7 +100,7 @@ public:
     { return v_.emplace(pos, std::forward<Args>(args)...); }
 #endif
 #endif
-    
+
     iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); }
 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
     iterator insert(const_iterator pos, value_type&& x)      { return v_.insert(pos, std::forward<value_type>(x)); }
@@ -124,10 +124,10 @@ public:
 
     void swap(nasty_vector &nv) _NOEXCEPT_(std::__is_nothrow_swappable<nested_container>::value)
     { v_.swap(nv.v_); }
-    
+
     nasty_vector *operator &()             { assert(false); return nullptr; }  // nasty
     const nasty_vector *operator &() const { assert(false); return nullptr; }  // nasty
-    
+
     nested_container v_;
 };
 
@@ -221,7 +221,7 @@ public:
     { return l_.emplace(pos, std::forward<Args>(args)...); }
 #endif
 #endif
-    
+
     iterator insert(const_iterator pos, const value_type& x) { return l_.insert(pos, x); }
 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
     iterator insert(const_iterator pos, value_type&& x)      { return l_.insert(pos, std::forward<value_type>(x)); }
@@ -243,7 +243,7 @@ public:
 
     void swap(nasty_list &nl) _NOEXCEPT_(std::__is_nothrow_swappable<nested_container>::value)
     { l_.swap(nl.l_); }
-    
+
     void clear() _NOEXCEPT { l_.clear(); }
 
 //     void splice(const_iterator position, list& x);
@@ -254,7 +254,7 @@ public:
 //                                                   const_iterator last);
 //     void splice(const_iterator position, list&& x, const_iterator first,
 //                                                   const_iterator last);
-// 
+//
 //     void remove(const value_type& value);
 //     template <class Pred> void remove_if(Pred pred);
 //     void unique();
diff --git a/libcxx/test/support/test_iterators.h b/libcxx/test/support/test_iterators.h
index d8790fecb62..d4a079971b1 100644
--- a/libcxx/test/support/test_iterators.h
+++ b/libcxx/test/support/test_iterators.h
@@ -400,7 +400,7 @@ struct ThrowingIterator {
     ++current_;
     return *this;
     }
-    
+
     ThrowingIterator operator++(int)
     {
         ThrowingIterator temp = *this;
@@ -466,7 +466,7 @@ bool operator== (const ThrowingIterator<T>& a, const ThrowingIterator<T>& b)
 template <typename T>
 bool operator!= (const ThrowingIterator<T>& a, const ThrowingIterator<T>& b)
 {   return !a.operator==(b); }
-    
+
 template <typename T>
 struct NonThrowingIterator {
     typedef std::bidirectional_iterator_tag iterator_category;
@@ -501,7 +501,7 @@ struct NonThrowingIterator {
     ++current_;
     return *this;
     }
-    
+
     NonThrowingIterator operator++(int) TEST_NOEXCEPT
     {
         NonThrowingIterator temp = *this;