Automerge: [libcxx][test] Fix typos (#155217)

I noticed a typo in the directory name `refwrap.comparissons`, then did
a quick pass to fix typos elsewhere in the tests.

All fixes were manual (some carefully search-and-replaced); I used
[cspell](https://www.npmjs.com/package/cspell) to find them.

Author: StephanTLavavej

libcxx/test/std/algorithms/algorithms.results/out_value_result.pass.cpp

@@ -123,7 +123,7 @@ constexpr bool test() {
     static_assert(std::is_same_v<double, decltype(res.value)>);
   }
   {
-    // Check aggregate initiazliation
+    // Check aggregate initialization
     out_value_result<int, int> res = {1, 2};
     assert(res.out == 1);
     assert(res.value == 2);

libcxx/test/std/atomics/types.pass.cpp

@@ -68,7 +68,7 @@ struct test_atomic<T, /*Integral=*/true, false, false> {
 };
 
 template <class T>
-struct test_atomic<T, false, /*Foating=*/true, false> {
+struct test_atomic<T, false, /*Floating=*/true, false> {
   test_atomic() {
     using A = std::atomic<T>;
     A a;

libcxx/test/std/containers/associative/map/map.cons/copy_assign.pass.cpp

@@ -70,7 +70,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy map combinations
+  {   // Test empty/non-empty map combinations
     { // assign from a non-empty container into an empty one
       using V   = std::pair<const int, int>;
       using Map = std::map<int, int, std::less<int>, Alloc>;
@@ -225,7 +225,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
     }
     check_alloc_invariant();
   }
-  { // Make a somewhat larget set to exercise the algorithm a bit
+  { // Make a somewhat larger set to exercise the algorithm a bit
     using V   = std::pair<const int, int>;
     using Map = std::map<int, int, std::less<int>, Alloc>;
 

libcxx/test/std/containers/associative/multimap/multimap.cons/copy_assign.pass.cpp

@@ -68,7 +68,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy multimap combinations
+  {   // Test empty/non-empty multimap combinations
     { // assign from a non-empty container into an empty one
       using V   = std::pair<const int, int>;
       using Map = std::multimap<int, int, std::less<int>, Alloc>;
@@ -223,7 +223,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
     }
     check_alloc_invariant();
   }
-  { // Make a somewhat larget set to exercise the algorithm a bit
+  { // Make a somewhat larger set to exercise the algorithm a bit
     using V   = std::pair<const int, int>;
     using Map = std::multimap<int, int, std::less<int>, Alloc>;
 

libcxx/test/std/containers/associative/multiset/multiset.cons/copy_assign.pass.cpp

@@ -68,7 +68,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy multiset combinations
+  {   // Test empty/non-empty multiset combinations
     { // assign from a non-empty container into an empty one
       using Set = std::multiset<int, std::less<int>, Alloc>;
 
@@ -216,7 +216,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
       assert(std::next(orig.begin(), 3) == orig.end());
     }
     check_alloc_invariant();
-    { // Make a somewhat larget multiset to exercise the algorithm a bit
+    { // Make a somewhat larger multiset to exercise the algorithm a bit
       using Set = std::multiset<int, std::less<int>, Alloc>;
 
       Set orig(rhs_alloc);

libcxx/test/std/containers/associative/set/set.cons/copy_assign.pass.cpp

@@ -70,7 +70,7 @@ template <class Alloc, class AllocatorInvariant = NoOp>
 void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
                 const Alloc& rhs_alloc                   = Alloc(),
                 AllocatorInvariant check_alloc_invariant = NoOp()) {
-  {   // Test empty/non-empy set combinations
+  {   // Test empty/non-empty set combinations
     { // assign from a non-empty container into an empty one
       using Set = std::set<int, std::less<int>, Alloc>;
 
@@ -218,7 +218,7 @@ void test_alloc(const Alloc& lhs_alloc                   = Alloc(),
       assert(std::next(orig.begin(), 3) == orig.end());
     }
     check_alloc_invariant();
-    { // Make a somewhat larget set to exercise the algorithm a bit
+    { // Make a somewhat larger set to exercise the algorithm a bit
       using Set = std::set<int, std::less<int>, Alloc>;
 
       Set orig(rhs_alloc);

libcxx/test/std/containers/sequences/array/array.cons/initialization.pass.cpp

@@ -20,7 +20,7 @@ struct NoDefault {
 struct test_initialization {
   template <typename T>
   TEST_CONSTEXPR_CXX14 void operator()() const {
-    // Check default initalization
+    // Check default initialization
     {
       std::array<T, 0> a0;
       (void)a0;

libcxx/test/std/containers/sequences/vector/vector.capacity/max_size.pass.cpp

@@ -66,7 +66,7 @@ TEST_CONSTEXPR_CXX20 bool tests() {
 
 #if TEST_STD_VER >= 11
 
-  // Test with various allocators and diffrent size_type
+  // Test with various allocators and different size_type
   {
     test(std::vector<int>());
     test(std::vector<short, std::allocator<short> >());

libcxx/test/std/containers/sequences/vector/vector.capacity/shrink_to_fit_exceptions.pass.cpp

@@ -39,7 +39,7 @@ void test_allocation_exception_for_strong_guarantee(std::vector<T, Alloc>& v, co
   } catch (...) {
   }
 
-  // As shrink_to_fit may swallow any exceptions, we place the checks outisde the catch block.
+  // As shrink_to_fit may swallow any exceptions, we place the checks outside the catch block.
   assert(v.data() == old_data);
   assert(v.size() == old_size);
   assert(v.capacity() == old_cap);

libcxx/test/std/containers/views/mdspan/aligned_accessor/access.pass.cpp

@@ -23,7 +23,7 @@
 #include "test_macros.h"
 
 // We are not using MinimalElementType.h because MinimalElementType is not
-// default consructible and uninitialized storage does not work in constexpr.
+// default constructible and uninitialized storage does not work in constexpr.
 
 // Same as MinimalElementType but with a defaulted default constructor
 struct MyMinimalElementType {