//用類(lèi)封裝迭代器
template <class T>
struct __list_iterator
{
    typedef list_node<T> node;
    //用節(jié)點(diǎn)的指針進(jìn)行構(gòu)造
    __list_iterator(node* p)
        :_pnode(p)
    {}
    //迭代器運(yùn)算符的重載
    T& operator*()
    {
        return _pnode->_data;
    }
    __list_iterator<T>& operator++()//返回值不要寫(xiě)成node* operator++()，因?yàn)榈?+肯定返回迭代器啊，你返回節(jié)點(diǎn)指針類(lèi)型不對(duì)
    { 
        //return _pnode->_next;
        _pnode=_pnode->_next;
        return *this;//返回的是迭代器
    }
    bool operator!=(const __list_iterator<T>& it)
    {
        return _pnode != it._pnode;
    }
public:
    node* _pnode;//封裝一個(gè)節(jié)點(diǎn)的指針
};

typedef __list_iterator<T> iterator;
const list<T>::iterator it=lt.begin();

//用類(lèi)封裝const迭代器
template <class T>
struct __list_const_iterator
{
    typedef list_node<T> node;
    //用節(jié)點(diǎn)的指針進(jìn)行構(gòu)造
    __list_const_iterator(node* p)
        :_pnode(p)
    {}
    //迭代器運(yùn)算符的重載
    const T& operator*()const
    {
        return _pnode->_data;
    }
    __list_const_iterator<T>& operator++()//返回值不要寫(xiě)成node*，因?yàn)榈?+肯定返回迭代器啊，你返回節(jié)點(diǎn)指針類(lèi)型不對(duì)
    {
        //return _pnode->_next;//返回類(lèi)型錯(cuò)誤的
        _pnode = _pnode->_next;
        return *this;//返回的是迭代器
    }
    __list_const_iterator<T>& operator--()
    {
        _pnode = _pnode->_prev;
        return *this;
    }
    bool operator!=(const __list_const_iterator<T>& it)const
    {
        return _pnode != it._pnode;
    }
public:
    node* _pnode;//封裝一個(gè)節(jié)點(diǎn)的指針
};
 
typedef __list_const_iterator<T> const_iterator;

//用類(lèi)封裝普通/const迭代器
template <class T,class Ref>
struct __list_iterator
{
    typedef list_node<T> node;
    typedef __list_iterator<T,Ref> Self;
    //用節(jié)點(diǎn)的指針進(jìn)行構(gòu)造
    __list_iterator(node* p)
        :_pnode(p)
    {}
    //迭代器運(yùn)算符的重載
    Ref operator*()
    {
        return _pnode->_data;
    }
    Self& operator++()//返回值不要寫(xiě)成node*，因?yàn)榈?+肯定返回迭代器啊，你返回節(jié)點(diǎn)指針類(lèi)型不對(duì)
    { 
        //return _pnode->_next;//返回類(lèi)型錯(cuò)誤的
        _pnode=_pnode->_next;
        return *this;//返回的是迭代器
    }
    Self& operator--()
    {
        _pnode = _pnode->_prev;
        return *this;
    }
    bool operator!=(const Self& it)
    {
        return _pnode != it._pnode;
    }
public:
    node* _pnode;//封裝一個(gè)節(jié)點(diǎn)的指針
};
 
typedef __list_iterator<T, T&> iterator;
typedef __list_iterator<T, const T&> const_iterator;

//*的重載：返回節(jié)點(diǎn)的數(shù)據(jù)
Ref operator*()
{
    return _pnode->_data;
}
//->的重載：返回?cái)?shù)據(jù)的指針
T* operator->()
{
    return &_pnode->_data;
}

template <class T, class Ref,class Ptr>
Ptr operator->()
{
    return &_pnode->_data;
}
typedef __list_iterator<T, T&, T*> iterator;
typedef __list_iterator<T, const T&, const T*> const_iterator;

// 賦值運(yùn)算符重載寫(xiě)法2(賦值運(yùn)算符重載都可以這么干)
list<T>& operator=(list<T> lt)
{
    swap(lt);
    return *this;
}

// 賦值運(yùn)算符重載寫(xiě)法2(賦值運(yùn)算符重載都可以這么干)
list& operator=(list lt)
{
    swap(lt);
    return *this;
}

