Skip to content

[2026-03 LWG Motion 26] P3787R2 Adjoints to "Enabling list-initialization for algorithms": uninitialized_fill #8905

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
jensmaurer wants to merge 2 commits into
base: main
Choose a base branch
from
+24 −17
Open

[2026-03 LWG Motion 26] P3787R2 Adjoints to "Enabling list-initialization for algorithms": uninitialized_fill #8905

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
7b50fa3
P3787R2 Adjoints to "Enabling list-initialization for algorithms": un…
jensmaurer Apr 1, 2026
76bc46e
fixup: use range_value_t<R>
jensmaurer Apr 3, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 7 additions & 5 deletions source/algorithms.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14130,7 +14130,8 @@

\indexlibraryglobal{uninitialized_fill}%
\begin{itemdecl}
template<class NoThrowForwardIterator, class T>
template<class NoThrowForwardIterator,
class T = iterator_traits<NoThrowForwardIterator>::value_type>
constexpr void uninitialized_fill(NoThrowForwardIterator first,
NoThrowForwardIterator last, const T& x);
\end{itemdecl}
Expand All @@ -14148,10 +14149,10 @@
\indexlibraryglobal{uninitialized_fill}%
\begin{itemdecl}
namespace ranges {
template<@\exposconcept{nothrow-forward-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@<I> S, class T>
template<@\exposconcept{nothrow-forward-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@<I> S, class T = iter_value_t<I>>
requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
constexpr I uninitialized_fill(I first, S last, const T& x);
template<@\exposconcept{nothrow-forward-range}@ R, class T>
template<@\exposconcept{nothrow-forward-range}@ R, class T = range_value_t<R>>
requires @\libconcept{constructible_from}@<range_value_t<R>, const T&>
constexpr borrowed_iterator_t<R> uninitialized_fill(R&& r, const T& x);
}
Expand All @@ -14170,7 +14171,8 @@

\indexlibraryglobal{uninitialized_fill_n}%
\begin{itemdecl}
template<class NoThrowForwardIterator, class Size, class T>
template<class NoThrowForwardIterator, class Size,
class T = iterator_traits<NoThrowForwardIterator>::value_type>
constexpr NoThrowForwardIterator
uninitialized_fill_n(NoThrowForwardIterator first, Size n, const T& x);
\end{itemdecl}
Expand All @@ -14189,7 +14191,7 @@
\indexlibraryglobal{uninitialized_fill_n}%
\begin{itemdecl}
namespace ranges {
template<@\exposconcept{nothrow-forward-iterator}@ I, class T>
template<@\exposconcept{nothrow-forward-iterator}@ I, class T = iter_value_t<I>>
requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
constexpr I uninitialized_fill_n(I first, iter_difference_t<I> n, const T& x);
}
Expand Down
25 changes: 15 additions & 10 deletions source/memory.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -413,47 +413,52 @@
O ofirst, S olast); // see \ref{algorithms.parallel.overloads}
}

template<class NoThrowForwardIterator, class T>
template<class NoThrowForwardIterator,
class T = iterator_traits<NoThrowForwardIterator>::value_type>
constexpr void uninitialized_fill(NoThrowForwardIterator first, // freestanding
NoThrowForwardIterator last, const T& x);
template<class ExecutionPolicy, class NoThrowForwardIterator, class T>
template<class ExecutionPolicy, class NoThrowForwardIterator,
class T = iterator_traits<NoThrowForwardIterator>::value_type>
void uninitialized_fill(ExecutionPolicy&& exec, // freestanding-deleted,
NoThrowForwardIterator first, // see \ref{algorithms.parallel.overloads}
NoThrowForwardIterator last,
const T& x);
template<class NoThrowForwardIterator, class Size, class T>
template<class NoThrowForwardIterator, class Size,
class T = iterator_traits<NoThrowForwardIterator>::value_type>
constexpr NoThrowForwardIterator
uninitialized_fill_n(NoThrowForwardIterator first, Size n, const T& x); // freestanding
template<class ExecutionPolicy, class NoThrowForwardIterator, class Size, class T>
template<class ExecutionPolicy, class NoThrowForwardIterator, class Size,
class T = iterator_traits<NoThrowForwardIterator>::value_type>
NoThrowForwardIterator
uninitialized_fill_n(ExecutionPolicy&& exec, // freestanding-deleted,
NoThrowForwardIterator first, // see \ref{algorithms.parallel.overloads}
Size n, const T& x);

namespace ranges {
template<@\exposconcept{nothrow-forward-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@<I> S, class T>
template<@\exposconcept{nothrow-forward-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@<I> S, class T = iter_value_t<I>>
requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
constexpr I uninitialized_fill(I first, S last, const T& x); // freestanding
template<@\exposconcept{nothrow-forward-range}@ R, class T>
template<@\exposconcept{nothrow-forward-range}@ R, class T = range_value_t<R>>
requires @\libconcept{constructible_from}@<range_value_t<R>, const T&>
constexpr borrowed_iterator_t<R> uninitialized_fill(R&& r, const T& x); // freestanding

template<@\exposconcept{nothrow-forward-iterator}@ I, class T>
template<@\exposconcept{nothrow-forward-iterator}@ I, class T = iter_value_t<I>>
requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
constexpr I uninitialized_fill_n(I first, // freestanding
iter_difference_t<I> n, const T& x);

template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I,
@\exposconcept{nothrow-sized-sentinel-for}@<I> S, class T>
@\exposconcept{nothrow-sized-sentinel-for}@<I> S, class T = iter_value_t<I>>
requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
I uninitialized_fill(Ep&& exec, I first, S last, const T& x); // freestanding-deleted,
// see \ref{algorithms.parallel.overloads}
template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-sized-random-access-range}@ R, class T>
template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-sized-random-access-range}@ R,
class T = range_value_t<R>>
requires @\libconcept{constructible_from}@<range_value_t<R>, const T&>
borrowed_iterator_t<R> uninitialized_fill(Ep&& exec, R&& r, // freestanding-deleted,
const T& x); // see \ref{algorithms.parallel.overloads}

template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, class T>
template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, class T = iter_value_t<I>>
requires @\libconcept{constructible_from}@<iter_value_t<I>, const T&>
I uninitialized_fill_n(Ep&& exec, I first, // freestanding-deleted,
iter_difference_t<I> n, const T& x); // see \ref{algorithms.parallel.overloads}
Expand Down
4 changes: 2 additions & 2 deletions source/support.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -568,8 +568,8 @@
\begin{codeblock}
#define @\defnlibxname{cpp_lib_adaptor_iterator_pair_constructor}@ 202106L // also in \libheader{stack}, \libheader{queue}
#define @\defnlibxname{cpp_lib_addressof_constexpr}@ 201603L // freestanding, also in \libheader{memory}
#define @\defnlibxname{cpp_lib_algorithm_default_value_type}@ 202403L
// also in \libheader{algorithm}, \libheader{ranges}, \libheader{string}, \libheader{deque}, \libheader{list}, \libheader{forward_list}, \libheader{vector}
#define @\defnlibxname{cpp_lib_algorithm_default_value_type}@ 202603L
// also in \libheader{algorithm}, \libheader{ranges}, \libheader{string}, \libheader{deque}, \libheader{list}, \libheader{forward_list}, \libheader{vector}, \libheader{memory}
#define @\defnlibxname{cpp_lib_algorithm_iterator_requirements}@ 202207L
// also in \libheader{algorithm}, \libheader{numeric}, \libheader{memory}
#define @\defnlibxname{cpp_lib_aligned_accessor}@ 202411L // freestanding, also in \libheader{mdspan}
Expand Down
Loading