LWG3355 The memory algorithms should support move-only input iterators introduced by P1207

Author: Dawn Perchik

source/utilities.tex

@@ -8426,7 +8426,7 @@
 for (; ifirst != ilast && ofirst != olast; ++ofirst, (void)++ifirst) {
   ::new (@\placeholdernc{voidify}@(*ofirst)) remove_reference_t<iter_reference_t<O>>(*ifirst);
 }
-return {ifirst, ofirst};
+return {std::move(ifirst), ofirst};
 \end{codeblock}
 \end{itemdescr}
 
@@ -8478,7 +8478,7 @@
 \begin{codeblock}
 auto t = uninitialized_copy(counted_iterator(ifirst, n),
                             default_sentinel, ofirst, olast);
-return {t.in.base(), t.out};
+return {std::move(t.in).base(), t.out};
 \end{codeblock}
 \end{itemdescr}
 
@@ -8535,7 +8535,7 @@
   ::new (@\placeholder{voidify}@(*ofirst))
     remove_reference_t<iter_reference_t<O>>(ranges::iter_move(ifirst));
 }
-return {ifirst, ofirst};
+return {std::move(ifirst), ofirst};
 \end{codeblock}
 
 \pnum
@@ -8590,7 +8590,7 @@
 \begin{codeblock}
 auto t = uninitialized_move(counted_iterator(ifirst, n),
                             default_sentinel, ofirst, olast);
-return {t.in.base(), t.out};
+return {std::move(t.in).base(), t.out};
 \end{codeblock}
 
 \pnum