代码搜索：QueueNode
找到约 295 项符合「QueueNode」的源代码
代码结果 295
www.eeworm.com/read/258826/11840041
cpp 1.cpp
// 时间片轮转调度算法
#include
#include
#include
#include
using namespace std;
enum STATUS {RUN,READY,WAIT,FINISH};
struct PCBNode
{
int processID;
www.eeworm.com/read/258649/11848034
cpp fcfs.cpp
// 时间片轮转调度算法
#include
#include
#include
#include
using namespace std;
enum STATUS {RUN,READY,WAIT,FINISH};
struct PCBNode
{
int processID;
www.eeworm.com/read/258648/11848057
cpp enterqueue.cpp
#include "class.h"
void HPF::enterQueue(int k)
{
QueueNode *p=Q.head;
QueueNode *q=Q.head->next;
QueueNode *t;
if (Q.head->next==Q.tail)
{
t=new QueueNode;
Q.head->next=t;
www.eeworm.com/read/258647/11848112
cpp enterqueue.cpp
#include "class.h"
void MFQ::enterQueue(int i,int j)
{
for(QueueNode *p=Q[i].head;p->next!=Q[i].tail;p=p->next) ;
QueueNode *q=new QueueNode;
q->ID=j;
p->next=q;
q->next=Q[i].tai
www.eeworm.com/read/258207/11876922
cpp rr.cpp
// 时间片轮转调度算法
#include
#include
#include
#include
using namespace std;
enum STATUS {RUN,READY,WAIT,FINISH};
struct PCBNode
{
int processID;
www.eeworm.com/read/258205/11876948
cpp fcfs.cpp
// 时间片轮转调度算法
#include
#include
#include
#include
using namespace std;
enum STATUS {RUN,READY,WAIT,FINISH};
struct PCBNode
{
int processID;
www.eeworm.com/read/258203/11876971
cpp enterqueue.cpp
#include "class.h"
void HPF::enterQueue(int k)
{
QueueNode *p=Q.head;
QueueNode *q=Q.head->next;
QueueNode *t;
if (Q.head->next==Q.tail)
{
t=new QueueNode;
Q.head->next=t;
www.eeworm.com/read/258196/11877234
cpp enterqueue.cpp
#include "class.h"
void MFQ::enterQueue(int i,int j)
{
for(QueueNode *p=Q[i].head;p->next!=Q[i].tail;p=p->next) ;
QueueNode *q=new QueueNode;
q->ID=j;
p->next=q;
q->next=Q[i].tai
www.eeworm.com/read/252659/12272440
txt carpark.txt
#include "stdio.h"
#include "stdlib.h"
#include "string.h"
/*------------------------------------------------------------------------------*/
#define MAX 2 /*车库容量*/
#define price 0.05 /*每车每分
www.eeworm.com/read/338760/12286128
txt linqueue.h.txt
template class LinQueue; //前视定义,否则友元无法定义
template
class QueueNode
{
friend class LinQueue; //定义类LinQueue为友元
private:
QueueNode *next; //指针
T data;