博客 https://blog.lenyiin.com/cpp-list/ 的代码仓库

Linux/List.cc

@@ -0,0 +1,172 @@
+#include "List.hpp"
+
+using namespace Lenyiin;
+
+void print(const List<int> &lt)
+{
+    List<int>::const_iterator it = lt.begin();
+    while (it != lt.end())
+    {
+        cout << *it << " ";
+        ++it;
+    }
+    cout << endl;
+}
+
+void print_reverse(const List<int> &lt)
+{
+    List<int>::const_reverse_iterator it = lt.rbegin();
+    while (it != lt.rend())
+    {
+        cout << *it << " ";
+        ++it;
+    }
+    cout << endl;
+}
+
+// 测试遍历
+void test_1()
+{
+    List<int> lt;
+    lt.push_back(1);
+    lt.push_back(2);
+    lt.push_back(3);
+    lt.push_back(4);
+    lt.push_back(5);
+
+    // iterator
+    cout << "iterator \t\t遍历: ";
+    List<int>::iterator it = lt.begin();
+    while (it != lt.end())
+    {
+        cout << *it << " ";
+        it++;
+    }
+    cout << endl;
+
+    // const_iterator
+    cout << "const_iterator \t\t遍历: ";
+    print(lt);
+
+    // for
+    cout << "for \t\t\t遍历: ";
+    for (auto &it : lt)
+    {
+        cout << it << " ";
+    }
+    cout << endl;
+
+    cout << "for const \t\t遍历: ";
+    for (const auto &it : lt)
+    {
+        cout << it << " ";
+    }
+    cout << endl;
+
+    // reverse iterator
+    cout << "reverse iterator \t遍历: ";
+    List<int>::reverse_iterator rit = lt.rbegin();
+    while (rit != lt.rend())
+    {
+        cout << *rit << " ";
+        rit++;
+    }
+    cout << endl;
+
+    // const reverse iterator
+    cout << "const reverse iterator \t遍历: ";
+    print_reverse(lt);
+}
+
+// 测试插入删除
+void test_2()
+{
+    List<int> lt;
+    lt.push_back(1);
+    lt.push_back(2);
+    lt.push_back(3);
+    lt.push_back(4);
+    lt.push_back(5);
+
+    print(lt);
+
+    lt.erase(lt.begin());
+    print(lt);
+
+    lt.pop_back();
+    print(lt);
+
+    lt.pop_front();
+    print(lt);
+
+    lt.push_front(100);
+    print(lt);
+}
+
+void test_3()
+{
+    // 默认构造
+    List<int> lt1;
+    lt1.push_back(1);
+    lt1.push_back(2);
+    lt1.push_back(3);
+    lt1.push_back(4);
+    lt1.push_back(5);
+    print(lt1);
+
+    // 拷贝构造
+    List<int> lt2(lt1);
+    print(lt2);
+    lt2.push_back(6);
+    lt2.push_back(7);
+    lt2.push_back(8);
+    lt2.push_back(9);
+    lt2.push_back(10);
+    print(lt2);
+
+    // 赋值运算
+    lt1 = lt2;
+    print(lt1);
+}
+
+// 模板
+struct Date
+{
+    int _year;
+    int _month;
+    int _day;
+
+    Date(int year = 0, int month = 1, int day = 1)
+        : _year(year), _month(month), _day(day)
+    {
+    }
+};
+
+void test_4()
+{
+    List<Date> lt;
+    lt.push_back(Date());
+    lt.push_back(Date(2022, 2, 22));
+    lt.push_back(Date(2024, 9, 8));
+
+    List<Date>::iterator it = lt.begin();
+    while (it != lt.end())
+    {
+        // cout << *it << " ";
+        // operator->   operator*
+        cout << it->_year << "-" << it->_month << "-" << it->_day << endl; // 更喜欢这么去用
+        cout << (*it)._year << "-" << (*it)._month << "-" << (*it)._day << endl;
+        it++;
+    }
+    cout << endl;
+}
+
+int main()
+{
+    // test_1();
+    // test_2();
+    // test_3();
+    test_4();
+
+    return 0;
+}

Linux/List.hpp

