3#ifndef TETL_ALGORITHM_FILL_N_HPP
4#define TETL_ALGORITHM_FILL_N_HPP
15template <
typename OutputIt,
typename Size,
typename T>
16constexpr auto fill_n(OutputIt first, Size
count, T
const& value) -> OutputIt
18 for (
auto i = Size{0}; i <
count; ++i) {
constexpr auto count(InputIt first, InputIt last, T const &value) -> typename iterator_traits< InputIt >::difference_type
Returns the number of elements in the range [first, last) satisfying specific criteria....
Definition count.hpp:21
constexpr auto fill_n(OutputIt first, Size count, T const &value) -> OutputIt
Assigns the given value to the first count elements in the range beginning at first if count > 0....
Definition fill_n.hpp:16
Definition adjacent_find.hpp:8