STLalgorithm算法fill(14)
原文地址:http://www.cplusplus.com/reference/algorithm/fill/
function template
std::fill
template <class ForwardIterator, class T>
void fill (ForwardIterator first, ForwardIterator last, const T& val);
Fill range with value
Assigns val to all the elements in the range [first,last)
.使用val填满范围内的元素。
例子:
#include
#include
#include
#include
using namespace std;
void fill2(){
vector
cout<<”at first,vi=”;
for(int &i:vi)
cout<<i<<” “;
cout<<endl;
fill(vi.begin(),vi.end()-3,1000);
cout<<"after fill(vi.begin(),vi.end()-3,1000),\\nvi=";
for(int &i:vi)
cout<<i<<" ";
cout<<endl;
}
运行截图:
The behavior of this function template is equivalent to:
1 | 1 |
1 | template <class ForwardIterator, class T> |
Parameters
first, last
Forward iterators to the initial and final positions in a sequence of elements that support being assigned a value of type T. The range filled is [first,last)
, which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.
要填充的范围。
val
Value to assign to the elements in the filled range.
填充的值。
Return value
none
Example
1 | 1 |
1 | // fill algorithm example |
Output:
myvector contains: 5 5 5 8 8 8 0 0
Complexity
Linear in the distance between first and last: Assigns a value to each element.
Data races
The objects in the range [first,last)
are modified (each object is accessed exactly once).
Exceptions
Throws if either an element assignment or an operation on an iterator throws.
Note that invalid arguments cause undefined behavior.
——————————————————————————————————————————————————————————————————
//写的错误或者不好的地方请多多指导,可以在下面留言或者点击左上方邮件地址给我发邮件,指出我的错误以及不足,以便我修改,更好的分享给大家,谢谢。
转载请注明出处:http://blog.csdn.net/qq844352155
author:天下无双
Email:coderguang@gmail.com
2014-9-11
于GDUT
——————————————————————————————————————————————————————————————————
- 本文作者: royalchen
- 本文链接: http://www.royalchen.com/2016/02/24/stlalgorithm算法fill14/
- 版权声明: 本博客所有文章除特别声明外,均采用 MIT 许可协议。转载请注明出处!