Fixup: typo-level repairs of initial transcription

Author: jensmaurer

source/support.tex

@@ -3883,9 +3883,9 @@
 
   // \ref{cmp.concept}, concept \tcode{ThreeWayComparable}
   template<class T, class Cat = partial_ordering>
-    concept ThreeWayComparable = see below;
+    concept ThreeWayComparable = @\seebelow@;
   template<class T, class U, class Cat = partial_ordering>
-    concept ThreeWayComparableWith = see below;
+    concept ThreeWayComparableWith = @\seebelow@;
 
   // \ref{cmp.result}, result of three-way comparison
   template<class T, class U = T> struct compare_three_way_result;
@@ -3982,7 +3982,7 @@
     static const weak_equality nonequivalent;
 
     // comparisons
-    friend constexpr bool operator==(weak_equality v, unspecified) noexcept;
+    friend constexpr bool operator==(weak_equality v, @\unspec@) noexcept;
     friend constexpr bool operator==(weak_equality v, weak_equality w) noexcept = default;
     friend constexpr weak_equality operator<=>(weak_equality v, @\unspec@) noexcept;
     friend constexpr weak_equality operator<=>(@\unspec@, weak_equality v) noexcept;
@@ -4579,12 +4579,12 @@
 template<class T, class U>
   concept @\placeholder{partially-ordered-with}@ =      // \expos
     requires(const remove_reference_t<T>& t, const remove_reference_t<U>& u) {
-      { t < u } -> Boolean;
-      { t > u } -> Boolean;
+      { t <  u } -> Boolean;
+      { t >  u } -> Boolean;
       { t <= u } -> Boolean;
       { t >= u } -> Boolean;
-      { u < t } -> Boolean;
-      { u > t } -> Boolean;
+      { u <  t } -> Boolean;
+      { u >  t } -> Boolean;
       { u <= t } -> Boolean;
       { u >= t } -> Boolean;
     };
@@ -4763,7 +4763,7 @@
 \begin{itemize}
 \item
   If the expression \tcode{std::forward<T>(t) <=> std::forward<U>(u)} results in
-  a call to a built-in operator \tcode{<=>} comparing pointers of type P,
+  a call to a built-in operator \tcode{<=>} comparing pointers of type \tcode{P},
   returns \tcode{strong_ordering::less}
   if (the converted value of) \tcode{t} precedes \tcode{u}
   in the implementation-defined strict total order\iref{range.cmp}
@@ -4772,7 +4772,7 @@
   if \tcode{u} precedes \tcode{t}, and
   otherwise \tcode{strong_ordering::equal}.
 \item
-  Otherwise, equivalent to: return \tcode{std::forward<T>(t) <=> std::forward<U>(u);}
+  Otherwise, equivalent to: \tcode{return std::forward<T>(t) <=> std::forward<U>(u);}
 \end{itemize}
 \end{itemdescr}
 

source/utilities.tex

@@ -3634,7 +3634,7 @@
 
   // \ref{variant.monostate.relops}, \tcode{monostate} relational operators
   constexpr bool operator==(monostate, monostate) noexcept;
-constexpr strong_ordering operator<=>(monostate, monostate) noexcept;
+  constexpr strong_ordering operator<=>(monostate, monostate) noexcept;
 
   // \ref{variant.specalg}, specialized algorithms
   template<class... Types>
@@ -4720,17 +4720,17 @@
 
 \begin{itemdescr}
 \pnum
-\effect
+\effects
 Equivalent to:
 \begin{codeblock}
 if (v.valueless_by_exception() && w.valueless_by_exception())
   return strong_ordering::equal;
 if (v.valueless_by_exception()) return strong_ordering::less;
 if (w.valueless_by_exception()) return strong_ordering::greater;
 if (auto c = v.index() <=> w.index(); c != 0) return c;
-return get<i>(v) <=> get<i>(w);
+return get<@$i$@>(v) <=> get<@$i$@>(w);
 \end{codeblock}
-with \tcode{i} being \tcode{v.index()}.
+with $i$ being \tcode{v.index()}.
 \end{itemdescr}
 
 \rSec2[variant.visit]{Visitation}
@@ -6750,13 +6750,12 @@
 
   template<class T>
     bool operator==(const shared_ptr<T>& x, nullptr_t) noexcept;
-
+  template<class T>
+    strong_ordering operator<=>(const shared_ptr<T>& x, nullptr_t) noexcept;
 
   // \ref{util.smartptr.shared.spec}, \tcode{shared_ptr} specialized algorithms
   template<class T>
     void swap(shared_ptr<T>& a, shared_ptr<T>& b) noexcept;
-  template<class T>
-    strong_ordering operator<=>(const shared_ptr<T>& x, nullptr_t) noexcept;
 
   // \ref{util.smartptr.shared.cast}, \tcode{shared_ptr} casts
   template<class T, class U>