# std::fill

> C++ Atlas: `cppatlas.com/w/cpp/algorithm/fill` | Source: https://en.cppreference.com/w/cpp/algorithm/fill | Domain: Algorithms | Standards: C++11, C++17, C++20, C++26

If value is not writable to first, the program is ill-formed.

## Official Specification Summary (cppreference)

```cpp
// Defined in header <algorithm>

template< class ForwardIt, class T >
void fill( ForwardIt first, ForwardIt last, const T& value ); // (1) (constexpr since C++20) (until C++26)

template< class ForwardIt, class T = typename std::iterator_traits
                                         <ForwardIt>::value_type >
constexpr void fill( ForwardIt first, ForwardIt last,
                     const T& value ); // (1) (since C++26)

template< class ExecutionPolicy, class ForwardIt, class T >
void fill( ExecutionPolicy&& policy,
           ForwardIt first, ForwardIt last, const T& value ); // (2) (since C++17) (until C++26)

template< class ExecutionPolicy,
          class ForwardIt, class T = typename std::iterator_traits
                                         <ForwardIt>::value_type >
void fill( ExecutionPolicy&& policy,
           ForwardIt first, ForwardIt last, const T& value ); // (2) (since C++26)
```

1) Assigns the given `value` to all elements in the range `[first,` `last)`.

2) Same as (1), but executed according to `policy`.

This overload participates in overload resolution only if all following conditions are satisfied:

   `std::is_execution_policy_v<std::decay_t<ExecutionPolicy>>` is `true`. (until C++20)

   `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `true`. (since C++20)

If `value` is not writable to `first`, the program is ill-formed.

### Parameters

- `first, last` - the range of elements to modify
- `value` - the value to be assigned
- `policy` - the execution policy to use

**Type requirements**

- `ForwardIt` must meet the requirements of *LegacyForwardIterator*.

### Complexity

Exactly `std::distance(first, last)` assignments.

### Exceptions

The overload with a template parameter named `ExecutionPolicy` reports errors as follows:

- If execution of a function invoked as part of the algorithm throws an exception and `ExecutionPolicy` is one of the standard policies, `std::terminate` is called. For any other `ExecutionPolicy`, the behavior is implementation-defined.
- If the algorithm fails to allocate memory, `std::bad_alloc` is thrown.

### Possible implementation

```cpp
template<class ForwardIt,
         class T = typename std::iterator_traits<ForwardIt>::value_type>
void fill(ForwardIt first, ForwardIt last, const T& value)
{
    for (; first != last; ++first)
        *first = value;
}
```

### Notes

| Feature-test macro | Value | Std | Feature |
| --- | --- | --- | --- |
| `__cpp_lib_algorithm_default_value_type` | `202403` | (C++26) | List-initialization for algorithms (1,2) |

### Example

```cpp
#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, 6, 7, 8};
    println(v);

    // set all of the elements to 8
    std::fill(v.begin(), v.end(), 8);
    println(v);

    std::vector<std::complex<double>> nums{{1, 3}, {2, 2}, {4, 8}};
    println(nums);
    #ifdef __cpp_lib_algorithm_default_value_type
        std::fill(nums.begin(), nums.end(), {4, 2});
    #else
        std::fill(nums.begin(), nums.end(), std::complex<double>{4, 2});
    #endif
    println(nums);
}
```

Output:

```text
0 1 2 3 4 5 6 7 8
8 8 8 8 8 8 8 8 8
(1,3) (2,2) (4,8)
(4,2) (4,2) (4,2)
```

### 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 283 | C++98 | `T` was required to be *CopyAssignable*, but `T` is not always writable to `ForwardIt` | required to be writable instead |

### See also

- [`fill_n`](https://en.cppreference.com/w/cpp/algorithm/fill_n): copy-assigns the given value to N elements in a range (function template)
- [`copy`](https://en.cppreference.com/w/cpp/algorithm/copy), [`copy_if`](https://en.cppreference.com/w/cpp/algorithm/copy) (C++11): copies a range of elements to a new location (function template)
- [`generate`](https://en.cppreference.com/w/cpp/algorithm/generate): assigns the results of successive function calls to every element in a range (function template)
- [`transform`](https://en.cppreference.com/w/cpp/algorithm/transform): applies a function to a range of elements, storing results in a destination range (function template)
- [`ranges::fill`](https://en.cppreference.com/w/cpp/algorithm/ranges/fill) (C++20): assigns a range of elements a certain value (algorithm function object)

---
Attribution: content from https://en.cppreference.com/w/cpp/algorithm/fill (cppreference.com), licensed under CC-BY-SA 3.0 and GFDL. Modified: converted to markdown, study notes added. Offline snapshot of 9 February 2025.