#pragma once
#include <iostream>
#include <algorithm>
#include <assert.h>
#include <vector>
using std::cout;
using std::endl;
namespace jly
{
	//鏈表節(jié)點(diǎn)的類(lèi)
	template <class T>
	struct list_node
	{
		list_node(const T& x = T())//給一個(gè)缺省值，變成默認(rèn)構(gòu)造函數(shù)
			:_next(nullptr)
			, _prev(nullptr)
			, _data(x)
		{}
 
		list_node* _next;
		list_node* _prev;
		T _data;
	};
	//用類(lèi)封裝普通/const迭代器
	template <class T, class Ref,class Ptr>
	struct __list_iterator
	{
		typedef list_node<T> node;
		typedef __list_iterator<T, Ref,Ptr> Self;
		//用節(jié)點(diǎn)的指針進(jìn)行構(gòu)造
		__list_iterator(node* p)
			:_pnode(p)
		{}
		//迭代器運(yùn)算符的重載
		Ref operator*()
		{
			return _pnode->_data;
		}
		Ptr operator->()
		{
			return &_pnode->_data;
		}
		Self& operator++()//返回值不要寫(xiě)成node*，因?yàn)榈?+肯定返回迭代器啊，你返回節(jié)點(diǎn)指針類(lèi)型不對(duì)
		{
			//return _pnode->_next;//返回類(lèi)型錯(cuò)誤的
			_pnode = _pnode->_next;
			return *this;//返回的是迭代器
		}
		Self operator++(int)//后置++
		{
			_pnode = _pnode->_next;
			return Self(_pnode->_next);
		}
		Self& operator--()
		{
			_pnode = _pnode->_prev;
			return *this;
		}
		Self operator--(int)//后置--
		{
			_pnode = _pnode->_prev;
			return Self(_pnode->_prev);
		}
		bool operator!=(const Self& it)const
		{
			return _pnode != it._pnode;
		}
		bool operator==(const Self& it)const
		{
			return _pnode == it._pnode;
		}
	public:
		node* _pnode;//封裝一個(gè)節(jié)點(diǎn)的指針
	};
	//用類(lèi)封裝const迭代器
	//template <class T>
	//struct __list_const_iterator
	//{
	//	typedef list_node<T> node;
	//	//用節(jié)點(diǎn)的指針進(jìn)行構(gòu)造
	//	__list_const_iterator(node* p)
	//		:_pnode(p)
	//	{}
	//	//迭代器運(yùn)算符的重載
	//	const T& operator*()const
	//	{
	//		return _pnode->_data;
	//	}
	//	__list_const_iterator<T>& operator++()//返回值不要寫(xiě)成node*，因?yàn)榈?+肯定返回迭代器啊，你返回節(jié)點(diǎn)指針類(lèi)型不對(duì)
	//	{
	//		//return _pnode->_next;//返回類(lèi)型錯(cuò)誤的
	//		_pnode = _pnode->_next;
	//		return *this;//返回的是迭代器
	//	}
	//	__list_const_iterator<T>& operator--()
	//	{
	//		_pnode = _pnode->_prev;
	//		return *this;
	//	}
	//	bool operator!=(const __list_const_iterator<T>& it)const
	//	{
	//		return _pnode != it._pnode;
	//	}
	//public:
	//	node* _pnode;//封裝一個(gè)節(jié)點(diǎn)的指針
	//};
 
