C++初阶：容器队列priority_queue常用接口详解及模拟实现、仿函数介绍原创

3.模拟priority_queue

文件规划和一览

priority_queue.h：用于实现队列

test.cpp:进行测试

3.1模拟priority_queue（priority_queue.h）

#pragma Oncenamespace MyPriority_queue{templateclass less{public:booloperator()(const T& a, const T&b){return a < b;}};templateclassgreater{public:booloperator()(const T& a, const T& b){return a > b;}};template, class Compare = less>//默认是大堆classpriority_queue{public:void adjustment_up (int child){Compare com;intfather = (child - 1) / 2;//得到父节点的索引 while (child > 0)//再向上也只能到0{if (com(_con[father) ], _con[child])){swap(_con[father], _con[child]);child=father;father= (child - 1) / 2;//更新两个节点}else{break;}}}无效调整_down(intfather){比较com;intchild=father*2+1;//假设左孩子增大while(child<_con.size()){if(child+1<_con.size()&&com( _con[child], _con[child + 1]))//右孩子存在且比左孩子大{child++;}if(com(_con[father], _con[child])){swap(_con[father], _con[child]);father=child;child =father * 2 + 1;//更新两个节点}else{break;}}}void push(const T& x){_con.push_back(x);adjust_up(_con .size() - 1);} //先交换后再调整void pop(){swap(_con[0], _con[_con.size() - 1]);_con.pop_back();adjust_down( 0);}const T& top(){return _con[0];}size_t size(){return _con.size();}bool empty(){return _con.empty();}private:Container _con;}; }

3.2测试（test.cpp)

#define _CRT_SECURE_NO_WARNINGS 1#include#include#includeusing namespace std;#include"priority_queue.h"int main(){MyPriority_queue::priority_queue pq;//这里默认是大堆 pq.push(3);pq.push(2 );pq.push(6);pq.push(9);while (!pq.empty()){cout << pq.top() << " ";pq.pop();}cout << endl;priority_queue , MyPriority_queue::greater> pq2;pq2.push(2);pq2.push(6);pq2.push(9);while (!pq2.empty()){cout << pq2.top() << " ";pq2.pop();}cout << endl;return 0;}

后天开学，今天也才到学校，大家正月十五就一人在宿舍过了😭😭😭
到了人口这个，容器的部分我们大都讲完了啦！分享吧！！！