C++11: list容器的迭代及其封装函数的调用

list容器迭代及其封装函数的调用

定义

1. list是可以在常数范围内在任意位置进行插入和删除的序列式容器，并且该容器可以前后双向迭代。
2. list的底层是双向链表结构，双向链表中每个元素存储在互不相关的独立节点中，在节点中通过指针指向 其前一个元素和后一个元素。
3. list与forward_list非常相似：最主要的不同在于forward_list是单链表，只能朝前迭代，已让其更简单高 效。
4. 与其他的序列式容器相比(array，vector，deque)，list通常在任意位置进行插入、移除元素的执行效率 更好。
5. 与其他序列式容器相比，list和forward_list最大的缺陷是不支持任意位置的随机访问。

list迭代器

C++11中提供了正向迭代器和反向迭代器，迭代器的类型可以自动推导，以下我给出了5种迭代的方式

封装函数

list容器实现了双向链表的数据结构，以下代码使用了部分list封装的功能函数，实现对list的插入、删除、合并、清除、交换、排序、查找等功能。

#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<list>
#include<functional>
using namespace std;

int main()
{
	几种迭代方式

	list<int> lt1 = { 0,1,2,3,4,5,6,7,8,9 };
	//c++11
	cout << "lt1 = ";
	for (const auto &e : lt1)
		cout << e << " ";
	cout << endl;
	//手动定义迭代器
	list<int>::iterator it = lt1.begin();
	cout << "lt1 = ";
	while (it != lt1.end())
	{
		cout << *it << " ";
		++it;
	}
	cout << endl;
	//自动推导
	auto it1 = lt1.begin();
	cout << "lt1 = ";
	while (it1 != lt1.end())
	{
		cout << *it1 << " ";
		++it1;
	}
	cout << endl;
	//反向迭代
	cout << "反向迭代" << endl;
	auto it2 = lt1.end();
	--it2;
	while (it2 != lt1.begin())
	{
		cout << *it2 << " ";
		--it2;
	}
	cout <<*it2<<endl;
	//反向迭代器
	list<int>::reverse_iterator rit = lt1.rbegin();
	while (rit != lt1.rend())
	{
		cout << *rit << " ";
		++rit;
	}
	cout << endl << endl;

	///
	//list封装的功能函数
	cout << "大  小：size = " << lt1.size() << endl;
	cout << "头节点：front = " << lt1.front() << endl;
	cout << "尾节点：back = " << lt1.back() << endl;
	lt1.push_back(10);
	lt1.push_front(12);
	lt1.insert(lt1.begin(), 13);
	lt1.insert(lt1.end(), 16);
	cout << "lt1 = ";
	for (const auto &e : lt1)
		cout << e << " ";
	cout << endl;

	auto pos = find(lt1.begin(), lt1.end(), 6);
	lt1.insert(pos, 60);
	cout <<"在lt1 "<<*pos<<"位置 插入 60"<<endl;
	auto it3 = find(lt1.begin(), lt1.end(), 9);
	cout << "lt1删除:" << *it3 << endl;
	lt1.erase(it3);
	cout << endl;
	/交换
	cout << "交换list:" << endl;
	list<int> lt2 = { 0,1,2,3,4,5,6,7,8,9 };
	//c++11
	cout << "lt2 = ";
	for (const auto &e : lt2)
		cout << e << " ";
	cout << endl;
	cout << "lt1 = ";
	for (const auto &e : lt1)
		cout << e << " ";
	cout << endl<<endl;
	
	lt1.swap(lt2);
	cout << "lt2 = ";
	for (const auto &e : lt2)
		cout << e << " ";
	cout << endl;
	cout << "lt1 = ";
	for (const auto &e : lt1)
		cout << e << " ";
	cout << endl << endl;

	lt2.remove(5);
	cout << "remove 5：";
	cout << "lt2 = ";
	for (const auto &e : lt2)
		cout << e << " ";
	cout << endl;

	lt2.sort(); 
	lt1.sort();
	cout << "排序后：lt2 = ";
	for (const auto &e : lt2)
		cout << e << " ";
	cout << endl;
	cout << "排序后：lt1 = ";
	for (const auto &e : lt1)
		cout << e << " ";
	cout << endl;

	lt1.merge(lt2);
	cout << "合  并: ";
	for (const auto &e : lt1)
		cout << e << " ";
	cout << endl;
	
	lt1.clear();
	cout << "清除后：";
	cout << "lt1 = ";
	for (const auto &e : lt1)
		cout << e << " ";
	cout << endl;
	system("pause");
	return 0;
}

输出展示