Call signature
(1) (since C++20)1) Assigns the given value to the elements in the range [
first,
last)
.
The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is:
An output iterator that compares equal to last.
[edit] ComplexityExactly last - first assignments.
[edit] Possible implementationstruct fill_fn { template<class O, std::sentinel_for<O> S, class T = std::iter_value_t<O>> requires std::output_iterator<O, const T&> constexpr O operator()(O first, S last, const T& value) const { while (first != last) *first++ = value; return first; } template<class R, class T = ranges::range_value_t<R>> requires ranges::output_range<R, const T&> constexpr ranges::borrowed_iterator_t<R> operator()(R&& r, const T& value) const { return (*this)(ranges::begin(r), ranges::end(r), value); } }; inline constexpr fill_fn fill;[edit] Notes [edit] Example
#include <algorithm> #include <complex> #include <iostream> #include <vector> void println(const auto& seq) { for (const auto& e : seq) std::cout << e << ' '; std::cout << '\n'; } int main() { std::vector<int> v{0, 1, 2, 3, 4, 5}; // set all elements to -1 using overload (1) std::ranges::fill(v.begin(), v.end(), -1); println(v); // set all element to 10 using overload (2) std::ranges::fill(v, 10); println(v); std::vector<std::complex<double>> nums{{1, 3}, {2, 2}, {4, 8}}; println(nums); #ifdef __cpp_lib_algorithm_default_value_type std::ranges::fill(nums, {4, 2}); // T gets deduced #else std::ranges::fill(nums, std::complex<double>{4, 2}); #endif println(nums); }
Output:
-1 -1 -1 -1 -1 -1 10 10 10 10 10 10 (1,3) (2,2) (4,8) (4,2) (4,2) (4,2)[edit] See also
RetroSearch 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