[language.support] Minor comment compaction and realignment

Author: tkoeppe

source/support.tex

@@ -2742,10 +2742,9 @@
 struct X { const int n; };
 X *p = new X{3};
 const int a = p->n;
-new (p) X{5};                     // \tcode{p} does not point to new object (\ref{basic.life})
-                                  // because \tcode{X::n} is \tcode{const}
-const int b = p->n;               // undefined behavior
-const int c = std::launder(p)->n; // OK
+new (p) X{5};                       // \tcode{p} does not point to new object (\ref{basic.life}) because \tcode{X::n} is \tcode{const}
+const int b = p->n;                 // undefined behavior
+const int c = std::launder(p)->n;   // OK
 \end{codeblock}
 \end{example}
 \end{itemdescr}
@@ -2840,8 +2839,8 @@
     size_t hash_code() const noexcept;
     const char* name() const noexcept;
 
-    type_info(const type_info& rhs) = delete;            // cannot be copied
-    type_info& operator=(const type_info& rhs) = delete; // cannot be copied
+    type_info(const type_info& rhs) = delete;                   // cannot be copied
+    type_info& operator=(const type_info& rhs) = delete;        // cannot be copied
   };
 }
 \end{codeblock}
@@ -3610,9 +3609,9 @@
 
     constexpr initializer_list() noexcept;
 
-    constexpr size_t size() const noexcept;      // number of elements
-    constexpr const E* begin() const noexcept;   // first element
-    constexpr const E* end() const noexcept;     // one past the last element
+    constexpr size_t size() const noexcept;     // number of elements
+    constexpr const E* begin() const noexcept;  // first element
+    constexpr const E* end() const noexcept;    // one past the last element
   };
 
   // \ref{support.initlist.range}, initializer list range access