频道栏目
首页 > 资讯 > 其他 > 正文

STL_算法(21)_ STL_算法_填充新值

16-08-22        来源:[db:作者]  
收藏   我要投稿

STL_算法_填充新值

fill(b, e, v)

fill(b, n, v)

generate(b, n, p)

generate_n(b, n, p)

 

#include
#include
#include
#include
//
#include

using namespace std;

int main()
{
	list slist;
	slist.push_back("hello");
	slist.push_back("hi");
	slist.push_back("good mornig");

	// fill   fill_n 算法只能填充固定值 
	fill(slist.begin(), slist.end(), "hao");

	for (list::iterator iter = slist.begin(); iter != slist.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	list slist2;
	fill_n(back_inserter(slist2), 9, "hello");
	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	fill_n(ostream_iterator(cout, " "), 10, 7.7);
	cout << endl;

	fill(slist2.begin(), slist2.end(), "again");

	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	fill_n(slist2.begin(), slist2.size() - 2, "hi");
	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	list::iterator pos1, pos2;
	pos1 = slist2.begin(); 
	pos2 = slist2.end();

	fill(++pos1, --pos2, "hmmm");
	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;
	//
	system("pause");
	return 0;
}

 

 


#include
#include
#include
#include
//
#include

using namespace std;

int main()
{
	list slist;
	slist.push_back("hello");
	slist.push_back("hi");
	slist.push_back("good mornig");

	// fill   fill_n 算法只能填充固定值 
	fill(slist.begin(), slist.end(), "hao");

	for (list::iterator iter = slist.begin(); iter != slist.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	list slist2;
	fill_n(back_inserter(slist2), 9, "hello");
	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	fill_n(ostream_iterator(cout, " "), 10, 7.7);
	cout << endl;

	fill(slist2.begin(), slist2.end(), "again");

	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	fill_n(slist2.begin(), slist2.size() - 2, "hi");
	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	list::iterator pos1, pos2;
	pos1 = slist2.begin(); 
	pos2 = slist2.end();

	fill(++pos1, --pos2, "hmmm");
	for (list::iterator iter = slist2.begin(); iter != slist2.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	list ilist;

	// back_inserter()  插入迭代器
	generate_n(back_inserter(ilist), 5, rand);
	for (list::iterator iter = ilist.begin(); iter != ilist.end(); iter++)
		cout << *iter << ' ';
	cout << endl;

	generate(ilist.begin(), ilist.end(), rand);
	for (list::iterator iter = ilist.begin(); iter != ilist.end(); iter++)
		cout << *iter << ' ';
	cout << endl;



	//
	system("pause");
	return 0;
}

相关TAG标签
上一篇:Java数据结构
下一篇:C++ STL学习——list
相关文章
图文推荐

关于我们 | 联系我们 | 广告服务 | 投资合作 | 版权申明 | 在线帮助 | 网站地图 | 作品发布 | Vip技术培训 | 举报中心

版权所有: 红黑联盟--致力于做实用的IT技术学习网站