priority_queue

Ⅰ.priority_queue的用法

1.priority_queue对象的创建

void test_priority_queue1()
{
	priority_queue<int> pq;
}

2.priority_queue的销毁

• 编译器自动调用

3.priority_queue的增

void test_priority_queue2()
{
	priority_queue<int> pq;
	pq.push(1);
	pq.push(4);
	pq.push(3);
	pq.push(2);
}

4.priority_queue的删

void test_priority_queue2()
{
	priority_queue<int> pq;
	pq.push(1);
	pq.push(4);
	pq.push(3);
	pq.push(2);
	pq.pop();
	pq.pop();
}

5.priority_queue的查(无)

6.priority_queue的改(无)

Ⅱ. priority_queue的底层原理

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

template<class T>
struct greater
{
	bool operator()(const T& t1, const T& t2)
	{
		return t1 > t2;
	}
};
// less (小的向上调整，故小堆，降序)
// greater(大的向上调整，故大堆，升序)

//       数据类型           适配器                   仿函数
template<class T,class container = vector<T>,class compare = less<T>>
class priority_queue
{
public:
	void adjust_up(size_t child)
	{
		compare com;
		size_t parent = (child - 1) / 2;

		while (child > 0)
		{
			//if (_con[child] > _con[parent])
			//if ( _con[parent] < _con[child])
			if (com(_con[parent], _con[child]))
			{
				swap(_con[child], _con[parent]);
				child = parent;
				parent = (child - 1) / 2;
			}
			else
			{
				break;
			}
		}
	}
	void push(const T& x)
	{
		_con.push_back(x);
		adjust_up(_con.size() - 1);
	}
	void adjust_down(size_t parent)
	{
		compare com;
		size_t child = parent * 2 + 1;

		while (child < _con.size())
		{
			//if (child + 1 < _con.size() && _con[child + 1] > _con[child])
			//if (child + 1 < _con.size() &&  _con[child]< _con[child + 1])
			if (child + 1 < _con.size() && com(_con[child] ,_con[child+1]))
			{
				child++;
			}

			if (com(_con[parent], _con[child]))
			{
				swap(_con[child], _con[parent]);
				parent = child;
				child = parent * 2 + 1;
			}
			else
			{
				break;
			}
		}
	}
	void pop()
	{
		swap(_con[0], _con[_con.size() - 1]);
		_con.pop_back();
		adjust_down(0);
	}
	bool empty()
	{
		return _con.empty();
	}
	size_t size()
	{
		return _con.size();
	}

	const T& top()
	{
		return _con[0];
	}


private:
	container _con;
};