@@ -0,0 +1,367 @@
+#pragma once
+
+#include <iostream>
+#include <assert.h>
+
+using namespace std;
+
+namespace Lenyiin
+{
+    template <class T>
+    struct __list_node
+    {
+        __list_node<T> *_next; // 指向后一个节点的指针
+        __list_node<T> *_prev; // 指向前一个节点的指针
+        T _data;               // 节点存储的数据
+
+        __list_node(const T &data = T())
+            : _data(data), _next(nullptr), _prev(nullptr)
+        {
+        }
+    };
+
+    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(Node *node)
+            : _node(node)
+        {
+        }
+
+        // 运算符重载
+        // *it
+        Ref operator*()
+        {
+            return _node->_data;
+        }
+
+        // it ->
+        Ptr operator->()
+        {
+            return &_node->_data;
+        }
+
+        // ++it
+        Self &operator++()
+        {
+            _node = _node->_next;
+            return *this;
+        }
+
+        // it++
+        Self operator++(int)
+        {
+            Self tmp(*this);
+            ++(*this);
+            return tmp;
+        }
+
+        // --it
+        Self &operator--()
+        {
+            _node = _node->_prev;
+            return *this;
+        }
+
+        // it--
+        Self operator--(int)
+        {
+            Self tmp(*this);
+            --(*this);
+            return tmp;
+        }
+
+        // it != end()
+        bool operator!=(const Self &it)
+        {
+            return _node != it._node;
+        }
+
+        bool operator==(const Self &it)
+        {
+            return _node == it._node;
+        }
+    };
+
+    template <class T, class Ref, class Ptr>
+    struct __list_reverse_iterator
+    {
+        typedef __list_node<T> Node;
+        typedef __list_reverse_iterator<T, Ref, Ptr> Self;
+
+        Node *_node;
+
+        // 默认构造
+        __list_reverse_iterator(Node *node)
+            : _node(node)
+        {
+        }
+
+        // 运算符重载
+        // *it
+        Ref operator*()
+        {
+            return _node->_data;
+        }
+
+        // it ->
+        Ptr operator->()
+        {
+            return &_node->_data;
+        }
+
+        // ++it
+        Self &operator++()
+        {
+            _node = _node->_prev;
+            return *this;
+        }
+
+        // it++
+        Self operator++(int)
+        {
+            Self tmp(*this);
+            ++(*this);
+            return tmp;
+        }
+
+        // --it
+        Self &operator--()
+        {
+            _node = _node->_next;
+            return *this;
+        }
+
+        // it--
+        Self operator--(int)
+        {
+            Self tmp(*this);
+            --(*this);
+            return tmp;
+        }
+
+        // it != end()
+        bool operator!=(const Self &it)
+        {
+            return _node != it._node;
+        }
+
+        bool operator==(const Self &it)
+        {
+            return _node == it._node;
+        }
+    };
+
+    template <class T>
+    class List
+    {
+        typedef __list_node<T> Node;
+
+    public:
+        typedef __list_iterator<T, T &, T *> iterator;
+        typedef __list_iterator<T, const T &, const T *> const_iterator;
+        typedef __list_reverse_iterator<T, T &, T *> reverse_iterator;
+        typedef __list_reverse_iterator<T, const T &, const T *> const_reverse_iterator;
+
+        iterator begin() // 返回头节点的下一个节点
+        {
+            return iterator(_head->_next);
+        }
+
+        iterator end() // 返回头节点
+        {
+            return iterator(_head);
+        }
+
+        const_iterator begin() const
+        {
+            return const_iterator(_head->_next);
+        }
+
+        const_iterator end() const
+        {
+            return const_iterator(_head);
+        }
+
+        reverse_iterator rbegin() // 返回头节点的下一个节点
+        {
+            return reverse_iterator(_head->_prev);
+        }
+
+        reverse_iterator rend() // 返回头节点
+        {
+            return reverse_iterator(_head);
+        }
+
+        const_reverse_iterator rbegin() const
+        {
+            return const_reverse_iterator(_head->_prev);
+        }
+
+        const_reverse_iterator rend() const
+        {
+            return const_reverse_iterator(_head);
+        }
+
+    public:
+        // 带头双向循环链表
+        // 默认构造
+        List()
+        {
+            _head = new Node;
+            _head->_next = _head;
+            _head->_prev = _head;
+        }
+
+        // 拷贝构造
+        List(const List<T> &lt)
+        {
+            _head = new Node;
+            _head->_next = _head;
+            _head->_prev = _head;
+
+            for (const auto &e : lt)
+            {
+                push_back(e);
+            }
+        }
+
+        // 赋值运算符
+        // List<T>& operator=(const List<T>& lt)
+        //{
+        //	if (this != &lt)
+        //	{
+        //		clear();
+        //		for (const auto& e : lt)
+        //		{
+        //			push_back(e);
+        //		}
+        //	}
+        //	return *this;
+        //}
+
+        // 进阶写法
+        List<T> &operator=(List<T> lt)
+        {
+            std::swap(_head, lt._head);
+            return *this;
+        }
+
+        // 清除
+        void clear()
+        {
+            iterator it = begin();
+            while (it != end())
+            {
+                erase(it++);
+            }
+        }
+
+        // 析构函数
+        ~List()
+        {
+            clear();
+            delete _head;
+            _head = nullptr;
+        }
+
+        // 结构设计的优势, 有没有数据, 插入的逻辑都是一样的
+        // void push_back(const T& data)
+        //{
+        //	Node* tail = _head->_prev;
+        //	Node* newnode = new Node(data);
+        //	tail->_next = newnode;
+        //	newnode->_prev = tail;
+        //	newnode->_next = _head;
+        //	_head->_prev = newnode;
+        //}
+
+        // void push_front(const T& data)
+        //{
+        //	Node* cur = _head->_next;
+        //	Node* newnode = new Node(data);
+
+        //	_head->_next = newnode;
+        //	newnode->_prev = _head;
+        //	newnode->_next = cur;
+        //	cur->_prev = newnode;
+        //}
+
+        void push_back(const T &data)
+        {
+            insert(end(), data);
+        }
+
+        void push_front(const T &data)
+        {
+            insert(begin(), data);
+        }
+
+        // void pop_back()
+        //{
+        //	Node* tail = _head->_prev;
+        //	Node* prev = tail->_prev;
+
+        //	delete tail;
+        //	prev->_next = _head;
+        //	_head->_prev = prev;
+        //}
+
+        // void pop_front()
+        //{
+        //	Node* head = _head->_next;
+        //	Node* next = head->_next;
+
+        //	delete head;
+        //	_head->_next = next;
+        //	next->_prev = _head;
+        //}
+
+        void pop_back()
+        {
+            erase(--end());
+        }
+
+        void pop_front()
+        {
+            erase(begin());
+        }
+
+        void insert(iterator pos, const T &data)
+        {
+            Node *cur = pos._node;
+            Node *prev = cur->_prev;
+            Node *newnode = new Node(data);
+
+            // prev newnode cur
+            prev->_next = newnode;
+            newnode->_prev = prev;
+            newnode->_next = cur;
+            cur->_prev = newnode;
+        }
+
+        iterator erase(iterator pos)
+        {
+            assert(pos != end());
+
+            Node *cur = pos._node;
+            Node *prev = cur->_prev;
+            Node *next = cur->_next;
+            delete cur;
+
+            prev->_next = next;
+            next->_prev = prev;
+
+            return next;
+        }
+
+    private:
+        Node *_head;
+    };
+}

