STL list

[Pokemon]大猫猫2023-09-16 1:05

文章目录

  • [一、list 类的模拟实现](#一、list 类的模拟实现)

list 是一个带头双向循环链表，可以存储任意类型

模板参数 T 表示存储元素的类型，Alloc 是空间配置器，一般不用传

一、list 类的模拟实现

iterator 和 const_iterator 除了下述不同外，其他代码基本一模一样：

  • iterator 调用 operator* / operator-> 返回 T& / T*
  • const_iterator 调用 operator* / operator-> 返回 const T& / const T*

为了减少代码冗余，创建一个公有的模板，并增加两个模板参数，在调用时通过传递不同的模板参数从而得到 iterator 和 const_iterator

list 类常用接口模拟实现：

cpp 复制代码 
//test.cpp
#include "list.h"

int main()
{
	starrycat::list_test5();

	return 0;
}

//list.h
#pragma once

#include <iostream>
#include <assert.h>
#include <algorithm>

using std::cout;
using std::endl;

namespace starrycat
{
	//带头双向链表结点
	template<class T>
	struct __list_node
	{
		__list_node<T>* _prev;
		__list_node<T>* _next;
		T _data;
	};

	//迭代器
	template<class T, class Ref, class Ptr>
	struct __list_iterator
	{
		typedef __list_node<T> node;
		typedef __list_iterator<T, Ref, Ptr> self;

		//成员
		node* _node;

		//默认构造函数
		__list_iterator<T, Ref, Ptr>()
		{}

		//构造函数
		__list_iterator<T, Ref, Ptr>(node* node)
			: _node(node)
		{}

		//解引用重载
		Ref operator*()
		{
			return _node->_data;
		}

		//当存储的元素类型是结构体时，为了可以便捷的访问元素中的结构体成员
		//编译器会将调用处的 -> 特殊解释为 ->->
		//因此 operator-> 要返回 Ref(T*/const T*)
		Ptr operator->()
		{
			return &(_node->_data);
		}

		//前置++重载
		self& operator++()
		{
			_node = _node->_next;

			return *this;
		}

		//后置++重载
		self operator++(int)
		{
			self tmp(*this);

			_node = _node->_next;

			return tmp;
		}

		//前置--重载
		self& operator--()
		{
			_node = _node->_prev;

			return *this;
		}

		//后置--重载
		self operator--(int)
		{
			self tmp(*this);

			_node = _node->_prev;

			return tmp;
		}

		bool operator==(const self& s) const
		{
			return _node == s._node;
		}

		bool operator!=(const self& s) const
		{
			return _node != s._node;
		}
	};

	//带头双向链表
	template<class T>
	class list
	{
	public:
		typedef __list_node<T> node;
		typedef __list_iterator<T, T&, T*> iterator;
		typedef __list_iterator<T, const T&, const T*> const_iterator;

		void empty_Init()
		{
			_head = new node;
			_head->_next = _head;
			_head->_prev = _head;
		}

		//默认构造函数
		list()
		{
			empty_Init();
		}

		//迭代器区间构造
		template<class InputIterator>
		list(InputIterator first, InputIterator last)
		{
			empty_Init();

			while (first != last)
			{
				push_back(*first);
				++first;
			}
		}

		void swap(list<T>& lt)
		{
			std::swap(_head, lt._head);
		}

		list(const list<T>& lt)
		{
			empty_Init();

			list<T> tmp(lt.begin(), lt.end());
			swap(tmp);
		}

		list<T>& operator=(list<T> lt)
		{
			swap(lt);

			return *this;
		}

		~list()
		{
			clear();
			delete _head;
			_head = nullptr;
		}

		void clear()
		{
			iterator it = begin();
			while (it != end())
			{
				it = erase(it);
			}
		}

		iterator begin()
		{
			return iterator(_head->_next);
		}

		const_iterator begin() const
		{
			return const_iterator(_head->_next);
		}

		iterator end()
		{
			return iterator(_head);
		}

		const_iterator end() const
		{
			return const_iterator(_head);
		}

		bool empty() const
		{
			return _head->_next == _head;
		}

		size_t size() const
		{
			size_t result = 0;
			node* cur = _head->_next;
			while (cur != _head)
			{
				++result;
				cur = cur->_next;
			}

			return result;
		}

		T& front()
		{
			return _head->_next->_data;
		}

		const T& front() const
		{
			return _head->_next->_data;
		}

		T& back()
		{
			return _head->_prev->_data;
		}

		const T& back() const
		{
			return _head->_prev->_data;
		}

		void push_front(const T& x)
		{
			//node* _head_next = _head->_next;

			//node* new_node = new node;
			//new_node->_data = x;

			//_head->_next = new_node;
			//new_node->_prev = _head;
			//new_node->_next = _head_next;
			//_head_next->_prev = new_node;

			insert(begin(), x);
		}

		void pop_front()
		{
			//assert(!empty());

			//node* del = _head->_next;
			//node* _head_new_next = del->_next;

			//_head->_next = _head_new_next;
			//_head_new_next->_prev = _head;

			//delete del;

			erase(begin());
		}

		void push_back(const T& x)
		{
			//node* tail = _head->_prev;

			//node* new_node = new node;
			//new_node->_data = x;

			//tail->_next = new_node;
			//new_node->_prev = tail;
			//new_node->_next = _head;
			//_head->_prev = new_node;
			insert(end(), x);
		}

		void pop_back()
		{
			//assert(!empty());

			//node* del = _head->_prev;
			//node* new_tail = del->_prev;

			//new_tail->_next = _head;
			//_head->_prev = new_tail;

			//delete del;

			erase(--end());
		}

		iterator insert(iterator pos, const T& x)
		{
			node* cur = pos._node;
			node* prev = cur->_prev;

			node* new_node = new node;
			new_node->_data = x;

			prev->_next = new_node;
			new_node->_prev = prev;
			new_node->_next = cur;
			cur->_prev = new_node;

			return new_node;
		}

		iterator erase(iterator pos)
		{
			node* del = pos._node;
			node* prev = del->_prev;
			node* next = del->_next;

			prev->_next = next;
			next->_prev = prev;

			delete del;

			return next;
		}

	private:
		node* _head;
	};

	void Print1(const list<int>& lt)
	{
		list<int>::const_iterator it = lt.begin();
		while (it != lt.end())
		{
			//(*it) *= 10;
			cout << *it << " ";
			++it;
		}
		cout << endl;

		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;
	}

	void list_test1()
	{
		list<int> lt;
		lt.push_back(1);
		lt.push_back(2);
		lt.push_back(3);
		lt.push_back(4);

		list<int>::iterator it = lt.begin();
		while (it != lt.end())
		{
			(*it) *= 10;
			cout << *it << " ";
			++it;
		}
		cout << endl;

		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;

		Print1(lt);
	}

	struct A
	{
		int _a1;
		int _a2;

		//构造函数
		A(int a1 = 0, int a2 = 0)
			: _a1(a1)
			, _a2(a2)
		{}
	};

	void Print2(const list<A>& lt)
	{
		list<A>::const_iterator it = lt.begin();
		while (it != lt.end())
		{
			//it->_a1 *= 2;
			//it->_a2 *= 2;
			cout << it->_a1 << " " << it->_a2 << endl;
			++it;
		}
		cout << endl;
	}

	void list_test2()
	{
		list<A> lt;
		lt.push_back(A(1, 1));
		lt.push_back(A(2, 2));
		lt.push_back(A(3, 3));
		lt.push_back(A(4, 4));
		
		list<A>::iterator it = lt.begin();
		while (it != lt.end())
		{
			//cout << (*it)._a1 << " " << (*it)._a2 << endl;

			//it->_a1 编译器默认解释为 it->->_a1 <==> it.operator->()->_a1;
			it->_a1 *= 10;
			it->_a2 *= 10;
			cout << it->_a1 << " " << it->_a2 << endl;
			++it;
		}
		cout << endl;

		Print2(lt);
	}

	void list_test3()
	{
		list<int> lt;
		cout << "empty:" << lt.empty() << endl;
		cout << "size:" << lt.size() << endl;

		lt.push_front(1);
		lt.push_front(2);
		lt.push_front(3);
		lt.push_front(4);
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;

		cout << "empty:" << lt.empty() << endl;
		cout << "size:" << lt.size() << endl;

		lt.pop_front();
		lt.pop_front();
		//lt.pop_front();
		//lt.pop_front();
		//lt.pop_front();
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;

		lt.push_back(1);
		lt.push_back(2);
		lt.push_back(3);
		lt.push_back(4);
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;

		lt.pop_back();
		lt.pop_back();
		//lt.pop_back();
		//lt.pop_back();
		//lt.pop_back();
		//lt.pop_back();
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;

		lt.front() *= 10;
		lt.back() *= 100;
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;
	}

	void list_test4()
	{
		list<int> lt;
		lt.push_back(1);
		lt.push_back(2);
		lt.push_back(3);
		lt.push_back(4);
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;

		//list<int>::iterator pos = std::find(lt.begin(), lt.end(), 2); err
		lt.insert(++lt.begin(), 20);
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;

		lt.erase(++lt.begin());
		for (auto e : lt)
		{
			cout << e << " ";
		}
		cout << endl;
	}

	void list_test5()
	{
		list<int> lt1;
		lt1.push_back(1);
		lt1.push_back(2);
		lt1.push_back(3);
		lt1.push_back(4);
		for (auto e : lt1)
		{
			cout << e << " ";
		}
		cout << endl;

		list<int> lt2(lt1.begin(), lt1.end());
		for (auto e : lt1)
		{
			cout << e << " ";
		}
		cout << endl;

		list<int> lt3(lt2);
		for (auto e : lt3)
		{
			cout << e << " ";
		}
		cout << endl;

		lt3.clear();
		for (auto e : lt3)
		{
			cout << e << " ";
		}
		cout << endl;

		lt3 = lt2;
		for (auto e : lt2)
		{
			cout << e << " ";
		}
		cout << endl;

		for (auto e : lt3)
		{
			cout << e << " ";
		}
		cout << endl;
	}
}
相关推荐
jrrz0828几秒前
LeetCode 热题100（七）【链表】（1）
数据结构·c++·算法·leetcode·链表
咖啡里的茶i16 分钟前
Vehicle友元Date多态Sedan和Truck
c++
海绵波波10722 分钟前
Webserver(4.9)本地套接字的通信
c++
@小博的博客28 分钟前
C++初阶学习第十弹——深入讲解vector的迭代器失效
数据结构·c++·学习
AaVictory.1 小时前
Android 开发 Java中 list实现 按照时间格式 yyyy-MM-dd HH:mm 顺序
android·java·list
爱吃喵的鲤鱼1 小时前
linux进程的状态之环境变量
linux·运维·服务器·开发语言·c++
水月梦镜花2 小时前
redis：list列表命令和内部编码
数据库·redis·list
7年老菜鸡2 小时前
策略模式（C++）三分钟读懂
c++·qt·策略模式
Ni-Guvara2 小时前
函数对象笔记
c++·算法
似霰2 小时前
安卓智能指针sp、wp、RefBase浅析
android·c++·binder
热门推荐
01【HarmonyOS】HUAWEI DevEco Studio 下载地址汇总02(欧拉)openEuler系统添加网卡文件配置流程、(欧拉)openEuler系统手动配置ipv6地址流程、(欧拉)openEuler系统网络管理说明03组基轨迹建模 GBTM的介绍与实现（Stata 或 R）04【AIGC】重塑未来的科技巨轮05全面解析：构建基于深度学习的安全帽检测系统（UI界面+YOLO代码+数据集）06【经验分享】Ubuntu22.04安装微信(linux官方版)07基于YOLOv10深度学习的CT扫描图像肾结石智能检测系统【python源码+Pyqt5界面+数据集+训练代码】深度学习实战、目标检测08Ubuntu 20.04使用Livox mid 360 测试 FAST_LIO09RAG 实践- Ollama+RagFlow 部署本地知识库10【TC3xx芯片】TC3xx芯片电源管理系统PMS详解