Defined in header <memory> | ||||
---|---|---|---|---|
| (until C++11) | |||
| (since C++11) |
Copies the given value value
to the first count
elements in an uninitialized memory area beginning at first
as if by.
1 2 3 | for (; n--; ++first) :: new ( static_cast < void *>(std::addressof(*first))) typename iterator_traits<ForwardIterator>::value_type(x); |
If an exception is thrown during the initialization, the function has no effects.
Parameters
first | - | the beginning of the range of the elements to initialize |
count | - | number of elements to construct |
value | - | the value to construct the elements with |
Type requirements | ||
- ForwardIt must meet the requirements of ForwardIterator . |
Return value
(none) | (until C++11) |
Iterator to the element past the last element copied. | (since C++11) |
Complexity
Linear in count
.
Possible implementation
|
Example
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | #include <algorithm> #include <iostream> #include <memory> #include <string> #include <tuple> int main() { std::string* p; std:: size_t sz; std::tie(p, sz) = std::get_temporary_buffer<std::string>(4); std::uninitialized_fill_n(p, sz, "Example" ); for (std::string* i = p; i != p+sz; ++i) { std::cout << *i << '\n' ; i->~basic_string< char >(); } std::return_temporary_buffer(p); } |
Output:
1 2 3 4 | Example Example Example Example |
See also
copies an object to an uninitialized area of memory (function template) | |
std::experimental::parallel::uninitialised_fill_n
(parallelism TS) | parallelized version of std::uninitialised_fill_n (function template) |
Please login to continue.