list模拟实现

🌟🌟hello，各位读者大大们你们好呀🌟🌟
🚀🚀系列专栏：【C++的学习】
📝📝本篇内容：C++容器list模拟实现
⬆⬆⬆⬆上一篇：vector模拟实现
💖💖作者简介：轩情吖，请多多指教(> •̀֊•́ ) ̖́-

#define _CRT_SECURE_NO_WARNINGS 1
#include <assert.h>
#include <list>
#include <stdbool.h>
#include <algorithm>
#include "my_reverse_iterator.h"
using namespace std;
#include <iostream>
namespace lnb
{
	template<class T>
	struct list_node//带头双向链表的结点
	{
		list_node(const T& x=T())
		:_prv(nullptr),
		_next(nullptr),
		_data(x)
		{}

		list_node<T>* _prv;
		list_node<T>* _next;
		T _data;
	};

	template<class T,class Ref,class Ptr>
	struct _list_iterator//封装迭代器
	{
		typedef list_node<T>* code;
		typedef _list_iterator<T,Ref,Ptr> self;
		_list_iterator(code cd)
			:_cd(cd)
		{}

		self operator++(int)
		{
			self ret = *this;
			_cd = _cd->_next;
			return ret;
		}

		self& operator++()
		{
			_cd = _cd->_next;
			return *this;
		}

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

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

		self operator--(int)
		{
			self ret = *this;
			_cd = _cd->_prv;
			return ret;
		}

		self& operator--()
		{
			_cd = _cd->_prv;
			return *this;
		}


		 Ref operator*()
		{
			return _cd->_data;
		}

		 //针对于自定义类型
		 //struct AA
		 //{
		 //	 int a;
		 //	 int b;
		 //};
		 //按理来说应该是it->->a;为了可读性，变成了it->a
		 Ptr operator->()//特例
		 {
			 return &(_cd->_data);
		 }


		code _cd;
	};



	template<class T>
	class list
	{
	public: 
		typedef _list_iterator<T, T&, T*> iterator;//迭代器
		typedef _list_iterator<T, const T&, const T*> const_iterator;
		typedef my_reverse_iterator<const_iterator, const T&, const T*> const_reverse_iterator;
		typedef my_reverse_iterator<iterator, T&, T*> reverse_iterator;
		reverse_iterator rbegin()
		{
			return reverse_iterator(end());
		}
		
		reverse_iterator rend()
		{
			return reverse_iterator(begin());
		}


		const_reverse_iterator rend()const
		{
			return const_reverse_iterator(begin());
		}


		const_reverse_iterator rbegin()const
		{
			return const_reverse_iterator(end());
		}
		
		
		iterator begin()
		{
			return _list_iterator<T, T&, T*>(_head->_next);
		}

		iterator end()
		{
	     return _list_iterator<T, T&, T*>(_head);
		}





		const_iterator begin()const
		{
			return _list_iterator<T, const T&, const T*>(_head->_next);
		}


		const_iterator end()const
		{
			return _list_iterator<T, const T&, const T*>(_head);
		}


		void insert(const iterator& pos,const T& x)
		{
			node* cur = new node(x);
			node* prv = pos._cd->_prv;
			node* next = pos._cd;
			prv->_next = cur;
			cur->_prv = prv;
			next->_prv = cur;
			cur->_next = next;
		}


		void erase(const iterator& pos)
		{
			assert(pos != end());
			node* prv = pos._cd->_prv;
			node* next = pos._cd->_next;
			prv->_next = next;
			next->_prv = prv;
			delete pos._cd;
		}


		typedef list_node<T> node;
		list()
		{
			Init();
		}

		void Init()
		{
			_head = new node;
			_head->_prv = _head;
			_head->_next = _head;
		}

		void empty()
		{
			iterator it = begin();
			while (it != end())
			{
				erase(it++);
			}
		}
		
		~list()
		{
			empty();
			delete _head;
			_head = nullptr;
		}

		list(const list<T>& lt)
		{
			Init();
			for (auto e : lt)
			{
				push_back(e);

			}
		}


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

		}


		list<T>& operator=(list<T> lt)
		{
			my_swap(lt);
			return *this;
		}





		void push_back(const T& x)
		{
			node* cur = new node(x);
			node* prv = _head->_prv;
			cur->_next = _head;
			_head->_prv = cur;
			cur->_prv = prv;
			prv->_next = cur;
		}


	private:
		node* _head;
	};
}

namespace lnb
{
	template<class Iterator, class Ref, class Ptr>
	struct my_reverse_iterator//反向迭代器
	{
		typedef my_reverse_iterator<Iterator, Ref, Ptr> self;
		my_reverse_iterator(const Iterator& lt)
			:_lt(lt)
		{}
		self& operator++()
		{
			_lt--;
			return *this;
		}

		self operator++(int)
		{
			self ret = *this;
			_lt--;
			return ret;
		}

		self& operator--()
		{
			_lt++;
			return *this;
		}

		self& operator--(int)
		{
			self ret = *this;
			_lt++;
			return *this;
		}

		
		Ref operator*()
		{
			Iterator tmp = this->_lt;
			tmp--;
			return *tmp;
		}

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


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

		Ptr operator->()
		{
			Iterator tmp = this->_lt;
			tmp--;
			return &((tmp._cd)->_data);
		}


		Iterator _lt;


	};
}

🌸🌸list模拟实现的知识大概就讲到这里啦，博主后续会继续更新更多C++的相关知识，干货满满，如果觉得博主写的还不错的话，希望各位小伙伴不要吝啬手中的三连哦！你们的支持是博主坚持创作的动力！💪💪