Skip to content

Search topics & cppreference

Search all study topics, concept maps, and 6,587 C++ and C reference pages.

std::ranges::fill_n

Assigns the given value to all elements in the range [first, first + n).

Algorithms
  • C++20
  • C++26
2 min readView on cppreference
NotebookLM
Defined in header <algorithm>
Call signature
template< class T, std::output_iterator<const T&> O >
constexpr O fill_n( O first, std::iter_difference_t<O> n, const T& value );
(since C++20)
(until C++26)
template< class O, class T = std::iter_value_t<O> >
requires std::output_iterator<O, const T&>
constexpr O fill_n( O first, std::iter_difference_t<O> n, const T& value );
(since C++26)

Assigns the given value to all elements in the range [first, first + n).

The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is:

Parameters

first - the beginning of the range of elements to modify
n - number of elements to modify
value - the value to be assigned

Return value

An output iterator that compares equal to first + n.

Complexity

Exactly n assignments.

Possible implementation

snippet.cpp
struct fill_n_fn
{
    template<class O, class T = std::iter_value_t<O>>
    requires std::output_iterator<O, const T&>
    constexpr O operator()(O first, std::iter_difference_t<O> n, const T& value) const
    {
        for (std::iter_difference_t<O> i {}; i != n; ++first, ++i)
            *first = value;
        return first;
    }
};
 
inline constexpr fill_n_fn fill_n {};

Notes

Feature-test macro Value Std Feature
__cpp_lib_algorithm_default_value_type 202403 (C++26) List-initialization for algorithms

Example

example.cpp
#include <algorithm>
#include <complex>
#include <iostream>
#include <string>
#include <vector>
 
void println(const auto& v)
{
    for (const auto& elem : v)
        std::cout << ' ' << elem;
    std::cout << '\n';
}
 
int main()
{
    constexpr auto n{8};
 
    std::vector<std::string> v(n, "▓▓░░");
    println(v);
 
    std::ranges::fill_n(v.begin(), n, "░░▓▓");
    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_n(nums.begin(), 2, {4, 2});
    #else
        std::ranges::fill_n(nums.begin(), 2, std::complex<double>{4, 2});
    #endif
    println(nums);
}
Output

 ▓▓░░ ▓▓░░ ▓▓░░ ▓▓░░ ▓▓░░ ▓▓░░ ▓▓░░ ▓▓░░
 ░░▓▓ ░░▓▓ ░░▓▓ ░░▓▓ ░░▓▓ ░░▓▓ ░░▓▓ ░░▓▓
 (1,3) (2,2) (4,8)
 (4,2) (4,2) (4,8)

See also

assigns a range of elements a certain value
(algorithm function object)
copies a number of elements to a new location
(algorithm function object)
saves the result of a function in a range
(algorithm function object)
applies a function to a range of elements
(algorithm function object)
fills a range with random numbers from a uniform random bit generator
(algorithm function object)
copy-assigns the given value to N elements in a range
(function template)

Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.