Linux/Makefile

@@ -0,0 +1,6 @@
+list:List.cc
+	g++ -o $@ $^
+
+.PHONY:clean
+clean:
+	rm -f list

Windows_List/List.cpp

@@ -0,0 +1,171 @@
+#include "List.hpp"
+
+using namespace Lenyiin;
+
+void print(const List<int>& lt)
+{
+    List<int>::const_iterator it = lt.begin();
+    while (it != lt.end())
+    {
+        cout << *it << " ";
+        ++it;
+    }
+    cout << endl;
+}
+
+void print_reverse(const List<int>& lt)
+{
+    List<int>::const_reverse_iterator it = lt.rbegin();
+    while (it != lt.rend())
+    {
+        cout << *it << " ";
+        ++it;
+    }
+    cout << endl;
+}
+
+// 测试遍历
+void test_1()
+{
+    List<int> lt;
+    lt.push_back(1);
+    lt.push_back(2);
+    lt.push_back(3);
+    lt.push_back(4);
+    lt.push_back(5);
+
+    // iterator
+    cout << "iterator \t\t遍历: ";
+    List<int>::iterator it = lt.begin();
+    while (it != lt.end())
+    {
+        cout << *it << " ";
+        it++;
+    }
+    cout << endl;
+
+    // const_iterator
+    cout << "const_iterator \t\t遍历: ";
+    print(lt);
+
+    // for
+    cout << "for \t\t\t遍历: ";
+    for (auto& it : lt)
+    {
+        cout << it << " ";
+    }
+    cout << endl;
+
+    cout << "for const \t\t遍历: ";
+    for (const auto& it : lt)
+    {
+        cout << it << " ";
+    }
+    cout << endl;
+
+    // reverse iterator
+    cout << "reverse iterator \t遍历: ";
+    List<int>::reverse_iterator rit = lt.rbegin();
+    while (rit != lt.rend())
+    {
+        cout << *rit << " ";
+        rit++;
+    }
+    cout << endl;
+
+    // const reverse iterator
+    cout << "const reverse iterator \t遍历: ";
+    print_reverse(lt);
+}
+
+// 测试插入删除
+void test_2()
+{
+    List<int> lt;
+    lt.push_back(1);
+    lt.push_back(2);
+    lt.push_back(3);
+    lt.push_back(4);
+    lt.push_back(5);
+
+    print(lt);
+
+    lt.erase(lt.begin());
+    print(lt);
+
+    lt.pop_back();
+    print(lt);
+
+    lt.pop_front();
+    print(lt);
+
+    lt.push_front(100);
+    print(lt);
+}
+
+void test_3()
+{
+    // 默认构造
+    List<int> lt1;
+    lt1.push_back(1);
+    lt1.push_back(2);
+    lt1.push_back(3);
+    lt1.push_back(4);
+    lt1.push_back(5);
+    print(lt1);
+
+    // 拷贝构造
+    List<int> lt2(lt1);
+    print(lt2);
+    lt2.push_back(6);
+    lt2.push_back(7);
+    lt2.push_back(8);
+    lt2.push_back(9);
+    lt2.push_back(10);
+    print(lt2);
+
+    // 赋值运算
+    lt1 = lt2;
+    print(lt1);
+}
+
+// 模板
+struct Date
+{
+    int _year;
+    int _month;
+    int _day;
+
+    Date(int year = 0, int month = 1, int day = 1)
+        : _year(year), _month(month), _day(day)
+    {}
+};
+
+void test_4()
+{
+    List<Date> lt;
+    lt.push_back(Date());
+    lt.push_back(Date(2022, 2, 22));
+    lt.push_back(Date(2024, 9, 8));
+
+    List<Date>::iterator it = lt.begin();
+    while (it != lt.end())
+    {
+        // cout << *it << " ";
+        // operator->   operator*
+        cout << it->_year << "-" << it->_month << "-" << it->_day << endl; // 更喜欢这么去用
+        cout << (*it)._year << "-" << (*it)._month << "-" << (*it)._day << endl;
+        it++;
+    }
+    cout << endl;
+}
+
+int main()
+{
+    test_1();
+    //test_2();
+    //test_3();
+    //test_4();
+
+    return 0;
+}