	//鏈表類(lèi)（控制哨兵位）
	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;
		//typedef __list_const_iterator<T> const_iterator;
		//構(gòu)造函數(shù)
		void empty_initialize()//用于初始化哨兵位
		{
			_head = new node;
			_head->_next = _head;
			_head->_prev = _head;
			_size = 0;
		}
		list()
		{
			empty_initialize();
		}
		template <class InputIterator>
		list(InputIterator first, InputIterator last)//迭代器區(qū)間構(gòu)造
		{
			empty_initialize();
			while (first != last)
			{
				push_back(*first);
				++first;
			}
		}
		//析構(gòu)函數(shù)
		~list()
		{
			clear();
			delete _head;
			_head = nullptr;
		}
		//拷貝構(gòu)造
		list(const list<T>& lt)
		{
			先初始化*this
			//empty_initialize();
			//for (const auto& e : lt)//取lt的數(shù)據(jù)給e
			//{
			//	push_back(e);
			//}
 
			//工具人寫(xiě)法
			list<T> tmp(lt.begin(),lt.end());
			empty_initialize();
			swap(tmp);
		}
		void swap(list<T>& lt)
		{
			std::swap(_head, lt._head);//交換頭指針
			std::swap(_size,lt._size);
		}
		賦值運(yùn)算符重載寫(xiě)法1
		//list<T>& operator=(const list<T>& lt)
		//{
		//	//防止自己給自己賦值
		//	if (this != &lt)
		//	{
		//		clear();
		//		for (const auto& e : lt)
		//		{
		//			push_back(e);
		//		}
		//	}
		//	return *this;
		//}
		// 賦值運(yùn)算符重載寫(xiě)法2(賦值運(yùn)算符重載都可以這么干)
		list<T>& operator=(list<T> lt)
		{
			swap(lt);//直接交換
			return *this;
		}
		//插入刪除
		void push_back(const T& x)
		{
			/*node* newNode = new node(x);
			node* tail = _head->_prev;
			newNode->_prev = tail;
			newNode->_next = _head;
			tail->_next = newNode;
			_head->_prev = newNode;*/
			insert(end(), x);
		}
		void pop_back()
		{
			erase(--end());
		}
		void push_front(const T& x)//頭插
		{
			insert(begin(), x);
		}
		void pop_front()
		{
			erase(begin());
		}
		iterator insert(iterator pos, const T& x)
		{
			node* newNode = new node(x);
			node* prev = pos._pnode->_prev;
			node* cur = pos._pnode;
			newNode->_prev = prev;
			newNode->_next = cur;
			prev->_next = newNode;
			cur->_prev = newNode;
			//return iterator(newNode);
			pos._pnode = newNode;
			++_size;
			return pos;
		}
		iterator erase(iterator pos)
		{
			assert(!empty());
			node* prev = pos._pnode->_prev;
			node* next = pos._pnode->_next;
			prev->_next = next;
			next->_prev = prev;
			delete pos._pnode;
			--_size;
			//return iterator(next);
			pos._pnode = next;
			return pos;
		}
		//鏈表小接口
		bool empty()const
		{
			return _head->_next == _head;
		}
		void clear()
		{
			/*assert(!empty);
			node* cur = _head->_next;
			while (cur != _head)
			{
				node* next = cur->_next;
				delete cur;
				cur = next;
			}*/
			iterator it = begin();
			while (it != end())
			{
				it = erase(it);//erase返回刪除元素的下一個(gè)
			}
		}
		size_t size()const
		{
			return _size;
		}
		//普通begin(),end()迭代器
		iterator begin()
		{
			//return iterator(_head->_next);
			return __list_iterator<T, T&,T*>(_head->_next);
		}
		iterator end()
		{
			return __list_iterator<T, T&,T*>(_head);
		}
		//const begin(),end()迭代器
		const_iterator begin()const
		{
			//return const_iterator(_head->_next);
			return __list_iterator<T, const T&,const T*>(_head->_next);
		}
		const_iterator end()const
		{
			return __list_iterator<T, const T&,const T*>(_head);
		}
	private:
		node* _head;//哨兵位
		size_t _size;//用于統(tǒng)計(jì)節(jié)點(diǎn)個(gè)數(shù)，空間換時(shí)間
		//不加這個(gè)私有變量，統(tǒng)計(jì)節(jié)點(diǎn)個(gè)數(shù)時(shí)間O(N),有這個(gè)私有變量，時(shí)間O(1),但是每個(gè)節(jié)點(diǎn)的體積變大
	};
 
 
	//測(cè)試函數(shù)
	struct Pos
	{
		int _row;
		int _col;
 
		Pos(int row = 0, int col = 0)
			:_row(row)
			, _col(col)
		{}
	};
	void test()
	{
		list<Pos> i;
		i.push_back(Pos(1, 2));
		i.push_back(Pos(2, 5));
		i.push_back(Pos(4, 3));
		list<Pos>::iterator it = i.begin();
		while (it != i.end())
		{
			cout << (&( * it))->_row;//*it取數(shù)據(jù)，再取地址、解引用得到_row,多此一舉
			cout << it->_row;//同第三種寫(xiě)法，編譯器為了可讀性，省略了一個(gè)->
			cout << it.operator->()->_row;//it.operator->()是顯示調(diào)用，->_row是解引用得到_row
			it++;
		}
	}
	void test1()
	{
		list<std::vector<int>> i;
		std::vector<int> v1(1, 2);
		std::vector<int> v2(2, 4);
		std::vector<int> v3(3, 5);
		i.push_back(v1);
		i.push_back(v2);
		i.push_back(v3);
		list<std::vector<int>> m(i);
		i = m;
		cout << m.size();
	}
}