[algorithm.syn] Fixed transcription errors in various types

Author: tkoeppe

source/algorithms.tex

@@ -1617,7 +1617,7 @@
         search_n(Ep&& exec, I first, S last, iter_difference_t<I> count,
                  const T& value, Pred pred = {}, Proj proj = {});           // freestanding-deleted
     template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, class Pred = ranges::equal_to,
-             class Proj = identity, class T = projected_value_t<I, Proj>>
+             class Proj = identity, class T = projected_value_t<iterator_t<R>, Proj>>
       requires @\libconcept{indirectly_comparable}@<iterator_t<R>, const T*, Pred, Proj>
       borrowed_subrange_t<R>
         search_n(Ep&& exec, R&& r, range_difference_t<R> count,
@@ -2141,7 +2141,7 @@
       I replace_if(Ep&& exec, I first, S last, Pred pred,
                    const T& new_value, Proj proj = {});         // freestanding-deleted
     template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{sized-random-access-range}@ R, class Proj = identity,
-             class T = projected_value_t<I, Proj>,
+             class T = projected_value_t<iterator_t<R>, Proj>,
              @\libconcept{indirect_unary_predicate}@<projected<iterator_t<R>, Proj>> Pred>
       requires @\libconcept{indirectly_writable}@<iterator_t<R>, const T&>
       borrowed_iterator_t<R>
@@ -2241,7 +2241,7 @@
              class T = range_value_t<OutR>, class Proj = identity,
              @\libconcept{indirect_unary_predicate}@<projected<iterator_t<R>, Proj>> Pred>
       requires @\libconcept{indirectly_copyable}@<iterator_t<R>, iterator_t<OutR>> &&
-               @\libconcept{indirectly_writable}@<OutR, const T&>
+               @\libconcept{indirectly_writable}@<iterator_t<OutR>, const T&>
       replace_copy_if_result<borrowed_iterator_t<R>, borrowed_iterator_t<OutR>>
         replace_copy_if(Ep&& exec, R&& r, OutR&& result_r, Pred pred, const T& new_value,
                         Proj proj = {});                                    // freestanding-deleted
@@ -3655,7 +3655,7 @@
              @\libconcept{random_access_iterator}@ O, @\libconcept{sized_sentinel_for}@<O> OutS, class Comp = ranges::less,
              class Proj1 = identity, class Proj2 = identity>
       requires @\libconcept{mergeable}@<I1, I2, O, Comp, Proj1, Proj2>
-      set_difference_result<I1, I2, O>
+      set_difference_result<I1, O>
         set_difference(Ep&& exec, I1 first1, S1 last1, I2 first2, S2 last2,
                        O result, OutS result_last, Comp comp = {}, Proj1 proj1 = {},
                        Proj2 proj2 = {});                       // freestanding-deleted
@@ -3664,8 +3664,7 @@
              class Proj1 = identity, class Proj2 = identity>
       requires @\libconcept{mergeable}@<iterator_t<R1>, iterator_t<R2>, iterator_t<OutR>,
                         Comp, Proj1, Proj2>
-      set_difference_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>,
-                            borrowed_iterator_t<OutR>>
+      set_difference_result<borrowed_iterator_t<R1>, borrowed_iterator_t<OutR>>
         set_difference(Ep&& exec, R1&& r1, R2&& r2, OutR&& result_r, Comp comp = {},
                        Proj1 proj1 = {}, Proj2 proj2 = {});     // freestanding-deleted
   }