Windows_List/List.hpp

@@ -0,0 +1,367 @@
+#pragma once
+
+
+#include <iostream>
+#include <assert.h>
+
+using namespace std;
+
+namespace Lenyiin
+{
+	template <class T>
+	struct __list_node
+	{
+		__list_node<T>* _next;	// 指向后一个节点的指针
+		__list_node<T>* _prev;	// 指向前一个节点的指针
+		T _data;	// 节点存储的数据
+
+		__list_node(const T& data = T())
+			: _data(data), _next(nullptr), _prev(nullptr)
+		{}
+	};
+
+	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(Node* node)
+			: _node(node)
+		{
+		}
+
+		// 运算符重载
+		// *it
+		Ref operator*()
+		{
+			return _node->_data;
+		}
+
+		// it ->
+		Ptr operator->()
+		{
+			return &_node->_data;
+		}
+
+		// ++it
+		Self& operator++()
+		{
+			_node = _node->_next;
+			return *this;
+		}
+
+		// it++
+		Self operator++(int)
+		{
+			Self tmp(*this);
+			++(*this);
+			return tmp;
+		}
+
+		// --it
+		Self& operator--()
+		{
+			_node = _node->_prev;
+			return *this;
+		}
+
+		// it--
+		Self operator--(int)
+		{
+			Self tmp(*this);
+			--(*this);
+			return tmp;
+		}
+
+		// it != end()
+		bool operator!=(const Self& it)
+		{
+			return _node != it._node;
+		}
+
+		bool operator==(const Self& it)
+		{
+			return _node == it._node;
+		}
+	};
+
+	template <class T, class Ref, class Ptr>
+	struct __list_reverse_iterator
+	{
+		typedef __list_node<T> Node;
+		typedef __list_reverse_iterator<T, Ref, Ptr> Self;
+
+		Node* _node;
+
+		// 默认构造
+		__list_reverse_iterator(Node* node)
+			: _node(node)
+		{
+		}
+
+		// 运算符重载
+		// *it
+		Ref operator*()
+		{
+			return _node->_data;
+		}
+
+		// it ->
+		Ptr operator->()
+		{
+			return &_node->_data;
+		}
+
+		// ++it
+		Self& operator++()
+		{
+			_node = _node->_prev;
+			return *this;
+		}
+
+		// it++
+		Self operator++(int)
+		{
+			Self tmp(*this);
+			++(*this);
+			return tmp;
+		}
+
+		// --it
+		Self& operator--()
+		{
+			_node = _node->_next;
+			return *this;
+		}
+
+		// it--
+		Self operator--(int)
+		{
+			Self tmp(*this);
+			--(*this);
+			return tmp;
+		}
+
+		// it != end()
+		bool operator!=(const Self& it)
+		{
+			return _node != it._node;
+		}
+
+		bool operator==(const Self& it)
+		{
+			return _node == it._node;
+		}
+	};
+
+	template <class T>
+	class List
+	{
+		typedef __list_node<T> Node;
+
+	public:
+		typedef __list_iterator<T, T&, T*> iterator;
+		typedef __list_iterator<T, const T&, const T*> const_iterator;
+		typedef __list_reverse_iterator<T, T&, T*> reverse_iterator;
+		typedef __list_reverse_iterator<T, const T&, const T*> const_reverse_iterator;
+
+		iterator begin()	// 返回头节点的下一个节点
+		{
+			return iterator(_head->_next);
+		}
+
+		iterator end()	// 返回头节点
+		{
+			return iterator(_head);
+		}
+
+		const_iterator begin() const
+		{
+			return const_iterator(_head->_next);
+		}
+
+		const_iterator end() const
+		{
+			return const_iterator(_head);
+		}
+
+		reverse_iterator rbegin()	// 返回头节点的下一个节点
+		{
+			return reverse_iterator(_head->_prev);
+		}
+
+		reverse_iterator rend()	// 返回头节点
+		{
+			return reverse_iterator(_head);
+		}
+
+		const_reverse_iterator rbegin()	const
+		{
+			return const_reverse_iterator(_head->_prev);
+		}
+
+		const_reverse_iterator rend() const
+		{
+			return const_reverse_iterator(_head);
+		}
+
+	public:
+		// 带头双向循环链表
+		// 默认构造
+		List()
+		{
+			_head = new Node;
+			_head->_next = _head;
+			_head->_prev = _head;
+		}
+
+		// 拷贝构造
+		List(const List<T>& lt)
+		{
+			_head = new Node;
+			_head->_next = _head;
+			_head->_prev = _head;
+
+			for (const auto& e : lt)
+			{
+				push_back(e);
+			}
+		}
+
+		// 赋值运算符
+		//List<T>& operator=(const List<T>& lt)
+		//{
+		//	if (this != &lt)
+		//	{
+		//		clear();
+		//		for (const auto& e : lt)
+		//		{
+		//			push_back(e);
+		//		}
+		//	}
+		//	return *this;
+		//}
+
+		// 进阶写法
+		List<T>& operator=(List<T> lt)
+		{
+			std::swap(_head, lt._head);
+			return *this;
+		}
+
+		// 清除
+		void clear()
+		{
+			iterator it = begin();
+			while (it != end())
+			{
+				erase(it++);
+			}
+		}
+
+		// 析构函数
+		~List()
+		{
+			clear();
+			delete _head;
+			_head = nullptr;
+		}
+
+		// 结构设计的优势, 有没有数据, 插入的逻辑都是一样的
+		//void push_back(const T& data)
+		//{
+		//	Node* tail = _head->_prev;
+		//	Node* newnode = new Node(data);
+		//	tail->_next = newnode;
+		//	newnode->_prev = tail;
+		//	newnode->_next = _head;
+		//	_head->_prev = newnode;
+		//}
+
+		//void push_front(const T& data)
+		//{
+		//	Node* cur = _head->_next;
+		//	Node* newnode = new Node(data);
+
+		//	_head->_next = newnode;
+		//	newnode->_prev = _head;
+		//	newnode->_next = cur;
+		//	cur->_prev = newnode;
+		//}
+
+		void push_back(const T& data)
+		{
+			insert(end(), data);
+		}
+
+		void push_front(const T& data)
+		{
+			insert(begin(), data);
+		}
+
+		//void pop_back()
+		//{
+		//	Node* tail = _head->_prev;
+		//	Node* prev = tail->_prev;
+
+		//	delete tail;
+		//	prev->_next = _head;
+		//	_head->_prev = prev;
+		//}
+
+		//void pop_front()
+		//{
+		//	Node* head = _head->_next;
+		//	Node* next = head->_next;
+
+		//	delete head;
+		//	_head->_next = next;
+		//	next->_prev = _head;
+		//}
+
+		void pop_back()
+		{
+			erase(--end());
+		}
+
+		void pop_front()
+		{
+			erase(begin());
+		}
+
+		void insert(iterator pos, const T& data)
+		{
+			Node* cur = pos._node;
+			Node* prev = cur->_prev;
+			Node* newnode = new Node(data);
+
+			// prev newnode cur
+			prev->_next = newnode;
+			newnode->_prev = prev;
+			newnode->_next = cur;
+			cur->_prev = newnode;
+		}
+
+		iterator erase(iterator pos)
+		{
+			assert(pos != end());
+
+			Node* cur = pos._node;
+			Node* prev = cur->_prev;
+			Node* next = cur->_next;
+			delete cur;
+
+			prev->_next = next;
+			next->_prev = prev;
+
+			return next;
+		}
+
+	private:
+		Node* _head;
+	};
+}

