[ub] cleanups and feedback from initial reviewers

source/algorithms.tex

@@ -2316,16 +2316,6 @@
     template<@\libconcept{input_or_output_iterator}@ O, @\libconcept{copy_constructible}@ F>
       requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<O, invoke_result_t<F&>>
       constexpr O generate_n(O first, iter_difference_t<O> n, F gen);
-    template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ O, @\libconcept{sized_sentinel_for}@<O> S,
-             @\libconcept{copy_constructible}@ F>
-      requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<O, invoke_result_t<F&>>
-      O generate(Ep&& exec, O first, S last, F gen);                        // freestanding-deleted
-    template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, @\libconcept{copy_constructible}@ F>
-      requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<iterator_t<R>, invoke_result_t<F&>>
-      borrowed_iterator_t<R> generate(Ep&& exec, R&& r, F gen);             // freestanding-deleted
-    template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ O, @\libconcept{copy_constructible}@ F>
-      requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<O, invoke_result_t<F&>>
-      O generate_n(Ep&& exec, O first, iter_difference_t<O> n, F gen);      // freestanding-deleted
   }
 
   // \ref{alg.remove}, remove
@@ -2857,12 +2847,12 @@
              class Comp = ranges::less, class Proj = identity>
       requires @\libconcept{sortable}@<I, Comp, Proj>
       I stable_sort(Ep&& exec, I first, S last, Comp comp = {},
-                    Proj proj = {});                                        // freestanding-deleted
+                    Proj proj = {});                                        // hosted
     template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, class Comp = ranges::less,
              class Proj = identity>
       requires @\libconcept{sortable}@<iterator_t<R>, Comp, Proj>
       borrowed_iterator_t<R>
-        stable_sort(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {});      // freestanding-deleted
+        stable_sort(Ep&& exec, R&& r, Comp comp = {}, Proj proj = {});      // hosted
   }
 
   template<class RandomAccessIterator>
@@ -3261,12 +3251,12 @@
       requires @\libconcept{permutable}@<I>
       subrange<I>
         stable_partition(Ep&& exec, I first, S last, Pred pred,
-                         Proj proj = {});                                   // freestanding-deleted
+                         Proj proj = {});                                   // hosted
     template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, class Proj = identity,
              @\libconcept{indirect_unary_predicate}@<projected<iterator_t<R>, Proj>> Pred>
       requires @\libconcept{permutable}@<iterator_t<R>>
       borrowed_subrange_t<R>
-        stable_partition(Ep&& exec, R&& r, Pred pred, Proj proj = {});      // freestanding-deleted
+        stable_partition(Ep&& exec, R&& r, Pred pred, Proj proj = {});      // hosted
   }
 
   template<class InputIterator, class OutputIterator1,
@@ -3434,13 +3424,13 @@
              class Comp = ranges::less, class Proj = identity>
       requires @\libconcept{sortable}@<I, Comp, Proj>
       I inplace_merge(Ep&& exec, I first, I middle, S last, Comp comp = {},
-                      Proj proj = {});                          // freestanding-deleted
+                      Proj proj = {});                          // hosted
     template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, class Comp = ranges::less,
              class Proj = identity>
       requires @\libconcept{sortable}@<iterator_t<R>, Comp, Proj>
       borrowed_iterator_t<R>
         inplace_merge(Ep&& exec, R&& r, iterator_t<R> middle, Comp comp = {},
-                      Proj proj = {});                          // freestanding-deleted
+                      Proj proj = {});                          // hosted
   }
 
   // \ref{alg.set.operations}, set operations
@@ -7005,9 +6995,9 @@
     ranges::transform(Ep&& exec, I first1, S last1, O result, OutS result_last,
                       F op, Proj proj = {});
 template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, @\exposconcept{sized-random-access-range}@ OutR,
-          @\libconcept{copy_constructible}@ F, class Proj = identity>
+         @\libconcept{copy_constructible}@ F, class Proj = identity>
   requires @\libconcept{indirectly_writable}@<iterator_t<OutR>,
-                                indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
+                               indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
   ranges::unary_transform_result<borrowed_iterator_t<R>, borrowed_iterator_t<OutR>>
     ranges::transform(Ep&& exec, R&& r, OutR&& result_r, F op, Proj proj = {});
 
