Algorithm - fill()

원본)

//기본형
template <class ForwardIterator, class T>
  void fill (ForwardIterator first, ForwardIterator last, const T& val);

의미)

[Iterator first, Iterator last)사이에 있는 모든 원소들을 val로 교체합니다.

소스)

#include<iostream>
#include<algorithm>
#include<vector>
 
void Print(const std::vector<int>& target)
{
    for (std::vector<int>::const_iterator iterPos = target.begin(); iterPos != target.cend(); iterPos++)
        std::cout << *iterPos << ' ';
    std::cout << std::endl;
}
 
void main()
{
    std::vector<int> vector(10);
 
    std::cout << "Vector --->"; Print(vector);
    std::fill(vector.begin(), vector.begin() + 3, 5);
    std::cout << "Vector --->"; Print(vector);
}

리턴값)

없음

결과)