Copies value to an uninitialized memory area first +
[
â0â,
count)
as if by return ranges::uninitialized_fill(std::counted_iterator(first, count),
std::default_sentinel, value).base();
If an exception is thrown during the initialization, the objects already constructed are destroyed in an unspecified order.
The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is:
As described above.
[edit] ComplexityLinear in count.
[edit] ExceptionsAny exception thrown on construction of the elements in the destination range.
[edit] NotesAn implementation may improve the efficiency of the ranges::uninitialized_fill_n
, e.g. by using ranges::fill_n, if the value type of the output range is TrivialType.
#include <iostream> #include <memory> #include <string> int main() { constexpr int n{3}; alignas(alignof(std::string)) char out[n * sizeof(std::string)]; try { auto first{reinterpret_cast<std::string*>(out)}; auto last = std::ranges::uninitialized_fill_n(first, n, "cppreference"); for (auto it{first}; it != last; ++it) std::cout << *it << '\n'; std::ranges::destroy(first, last); } catch (...) { std::cout << "Exception!\n"; } }
Output:
cppreference cppreference cppreference[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR Applied to Behavior as published Correct behavior LWG 3870 C++20 this algorithm might create objects on a const storage kept disallowed [edit] See alsoRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4