@@ -7032,17 +7022,17 @@
          @\libconcept{random_access_iterator}@ O, @\libconcept{sized_sentinel_for}@<O> OutS,
          @\libconcept{copy_constructible}@ F, class Proj1 = identity, class Proj2 = identity>
   requires @\libconcept{indirectly_writable}@<O, indirect_result_t<F&, projected<I1, Proj1>,
-                                projected<I2, Proj2>>>
+                               projected<I2, Proj2>>>
   ranges::binary_transform_result<I1, I2, O>
     ranges::transform(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2,
                       O result, OutS result_last,
                       F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {});
 template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R1, @\exposconcept{sized-random-access-range}@ R2,
          @\exposconcept{sized-random-access-range}@ OutR, @\libconcept{copy_constructible}@ F,
-          class Proj1 = identity, class Proj2 = identity>
+         class Proj1 = identity, class Proj2 = identity>
   requires @\libconcept{indirectly_writable}@<iterator_t<OutR>,
-                                indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
-                                projected<iterator_t<R2>, Proj2>>>
+                               indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
+                               projected<iterator_t<R2>, Proj2>>>
   ranges::binary_transform_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>,
                                   borrowed_iterator_t<OutR>>
     ranges::transform(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r,
@@ -7178,8 +7168,8 @@
 template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, class Proj = identity,
          class T1 = projected_value_t<iterator_t<R>, Proj>, class T2 = range_value_t<R>>
   requires @\libconcept{indirectly_writable}@<iterator_t<R>, const T2&> &&
-            @\libconcept{indirect_binary_predicate}@<ranges::equal_to,
-                                      projected<iterator_t<R>, Proj>, const T1*>
+           @\libconcept{indirect_binary_predicate}@<ranges::equal_to,
+                                     projected<iterator_t<R>, Proj>, const T1*>
   borrowed_iterator_t<R>
     ranges::replace(Ep&& exec, R&& r, const T1& old_value, const T2& new_value,
                     Proj proj = {});
@@ -7299,7 +7289,7 @@
          class T2 = range_value_t<OutR>>
   requires @\libconcept{indirectly_copyable}@<iterator_t<R>, iterator_t<OutR>> &&
            @\libconcept{indirect_binary_predicate}@<ranges::equal_to,
-                                      projected<iterator_t<R>, Proj>, const T1*> &&
+                                     projected<iterator_t<R>, Proj>, const T1*> &&
            @\libconcept{indirectly_writable}@<iterator_t<OutR>, const T2&>
   ranges::replace_copy_result<borrowed_iterator_t<R>, borrowed_iterator_t<OutR>>
     ranges::replace_copy(Ep&& exec, R&& r, OutR&& result_r, const T1& old_value,
@@ -7492,17 +7482,6 @@
 template<@\libconcept{input_or_output_iterator}@ O, @\libconcept{copy_constructible}@ F>
   requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<O, invoke_result_t<F&>>
   constexpr O ranges::generate_n(O first, iter_difference_t<O> n, F gen);
-
-template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ O, @\libconcept{sized_sentinel_for}@<O> S,
-         @\libconcept{copy_constructible}@ F>
-  requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<O, invoke_result_t<F&>>
-  O ranges::generate(Ep&& exec, O first, S last, F gen);
-template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, @\libconcept{copy_constructible}@ F>
-  requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<iterator_t<R>, invoke_result_t<F&>>
-  borrowed_iterator_t<R> ranges::generate(Ep&& exec, R&& r, F gen);
-template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ O, @\libconcept{copy_constructible}@ F>
-  requires @\libconcept{invocable}@<F&> && @\libconcept{indirectly_writable}@<O, invoke_result_t<F&>>
-  O ranges::generate_n(Ep&& exec, O first, iter_difference_t<O> n, F gen);
 \end{itemdecl}
 
 \begin{itemdescr}
@@ -7577,7 +7556,7 @@
          class T = projected_value_t<iterator_t<R>, Proj>>
   requires @\libconcept{permutable}@<iterator_t<R>> &&
            @\libconcept{indirect_binary_predicate}@<ranges::equal_to,
-                                      projected<iterator_t<R>, Proj>, const T*>
+                                     projected<iterator_t<R>, Proj>, const T*>
   borrowed_subrange_t<R>
     ranges::remove(Ep&& exec, R&& r, const T& value, Proj proj = {});
 
@@ -7604,7 +7583,7 @@
 
 \begin{itemdescr}
 \pnum
-Let $E$ be
+Let $E(\tcode{i})$ be
 \begin{itemize}
 \item \tcode{bool(*i == value)} for \tcode{remove};
 \item \tcode{bool(pred(*i))} for \tcode{remove_if};
@@ -7621,7 +7600,7 @@
 \pnum
 \effects
 Eliminates all the elements referred to by iterator \tcode{i}
-in the range \range{first}{last} for which $E$ holds.
+in the range \range{first}{last} for which $E(\tcode{i})$ holds.
 
 \pnum
 \returns
@@ -7701,7 +7680,7 @@
          class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>>
   requires @\libconcept{indirectly_copyable}@<iterator_t<R>, iterator_t<OutR>> &&
            @\libconcept{indirect_binary_predicate}@<ranges::equal_to,
-                                      projected<iterator_t<R>, Proj>, const T*>
+                                     projected<iterator_t<R>, Proj>, const T*>
   ranges::remove_copy_result<borrowed_iterator_t<R>, borrowed_iterator_t<OutR>>
     ranges::remove_copy(Ep&& exec, R&& r, OutR&& result_r, const T& value, Proj proj = {});
 
@@ -9076,7 +9055,7 @@
          @\libconcept{random_access_iterator}@ I2, @\libconcept{sized_sentinel_for}@<I2> S2,
          class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
   requires @\libconcept{indirectly_copyable}@<I1, I2> && @\libconcept{sortable}@<I2, Comp, Proj2> &&
-            @\libconcept{indirect_strict_weak_order}@<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
+           @\libconcept{indirect_strict_weak_order}@<Comp, projected<I1, Proj1>, projected<I2, Proj2>>
   ranges::partial_sort_copy_result<I1, I2>
     ranges::partial_sort_copy(Ep&& exec, I1 first, S1 last, I2 result_first, S2 result_last,
                               Comp comp = {}, Proj1 proj1 = {},
@@ -9281,7 +9260,7 @@
          class Proj = identity,
          @\libconcept{indirect_strict_weak_order}@<projected<I, Proj>> Comp = ranges::less>
   I ranges::is_sorted_until(Ep&& exec, I first, S last, Comp comp = {},
-                    Proj proj = {});
+                            Proj proj = {});
 template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, class Proj = identity,
          @\libconcept{indirect_strict_weak_order}@<projected<iterator_t<R>, Proj>> Comp = ranges::less>
   borrowed_iterator_t<R>
@@ -9892,7 +9871,7 @@
          class Proj = identity,
          @\libconcept{indirect_unary_predicate}@<projected<iterator_t<R>, Proj>> Pred>
   requires @\libconcept{indirectly_copyable}@<iterator_t<R>, iterator_t<OutR1>> &&
-            @\libconcept{indirectly_copyable}@<iterator_t<R>, iterator_t<OutR2>>
+           @\libconcept{indirectly_copyable}@<iterator_t<R>, iterator_t<OutR2>>
   ranges::partition_copy_result<borrowed_iterator_t<R>, borrowed_iterator_t<OutR1>,
                                 borrowed_iterator_t<OutR2>>
     ranges::partition_copy(Ep&& exec, R&& r, OutR1&& out_true_r, OutR2&& out_false_r,
@@ -10340,7 +10319,7 @@
 template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R1, @\exposconcept{sized-random-access-range}@ R2,
          class Proj1 = identity, class Proj2 = identity,
          @\libconcept{indirect_strict_weak_order}@<projected<iterator_t<R1>, Proj1>,
-                                     projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
+                                    projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
   bool ranges::includes(Ep&& exec, R1&& r1, R2&& r2,
                         Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
 \end{itemdecl}
@@ -13510,7 +13489,7 @@
 \remarks
 A function call expression
 that violates the precondition in the \Fundescx{Preconditions} element
-is not a core constant expression\iref{expr.const}.
+is not a core constant expression\iref{expr.const.core}.
 \end{itemdescr}
 
 \rSec3[numeric.sat.cast]{Casting}

source/back.tex

@@ -7,10 +7,6 @@
 \bibitem{iso4217}
   ISO 4217:2015,
   \doccite{Codes for the representation of currencies}
-\bibitem{iso10967-1}
-  ISO/IEC 10967-1:2012,
-  \doccite{Information technology --- Language independent arithmetic ---
-    Part 1: Integer and floating point arithmetic}
 \bibitem{iso14882:2023}
   ISO/IEC 14882:2023,
   \doccite{Programming Languages --- \Cpp{}}