Windows_List/Windows_List.sln

@@ -0,0 +1,31 @@
+
+Microsoft Visual Studio Solution File, Format Version 12.00
+# Visual Studio Version 17
+VisualStudioVersion = 17.7.34221.43
+MinimumVisualStudioVersion = 10.0.40219.1
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Windows_List", "Windows_List.vcxproj", "{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|x64 = Debug|x64
+		Debug|x86 = Debug|x86
+		Release|x64 = Release|x64
+		Release|x86 = Release|x86
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Debug|x64.ActiveCfg = Debug|x64
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Debug|x64.Build.0 = Debug|x64
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Debug|x86.ActiveCfg = Debug|Win32
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Debug|x86.Build.0 = Debug|Win32
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Release|x64.ActiveCfg = Release|x64
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Release|x64.Build.0 = Release|x64
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Release|x86.ActiveCfg = Release|Win32
+		{793D4CC3-54E8-4F18-89A3-39B4682A6BE5}.Release|x86.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+		SolutionGuid = {5D9BB196-7D7F-4F17-8B2A-1534A71A307B}
+	EndGlobalSection
+EndGlobal

Windows_List/Windows_List.vcxproj

@@ -0,0 +1,138 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup Label="ProjectConfigurations">
+    <ProjectConfiguration Include="Debug|Win32">
+      <Configuration>Debug</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|Win32">
+      <Configuration>Release</Configuration>
+      <Platform>Win32</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Debug|x64">
+      <Configuration>Debug</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+    <ProjectConfiguration Include="Release|x64">
+      <Configuration>Release</Configuration>
+      <Platform>x64</Platform>
+    </ProjectConfiguration>
+  </ItemGroup>
+  <PropertyGroup Label="Globals">
+    <VCProjectVersion>17.0</VCProjectVersion>
+    <Keyword>Win32Proj</Keyword>
+    <ProjectGuid>{793d4cc3-54e8-4f18-89a3-39b4682a6be5}</ProjectGuid>
+    <RootNamespace>WindowsList</RootNamespace>
+    <WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>true</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
+    <ConfigurationType>Application</ConfigurationType>
+    <UseDebugLibraries>false</UseDebugLibraries>
+    <PlatformToolset>v143</PlatformToolset>
+    <WholeProgramOptimization>true</WholeProgramOptimization>
+    <CharacterSet>Unicode</CharacterSet>
+  </PropertyGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
+  <ImportGroup Label="ExtensionSettings">
+  </ImportGroup>
+  <ImportGroup Label="Shared">
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
+  </ImportGroup>
+  <PropertyGroup Label="UserMacros" />
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
+    <ClCompile>
+      <WarningLevel>Level3</WarningLevel>
+      <FunctionLevelLinking>true</FunctionLevelLinking>
+      <IntrinsicFunctions>true</IntrinsicFunctions>
+      <SDLCheck>true</SDLCheck>
+      <PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
+      <ConformanceMode>true</ConformanceMode>
+    </ClCompile>
+    <Link>
+      <SubSystem>Console</SubSystem>
+      <EnableCOMDATFolding>true</EnableCOMDATFolding>
+      <OptimizeReferences>true</OptimizeReferences>
+      <GenerateDebugInformation>true</GenerateDebugInformation>
+    </Link>
+  </ItemDefinitionGroup>
+  <ItemGroup>
+    <ClInclude Include="List.hpp" />
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="List.cpp" />
+  </ItemGroup>
+  <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
+  <ImportGroup Label="ExtensionTargets">
+  </ImportGroup>
+</Project>

Windows_List/Windows_List.vcxproj.filters

@@ -0,0 +1,27 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <ItemGroup>
+    <Filter Include="源文件">
+      <UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
+      <Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
+    </Filter>
+    <Filter Include="头文件">
+      <UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
+      <Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
+    </Filter>
+    <Filter Include="资源文件">
+      <UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
+      <Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
+    </Filter>
+  </ItemGroup>
+  <ItemGroup>
+    <ClInclude Include="List.hpp">
+      <Filter>头文件</Filter>
+    </ClInclude>
+  </ItemGroup>
+  <ItemGroup>
+    <ClCompile Include="List.cpp">
+      <Filter>源文件</Filter>
+    </ClCompile>
+  </ItemGroup>
+</Project>

Windows_List/Windows_List.vcxproj.user

@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project ToolsVersion="Current" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
+  <PropertyGroup />
+</Project>

Windows_List/x64/Debug/Windows_List.exe.recipe

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="utf-8"?>
+<Project>
+  <ProjectOutputs>
+    <ProjectOutput>
+      <FullPath>E:\Git 仓库\公开仓库\5_List\Windows_List\x64\Debug\Windows_List.exe</FullPath>
+    </ProjectOutput>
+  </ProjectOutputs>
+  <ContentFiles />
+  <SatelliteDlls />
+  <NonRecipeFileRefs />
+</Project>

Windows_List/x64/Debug/Windows_List.log

@@ -0,0 +1,2 @@
+  List.cpp
+  Windows_List.vcxproj -> E:\Git 仓库\公开仓库\5_List\Windows_List\x64\Debug\Windows_List.exe

Windows_List/x64/Debug/Windows_List.tlog/Cl.items.tlog

@@ -0,0 +1 @@
+E:\Git 仓库\公开仓库\5_List\Windows_List\List.cpp;E:\Git 仓库\公开仓库\5_List\Windows_List\x64\Debug\List.obj

Windows_List/x64/Debug/Windows_List.tlog/Windows_List.lastbuildstate

@@ -0,0 +1,2 @@
+PlatformToolSet=v143:VCToolArchitecture=Native64Bit:VCToolsVersion=14.37.32822:TargetPlatformVersion=10.0.22000.0:
+Debug|x64|E:\Git 仓库\公开仓库\5_List\Windows_List\|

Windows_List/x64/Debug/Windows_List.vcxproj.FileListAbsolute.txt

@@ -0,0 +1 @@
+E:\Git 仓库\公开仓库\5_List\Windows_List\x64\Debug\Windows_List.exe