📄 circular-q.h
字号:
#include "packet.h"//Header file for Queue class//const MaxQueue = 5;const int True = 1;const int False = 0;class CQueue{ protected: int Front; int Rear; int NumItems; int MaxQueue; double time_limit; double t[100]; /* time stamp of each packet */ Packet *Items[100]; public: CQueue(); CQueue(int QueueSize); void Insert(double ts, Packet *pkt, //input - data to insert int *Success); //output - program flag void Remove(double *ts, Packet **pkt, //output - data removed int *Success); //output - program flag void Retrieve(double *ts, Packet **pkt, //output - data retrieve int *Success); //output - program flag int IsEmpty(); int IsFull(); int SizeOfQueue(); int SizeofMaxQueue(); double TimeLimit(); void SetTimeLimit(double tl);};
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -