Fixing whitespace problems

git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@111755 91177308-0d34-0410-b5e6-96231b3b80d8

test/containers/Copyable.h

@@ -6,4 +6,4 @@ class Copyable
 public:
 };
 
-#endif
+#endif  // COPYABLE_H

test/containers/DefaultOnly.h

@@ -23,4 +23,4 @@ public:
 
 int DefaultOnly::count = 0;
 
-#endif
+#endif  // DEFAULTONLY_H

test/containers/Emplaceable.h

@@ -40,6 +40,6 @@ struct hash<Emplaceable>
 
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
-#endif
+#endif  // EMPLACEABLE_H

test/containers/MoveOnly.h

@@ -36,6 +36,6 @@ struct hash<MoveOnly>
 
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
-#endif
+#endif  // MOVEONLY_H

test/containers/NotConstructible.h

@@ -27,4 +27,4 @@ struct hash<NotConstructible>
 
 }
 
-#endif
+#endif  // NOTCONSTRUCTIBLE_H

test/containers/associative/map/map.access/index_rv_key.pass.cpp

@@ -34,5 +34,5 @@ int main()
     m[6] = 6.5;
     assert(m[6] == 6.5);
     assert(m.size() == 2);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.cons/assign_initializer_list.pass.cpp

@@ -41,5 +41,5 @@ int main()
     assert(*m.begin() == V(1, 1));
     assert(*next(m.begin()) == V(2, 1));
     assert(*next(m.begin(), 2) == V(3, 1));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.cons/copy.pass.cpp

@@ -90,5 +90,5 @@ int main()
         assert(*next(mo.begin()) == V(2, 1));
         assert(*next(mo.begin(), 2) == V(3, 1));
     }
-#endif
+#endif  // _LIBCPP_HAS_NO_ADVANCED_SFINAE
 }

test/containers/associative/map/map.cons/initializer_list.pass.cpp

@@ -37,5 +37,5 @@ int main()
     assert(*m.begin() == V(1, 1));
     assert(*next(m.begin()) == V(2, 1));
     assert(*next(m.begin(), 2) == V(3, 1));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.cons/initializer_list_compare.pass.cpp

@@ -39,5 +39,5 @@ int main()
     assert(*next(m.begin()) == V(2, 1));
     assert(*next(m.begin(), 2) == V(3, 1));
     assert(m.key_comp() == C(3));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.cons/initializer_list_compare_alloc.pass.cpp

@@ -42,5 +42,5 @@ int main()
     assert(*next(m.begin(), 2) == V(3, 1));
     assert(m.key_comp() == C(3));
     assert(m.get_allocator() == A(6));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.cons/move.pass.cpp

@@ -68,5 +68,5 @@ int main()
         assert(mo.size() == 0);
         assert(distance(mo.begin(), mo.end()) == 0);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.cons/move_alloc.pass.cpp

@@ -140,5 +140,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.cons/move_assign.pass.cpp

@@ -143,5 +143,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.modifiers/emplace.pass.cpp

@@ -85,5 +85,5 @@ int main()
         assert(m.begin()->first == 2);
         assert(m.begin()->second == 3.5);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.modifiers/emplace_hint.pass.cpp

@@ -78,5 +78,5 @@ int main()
         assert(m.begin()->first == 2);
         assert(m.begin()->second == 3.5);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.modifiers/insert_initializer_list.pass.cpp

@@ -39,5 +39,5 @@ int main()
     assert(*m.begin() == V(1, 1));
     assert(*next(m.begin()) == V(2, 1));
     assert(*next(m.begin(), 2) == V(3, 1));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.modifiers/insert_iter_rv.pass.cpp

@@ -51,5 +51,5 @@ int main()
         assert(r->first == 3);
         assert(r->second == 3);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/map/map.modifiers/insert_rv.pass.cpp

@@ -54,5 +54,5 @@ int main()
         assert(r.first->first == 3);
         assert(r.first->second == 3);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.cons/assign_initializer_list.pass.cpp

@@ -46,5 +46,5 @@ int main()
     assert(*++i == V(3, 1));
     assert(*++i == V(3, 1.5));
     assert(*++i == V(3, 2));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.cons/copy.pass.cpp

@@ -72,5 +72,5 @@ int main()
         assert(mo.get_allocator() == A(7));
         assert(mo.key_comp() == C(5));
     }
-#endif
+#endif  // _LIBCPP_HAS_NO_ADVANCED_SFINAE
 }

test/containers/associative/multimap/multimap.cons/initializer_list.pass.cpp

@@ -45,5 +45,5 @@ int main()
     assert(*++i == V(3, 1));
     assert(*++i == V(3, 1.5));
     assert(*++i == V(3, 2));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.cons/initializer_list_compare.pass.cpp

@@ -50,5 +50,5 @@ int main()
     assert(*++i == V(3, 1.5));
     assert(*++i == V(3, 2));
     assert(m.key_comp() == Cmp(4));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.cons/initializer_list_compare_alloc.pass.cpp

@@ -53,5 +53,5 @@ int main()
     assert(*++i == V(3, 2));
     assert(m.key_comp() == Cmp(4));
     assert(m.get_allocator() == A(5));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.cons/move.pass.cpp

@@ -74,5 +74,5 @@ int main()
         assert(mo.size() == 0);
         assert(distance(mo.begin(), mo.end()) == 0);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.cons/move_alloc.pass.cpp

@@ -140,5 +140,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.cons/move_assign.pass.cpp

@@ -143,5 +143,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.modifiers/emplace.pass.cpp

@@ -78,5 +78,5 @@ int main()
         assert(m.begin()->first == 2);
         assert(m.begin()->second == 3.5);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.modifiers/emplace_hint.pass.cpp

@@ -78,5 +78,5 @@ int main()
         assert(m.begin()->first == 2);
         assert(m.begin()->second == 3.5);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.modifiers/insert_initializer_list.pass.cpp

@@ -49,5 +49,5 @@ int main()
     assert(*++i == V(3, 1));
     assert(*++i == V(3, 2));
     assert(*++i == V(3, 1.5));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.modifiers/insert_iter_rv.pass.cpp

@@ -51,5 +51,5 @@ int main()
         assert(r->first == 3);
         assert(r->second == 2);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multimap/multimap.modifiers/insert_rv.pass.cpp

@@ -50,5 +50,5 @@ int main()
         assert(r->first == 3);
         assert(r->second == 3);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/emplace.pass.cpp

@@ -67,5 +67,5 @@ int main()
         assert(m.size() == 1);
         assert(*r == 2);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/emplace_hint.pass.cpp

@@ -67,5 +67,5 @@ int main()
         assert(m.size() == 1);
         assert(*r == 2);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/insert_initializer_list.pass.cpp

@@ -34,5 +34,5 @@ int main()
     assert(*++i == V(6));
     assert(*++i == V(8));
     assert(*++i == V(10));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/insert_iter_rv.pass.cpp

@@ -45,5 +45,5 @@ int main()
         assert(m.size() == 4);
         assert(*r == 3);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/insert_rv.pass.cpp

@@ -45,5 +45,5 @@ int main()
         assert(m.size() == 4);
         assert(*r == 3);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/multiset.cons/assign_initializer_list.pass.cpp

@@ -32,5 +32,5 @@ int main()
     assert(*++i == V(4));
     assert(*++i == V(5));
     assert(*++i == V(6));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/multiset.cons/copy.pass.cpp

@@ -114,5 +114,5 @@ int main()
         assert(*next(mo.begin(), 7) == 3);
         assert(*next(mo.begin(), 8) == 3);
     }
-#endif
+#endif  // _LIBCPP_HAS_NO_ADVANCED_SFINAE
 }

test/containers/associative/multiset/multiset.cons/initializer_list.pass.cpp

@@ -31,5 +31,5 @@ int main()
     assert(*++i == V(4));
     assert(*++i == V(5));
     assert(*++i == V(6));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/multiset.cons/initializer_list_compare.pass.cpp

@@ -34,5 +34,5 @@ int main()
     assert(*++i == V(5));
     assert(*++i == V(6));
     assert(m.key_comp() == Cmp(10));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/multiset.cons/initializer_list_compare_alloc.pass.cpp

@@ -37,5 +37,5 @@ int main()
     assert(*++i == V(6));
     assert(m.key_comp() == Cmp(10));
     assert(m.get_allocator() == A(4));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/multiset.cons/move.pass.cpp

@@ -75,5 +75,5 @@ int main()
         assert(mo.size() == 0);
         assert(distance(mo.begin(), mo.end()) == 0);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/multiset.cons/move_alloc.pass.cpp

@@ -137,5 +137,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/multiset/multiset.cons/move_assign.pass.cpp

@@ -140,5 +140,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/emplace.pass.cpp

@@ -73,5 +73,5 @@ int main()
         assert(m.size() == 1);
         assert(*r.first == 2);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/emplace_hint.pass.cpp

@@ -67,5 +67,5 @@ int main()
         assert(m.size() == 1);
         assert(*r == 2);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/insert_initializer_list.pass.cpp

@@ -34,5 +34,5 @@ int main()
     assert(*++i == V(6));
     assert(*++i == V(8));
     assert(*++i == V(10));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/insert_iter_rv.pass.cpp

@@ -45,5 +45,5 @@ int main()
         assert(m.size() == 3);
         assert(*r == 3);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/insert_rv.pass.cpp

@@ -49,5 +49,5 @@ int main()
         assert(m.size() == 3);
         assert(*r.first == 3);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/set.cons/assign_initializer_list.pass.cpp

@@ -32,5 +32,5 @@ int main()
     assert(*++i == V(4));
     assert(*++i == V(5));
     assert(*++i == V(6));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/set.cons/copy.pass.cpp

@@ -90,5 +90,5 @@ int main()
         assert(*next(mo.begin()) == 2);
         assert(*next(mo.begin(), 2) == 3);
     }
-#endif
+#endif  // _LIBCPP_HAS_NO_ADVANCED_SFINAE
 }

test/containers/associative/set/set.cons/initializer_list.pass.cpp

@@ -31,5 +31,5 @@ int main()
     assert(*++i == V(4));
     assert(*++i == V(5));
     assert(*++i == V(6));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/set.cons/initializer_list_compare.pass.cpp

@@ -34,5 +34,5 @@ int main()
     assert(*++i == V(5));
     assert(*++i == V(6));
     assert(m.key_comp() == Cmp(10));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/set.cons/initializer_list_compare_alloc.pass.cpp

@@ -37,5 +37,5 @@ int main()
     assert(*++i == V(6));
     assert(m.key_comp() == Cmp(10));
     assert(m.get_allocator() == A(4));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/set.cons/move.pass.cpp

@@ -69,5 +69,5 @@ int main()
         assert(mo.size() == 0);
         assert(distance(mo.begin(), mo.end()) == 0);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/set.cons/move_alloc.pass.cpp

@@ -137,5 +137,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/associative/set/set.cons/move_assign.pass.cpp

@@ -140,5 +140,5 @@ int main()
         assert(m3.key_comp() == C(5));
         assert(m1.empty());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/iterators.h

@@ -248,4 +248,4 @@ operator-(const random_access_iterator<T>& x, const random_access_iterator<U>& y
     return x.base() - y.base();
 }
 
-#endif
+#endif  // ITERATORS_H

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons.alloc/ctor_alloc.pass.cpp

@@ -34,7 +34,7 @@ struct test
     test(const value_compare& comp, container_type&& c,
          const test_allocator<int>& a) : base(comp, std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 
     using base::c;

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons.alloc/ctor_comp_alloc.pass.cpp

@@ -34,7 +34,7 @@ struct test
     test(const value_compare& comp, container_type&& c,
          const test_allocator<int>& a) : base(comp, std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 
     using base::c;

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons.alloc/ctor_comp_cont_alloc.pass.cpp

@@ -45,7 +45,7 @@ struct test
     test(const value_compare& comp, container_type&& c,
          const test_allocator<int>& a) : base(comp, std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 
     using base::c;

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons.alloc/ctor_comp_rcont_alloc.pass.cpp

@@ -45,7 +45,7 @@ struct test
     test(const value_compare& comp, container_type&& c,
          const test_allocator<int>& a) : base(comp, std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 
     using base::c;

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons.alloc/ctor_move_alloc.pass.cpp

@@ -52,7 +52,7 @@ struct test
     using base::c;
 };
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -64,5 +64,5 @@ int main()
     assert(q.size() == 5);
     assert(q.c.get_allocator() == test_allocator<MoveOnly>(6));
     assert(q.top() == MoveOnly(4));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons/assign_move.pass.cpp

@@ -28,7 +28,7 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -38,5 +38,5 @@ int main()
     q = std::move(qo);
     assert(q.size() == 5);
     assert(q.top() == MoveOnly(4));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons/ctor_comp_rcontainer.pass.cpp

@@ -28,7 +28,7 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -36,5 +36,5 @@ int main()
     std::priority_queue<MoveOnly> q(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
     assert(q.size() == 5);
     assert(q.top() == MoveOnly(4));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons/ctor_iter_iter_comp_rcont.pass.cpp

@@ -28,5 +28,5 @@ int main()
                                     std::vector<MoveOnly>(a, a+n/2));
     assert(q.size() == n);
     assert(q.top() == MoveOnly(8));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/priority.queue/priqueue.cons/ctor_move.pass.cpp

@@ -28,7 +28,7 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -37,5 +37,5 @@ int main()
     std::priority_queue<MoveOnly> q = std::move(qo);
     assert(q.size() == 5);
     assert(q.top() == MoveOnly(4));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/priority.queue/priqueue.members/emplace.pass.cpp

@@ -28,5 +28,5 @@ int main()
     assert(q.top() == Emplaceable(3, 4.5));
     q.emplace(2, 3.5);
     assert(q.top() == Emplaceable(3, 4.5));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/priority.queue/priqueue.members/empty.pass.cpp

@@ -13,7 +13,6 @@
 
 // bool empty() const;
 
-
 #include <queue>
 #include <cassert>
 

test/containers/sequences/container.adaptors/priority.queue/priqueue.members/push_rvalue.pass.cpp

@@ -28,5 +28,5 @@ int main()
     assert(q.top() == 3);
     q.push(2);
     assert(q.top() == 3);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/queue/queue.cons.alloc/ctor_alloc.pass.cpp

@@ -27,7 +27,7 @@ struct test
 #ifdef _LIBCPP_MOVE
     test(container_type&& c, const test_allocator<int>& a) : base(std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 };
 

test/containers/sequences/container.adaptors/queue/queue.cons.alloc/ctor_container_alloc.pass.cpp

@@ -39,7 +39,7 @@ struct test
 #ifdef _LIBCPP_MOVE
     test(container_type&& c, const test_allocator<int>& a) : base(std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 };
 

test/containers/sequences/container.adaptors/queue/queue.cons.alloc/ctor_rcontainer_alloc.pass.cpp

@@ -47,7 +47,7 @@ struct test
     allocator_type get_allocator() {return this->c.get_allocator();}
 };
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -55,5 +55,5 @@ int main()
     test<MoveOnly> q(make<C>(5), test_allocator<MoveOnly>(4));
     assert(q.get_allocator() == test_allocator<MoveOnly>(4));
     assert(q.size() == 5);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/queue/queue.cons.alloc/ctor_rqueue_alloc.pass.cpp

@@ -47,7 +47,7 @@ struct test
     allocator_type get_allocator() {return this->c.get_allocator();}
 };
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -56,5 +56,5 @@ int main()
     test<MoveOnly> q2(std::move(q), test_allocator<MoveOnly>(5));
     assert(q2.get_allocator() == test_allocator<MoveOnly>(5));
     assert(q2.size() == 5);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/queue/queue.cons/ctor_move.pass.cpp

@@ -28,7 +28,7 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -37,5 +37,5 @@ int main()
     std::queue<MoveOnly> q2 = std::move(q);
     assert(q2.size() == 5);
     assert(q.empty());
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/queue/queue.cons/ctor_rcontainer.pass.cpp

@@ -28,12 +28,12 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
 #ifdef _LIBCPP_MOVE
     std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
     assert(q.size() == 5);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/queue/queue.defn/assign_move.pass.cpp

@@ -28,7 +28,7 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -38,5 +38,5 @@ int main()
     q2 = std::move(q);
     assert(q2.size() == 5);
     assert(q.empty());
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/queue/queue.defn/emplace.pass.cpp

@@ -26,5 +26,5 @@ int main()
     assert(q.size() == 3);
     assert(q.front() == Emplaceable(1, 2.5));
     assert(q.back() == Emplaceable(3, 4.5));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/queue/queue.defn/push_rv.pass.cpp

@@ -32,5 +32,5 @@ int main()
     assert(q.size() == 3);
     assert(q.front() == MoveOnly(1));
     assert(q.back() == MoveOnly(3));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/stack/stack.cons.alloc/ctor_alloc.pass.cpp

@@ -27,7 +27,7 @@ struct test
 #ifdef _LIBCPP_MOVE
     test(container_type&& c, const test_allocator<int>& a) : base(std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 };
 

test/containers/sequences/container.adaptors/stack/stack.cons.alloc/ctor_container_alloc.pass.cpp

@@ -39,7 +39,7 @@ struct test
 #ifdef _LIBCPP_MOVE
     test(container_type&& c, const test_allocator<int>& a) : base(std::move(c), a) {}
     test(test&& q, const test_allocator<int>& a) : base(std::move(q), a) {}
-#endif
+#endif  // _LIBCPP_MOVE
     test_allocator<int> get_allocator() {return c.get_allocator();}
 };
 

test/containers/sequences/container.adaptors/stack/stack.cons.alloc/ctor_rcontainer_alloc.pass.cpp

@@ -47,7 +47,7 @@ struct test
     allocator_type get_allocator() {return this->c.get_allocator();}
 };
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -55,5 +55,5 @@ int main()
     test<MoveOnly> q(make<C>(5), test_allocator<MoveOnly>(4));
     assert(q.get_allocator() == test_allocator<MoveOnly>(4));
     assert(q.size() == 5);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/stack/stack.cons.alloc/ctor_rqueue_alloc.pass.cpp

@@ -47,7 +47,7 @@ struct test
     allocator_type get_allocator() {return this->c.get_allocator();}
 };
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -56,5 +56,5 @@ int main()
     test<MoveOnly> q2(std::move(q), test_allocator<MoveOnly>(5));
     assert(q2.get_allocator() == test_allocator<MoveOnly>(5));
     assert(q2.size() == 5);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/stack/stack.cons/ctor_move.pass.cpp

@@ -28,7 +28,7 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -37,5 +37,5 @@ int main()
     std::stack<MoveOnly> q2 = std::move(q);
     assert(q2.size() == 5);
     assert(q.empty());
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/stack/stack.cons/ctor_rcontainer.pass.cpp

@@ -28,12 +28,12 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
 #ifdef _LIBCPP_MOVE
     std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
     assert(q.size() == 5);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/stack/stack.defn/assign_move.pass.cpp

@@ -28,7 +28,7 @@ make(int n)
     return c;
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -38,5 +38,5 @@ int main()
     q2 = std::move(q);
     assert(q2.size() == 5);
     assert(q.empty());
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/stack/stack.defn/emplace.pass.cpp

@@ -25,5 +25,5 @@ int main()
     q.emplace(3, 4.5);
     assert(q.size() == 3);
     assert(q.top() == Emplaceable(3, 4.5));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/container.adaptors/stack/stack.defn/push_rv.pass.cpp

@@ -29,5 +29,5 @@ int main()
     q.push(MoveOnly(3));
     assert(q.size() == 3);
     assert(q.top() == MoveOnly(3));
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/assign_initializer_list.pass.cpp

@@ -24,5 +24,5 @@ int main()
     assert(d[1] == 4);
     assert(d[2] == 5);
     assert(d[3] == 6);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/copy.pass.cpp

@@ -43,5 +43,5 @@ int main()
         assert(v2 == v);
         assert(v2.get_allocator() == other_allocator<int>(-2));
     }
-#endif
+#endif  // _LIBCPP_HAS_NO_ADVANCED_SFINAE
 }

test/containers/sequences/deque/deque.cons/initializer_list.pass.cpp

@@ -23,5 +23,5 @@ int main()
     assert(d[1] == 4);
     assert(d[2] == 5);
     assert(d[3] == 6);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/initializer_list_alloc.pass.cpp

@@ -26,5 +26,5 @@ int main()
     assert(d[1] == 4);
     assert(d[2] == 5);
     assert(d[3] == 6);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/move.pass.cpp

@@ -50,5 +50,5 @@ int main()
         assert(c1.size() == 0);
         assert(c3.get_allocator() == c1.get_allocator());
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/move_alloc.pass.cpp

@@ -65,5 +65,5 @@ int main()
         assert(c3.get_allocator() == A(3));
         assert(c1.size() != 0);
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/move_assign.pass.cpp

@@ -68,5 +68,5 @@ int main()
         assert(c1.size() == 0);
         assert(c3.get_allocator() == A(5));
     }
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/op_equal_initializer_list.pass.cpp

@@ -24,5 +24,5 @@ int main()
     assert(d[1] == 4);
     assert(d[2] == 5);
     assert(d[3] == 6);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.cons/size.pass.cpp

@@ -32,7 +32,7 @@ test(unsigned n)
 #ifdef _LIBCPP_MOVE
     for (const_iterator i = d.begin(), e = d.end(); i != e; ++i)
         assert(*i == T());
-#endif
+#endif  // _LIBCPP_MOVE
     }
     assert(DefaultOnly::count == 0);
 }

test/containers/sequences/deque/deque.modifiers/emplace.pass.cpp

@@ -85,7 +85,7 @@ testN(int start, int N)
     }
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -95,5 +95,5 @@ int main()
     for (int i = 0; i < N; ++i)
         for (int j = 0; j < N; ++j)
             testN(rng[i], rng[j]);
-#endif
+#endif  // _LIBCPP_MOVE
 }

test/containers/sequences/deque/deque.modifiers/emplace_back.pass.cpp

@@ -60,7 +60,7 @@ testN(int start, int N)
     test(c1);
 }
 
-#endif
+#endif  // _LIBCPP_MOVE
 
 int main()
 {
@@ -70,5 +70,5 @@ int main()
     for (int i = 0; i < N; ++i)
         for (int j = 0; j < N; ++j)
             testN(rng[i], rng[j]);
-#endif
+#endif  // _LIBCPP_MOVE
 }