list模板类的主要函数介绍

list模板类的主要函数介绍

back()
//返回最后一个元素
assign()
//给list赋值
begin()
//返回指向第一个元素的迭代器
clear()
//删除所有元素
empty()
//如果list是空的则返回true
end()
//返回末尾的迭代器
end() //返回末尾的迭代器
front()
//返回第一个元素
get_allocator()
//返回list的配置器
insert()
//插入一个元素到list中
max_size()
//返回list能容纳的最大元素数量
merge()
//合并两个list
pop_back()
//删除最后一个元素
pop_front()
//删除第一个元素
push_back()
//在list的末尾添加一个元素

push_front() //在list的头部添加一个元素
rbegin()
//返回指向第一个元素的逆向迭代器
remove_if()
//按指定条件删除元素
remove()
//从list删除元素
rend()
//指向list末尾的逆向迭代器
resize()
//改变list的大小
reverse()
//把list的元素倒转
size()
//返回list中的元素个数
sort()
//给list排序
splice()
//合并两个list
swap()
//交换两个list
unique()
//删除list中重复的元素

我是在c++builder中使用：
#include <iostream>

#include <list>

#include <numeric>

#include <algorithm>

using namespace std;

typedef list<int> LISTINT;

typedef list<int> LISTCHAR;

typedef list<int> INTLIST;
void __fastcall TForm1::btn1Click(TObject *Sender)

{
//用list容器处理整型数据

//用LISTINT创建一个名为listOne的list对象

LISTINT listOne;

//声明i为迭代器

LISTINT::iterator i;

//从前面向listOne容器中添加数据

listOne.push_front(2);

listOne.push_front(1);

//从后面向listOne容器中添加数据

listOne.push_back(3);

listOne.push_back(4);

//从前向后显示listOne中的数据

//cout<<"listOne.begin()--- listOne.end():"<<endl;

AnsiString str="";

for (i = listOne.begin(); i != listOne.end(); ++i){

//cout << *i << " ";

str += IntToStr(*i);

}

// cout << endl;

//从后向后显示listOne中的数据

LISTINT::reverse_iterator ir;

cout<<"listOne.rbegin()---listOne.rend():"<<endl;

str="";

for (ir =listOne.rbegin(); ir!=listOne.rend();ir++){

//cout << *ir << " ";

str += IntToStr(*ir);

}

//cout << endl;

//使用STL的accumulate(累加)算法

int result = accumulate(listOne.begin(),listOne.end(),0);

cout<<"Sum="<<result<<endl;

cout<<"------------------"<<endl;

//用list容器处理字符型数据

LISTCHAR listTwo;

//声明i为迭代器

LISTCHAR::iterator j;

listTwo.push_front ('A');

listTwo.push_front ('B');

//从后面向listTwo容器中添加数据

listTwo.push_back ('x');

listTwo.push_back ('y');

//从前向后显示listTwo中的数据

cout<<"listTwo.begin()---listTwo.end():"<<endl;

str="";

for (j = listTwo.begin(); j != listTwo.end(); ++j){

// cout << char(*j) << " ";

str += char(*j);

}

//cout << endl;

//使用STL的max_element算法求listTwo中的最大元素并显示

j=max_element(listTwo.begin(),listTwo.end());

//cout << "The maximum element in listTwo is: "<<char(*j)<<endl;

char maxc = char(*j);

//list1对象初始为空

INTLIST list1;

//list2对象最初有10个值为6的元素

INTLIST list2(10,6);

//list3对象最初有9个值为6的元素

INTLIST list3(list2.begin(),--list2.end());

//从前向后显示各list对象的元素

str=put_list(list1,"list1");

str="";

str=put_list(list2,"list2");

str="";

str=put_list(list3,"list3");

str="";

//从list1序列后面添加两个元素

list1.push_back(2);

list1.push_back(4);

cout<<"list1.push_back(2) and list1.push_back(4):"<<endl;

str=put_list(list1,"list1");

str="";

//从list1序列前面添加两个元素

list1.push_front(5);

list1.push_front(7);

cout<<"list1.push_front(5) and list1.push_front(7):"<<endl;

str=put_list(list1,"list1");

str="";

//在list1序列中间插入数据

list1.insert(++list1.begin(),3,9); //Inserts 3 copies of 9 before ++list1.begin().

cout<<"list1.insert(list1.begin()+1,3,9):"<<endl;

str=put_list(list1,"list1");

str="";

//测试引用类函数

cout<<"list1.front()="<<list1.front()<<endl;

cout<<"list1.back()="<<list1.back()<<endl;

str = IntToStr(list1.front());

str="";

str=IntToStr(list1.back());

str="";

//从list1序列的前后各移去一个元素

list1.pop_front();

list1.pop_back();

cout<<"list1.pop_front() and list1.pop_back():"<<endl;

str=put_list(list1,"list1");

str="";

//清除list1中的第2个元素

list1.erase(++list1.begin());

cout<<"list1.erase(++list1.begin()):"<<endl;

str=put_list(list1,"list1");

str="";

//对list2赋值并显示

list2.assign(8,1); //Erases all elements contained in self, then inserts 8 instances of the value of 1.

cout<<"list2.assign(8,1):"<<endl;

str=put_list(list2,"list2");

str="";

//显示序列的状态信息

cout<<"list1.max_size(): "<<list1.max_size()<<endl;

cout<<"list1.size(): "<<list1.size()<<endl;

cout<<"list1.empty(): "<<list1.empty()<<endl;

str=IntToStr(list1.max_size());

str="";

str=IntToStr(list1.size());

str="";

str=IntToStr(list1.empty());

str="";

//list序列容器的运算

str=put_list(list1,"list1");

str="";

str=put_list(list3,"list3");

str="";

cout<<"list1>list3: "<<(list1>list3)<<endl;

cout<<"list1<list3: "<<(list1<list3)<<endl;

BOOL flag = list1>list3;

flag = list1<list3;

//对list1容器排序

list1.sort();

str=put_list(list1,"list1");

str="";

//结合处理

list1.splice(++list1.begin(), list3); //Inserts list3 before ++list1.begin(), leaving list3 empty.

str=put_list(list1,"list1");

str="";

str=put_list(list3,"list3");

str="";

}
//从前向后显示list队列的全部元素

AnsiString TForm1::put_list(INTLIST list, char *name){

INTLIST::iterator plist;

cout << "The contents of " << name << " : ";

AnsiString str="";

for(plist=list.begin();plist!=list.end();plist++){

str += IntToStr(*plist);

}

return str;

}

文章来自：/article/5204817.html