C++stack&queue&priority_queue底层实现代码(适配器)

1.stack的底层实现代码

#pragma once
#include<iostream>
#include<vector>
#include<list>
#include<deque>

//适配器模式:一种设计模式
namespace zh
{
	template<class T, class Container = deque<T>>
	class stack
	{
	public:

		bool empty() const
		{
			return _con.empty();
		}

		const T& top() const
		{
			return _con.back();
		}

		size_t size() const
		{
			return _con.size();
		}

		void push(const T& x)
		{
			_con.push_back(x);
		}

		void pop()
		{
			_con.pop_back();
		}


	private:
		Container _con;
	};


	void test_stack1()
	{
		stack<int> st;
		st.push(1);
		st.push(2);
		st.push(3);
		st.push(4);

		while (!st.empty())
		{
			std::cout << st.top() << " ";
			st.pop();
		}
		std::cout << std::endl;
	}
}

2.queue的底层实现代码

#pragma once

#include<iostream>
#include<vector>
#include<list>
#include<deque>

//适配器模式:一种设计模式
//queue一般都是头删，所以不适合用vect做Container
namespace zh
{
	template<class T, class Container = deque<T>>
	class queue
	{
	public:

		bool empty() const
		{
			return _con.empty();
		}

		const T& front() const
		{
			return _con.front();
		}

		const T& back() const
		{
			return _con.front();
		}

		size_t size() const
		{
			return _con.size();
		}

		void push(const T& x)
		{
			_con.push_back(x);
		}

		void pop()
		{
			_con.pop_front();
		}


	private:
		Container _con;
	};

	void test_queue()
	{
		queue<int> q;
		q.push(1);
		q.push(2);
		q.push(3);
		q.push(4);
		while (!q.empty())
		{
			std::cout << q.front() << " ";
			q.pop();
		}
		std::cout << std::endl;
	}

	
}

3.priority_queue实现代码

#pragma once 
#include<iostream>

namespace zh
{

	//仿函数,不管是STL还是自己实现的优先级队列,仿函数都是可以自己实现的。
	//例如priority_queue<Date*, vector<Date*>>;
	//这里的默认比较的是指针的大小而不是日期类的大小，那该怎么做呢？
	//你可以自己去实现一个仿函数：所以仿函数的实现是灵活多变的
	/*struct LessPDate
	{
		bool operator<(const Date* a, const Date* b)
		{
			return *a < *b;
		}
	};*/

	


	template<class T>
	struct less
	{
		bool operator()(const T& x, const T& y) const
		{
			return x < y;
		}
	};
	


	template<class T>
	struct gerater
	{
		bool operator()(const T& x, const T& y) const
		{
			return x > y;
		}
	};


	//默认是大堆
	template<class T, class Container = std::vector<T>, class Compare = less<T>>
	class priority_queue
	{
	public:

		//用一段迭代器空间去建立一个优先级队列
		template<class InputIterator>
		priority_queue(InputIterator first, InputIterator last)
			:_con(first, last)
		{
			//建堆
			for (int i = (size() - 1 - 1) / 2; i >= 0; --i)
			{
				adjust_down(i);
			}
		}

		priority_queue()
		{}
		

		void push(const T& x)
		{
			_con.push_back(x);
			adjust_up(_con.size() - 1);
		}

		void pop()
		{
			assert(!_con.empty());
			swap(_con[0], _con[_con.size() - 1]);
			_con.pop_back();
			adjust_down(0);
			
		}

		const T& top() const
		{
			assert(!_con.empty());
			return _con[0];
		}



		size_t size() const
		{
			return _con.size();
		}

		bool empty() const
		{
			return _con.empty();
		}


	private:
		Container _con;
		
		//向上调整
		void adjust_up(size_t child)
		{
			size_t parent = (child - 1) / 2;
			while (child > 0)
			{
				Compare com;
				if (com(_con[parent] , _con[child]))
				{
					std::swap(_con[child], _con[parent]);
					child = parent;
					parent = (child - 1) / 2;
				}
				else
				{
					break;
				}
			}
		}

		//向下调整
		void adjust_down(size_t parent)
		{ 
			
			size_t child = parent * 2 + 1;
			
			while (child < _con.size())
			{
				Compare com;
				if (child + 1 < _con.size() - 1 && com(_con[child] , _con[child + 1]))
				{
					++child;
				}

				if (com(_con[parent], _con[child]))
				{
					std::swap(_con[parent], _con[child]);
					parent = child;
					child = (2 * parent) + 1;
				}
				else
				{
					break;
				}
			}
		}

	};

	void test1()
	{
		priority_queue<int> pq;
		pq.push(3);
		pq.push(3);
		pq.push(1);
		pq.push(7);
		pq.push(9);
		while (!pq.empty())
		{
			cout << pq.top() << " ";
			pq.pop();
		}
		cout << endl;
	}

	void test2()
	{
		std::vector<int> v;
		v.push_back(1);
		v.push_back(3);
		v.push_back(9);
		v.push_back(2);
		v.push_back(6);
		v.push_back(8);

		priority_queue<int, vector<int>, greater<int>> pq(v.begin(), v.end());
		while (!pq.empty())
		{
			cout << pq.top() << " ";
			pq.pop();
		}
		cout << endl;
	}



}