代码搜索：QueueNode
找到约 295 项符合「QueueNode」的源代码
代码结果 295
www.eeworm.com/read/392483/8340483
h queue.h
//处理起飞或降落的飞机队列，本题用环形队列
#ifndef QUEUE_H
#define QUEUE_H
#include
template class Queue;
template
class QueueNode
{
friend class Queue;
private:
www.eeworm.com/read/269229/11105125
cpp linqueue.cpp
//链式队列的实现linqueue.cpp
#include "linqueue.h"
// 判断队空
int linkqueue::queueempty()
{return front==NULL&&rear==NULL;}
// 判断队满
int linkqueue::queuefull()
{return count==QueueSize;}
// 入队(队列的插入)
vo
www.eeworm.com/read/267018/11196893
txt q.txt
#include
#include
#include
#define MAX 4/*车库容量*/
typedef struct node
{char num[10];
}CarNode;/*车辆信息结点*/
typedef struct NODE{
CarNode *stack[MAX+1];
i
www.eeworm.com/read/335940/12489224
txt 停车场管理.txt
#include
#include
#include
#define MAX 2 /*车库容量*/
#define price 0.1 /*每车每分钟费用*/
/*----------------------------------定义数据类型----------------------------------*/
www.eeworm.com/read/335940/12489227
cpp 停车场管理.cpp
#include
#include
#include
#define MAX 2 /*车库容量*/
#define price 0.1 /*每车每分钟费用*/
/*----------------------------------定义数据类型----------------------------------*/
www.eeworm.com/read/335782/12499616
cpp tingchechangwenti.cpp
#include
#include
#include
#define MAX 10 /*车库容量*/
#define price 0.05 /*每车每分钟费用*/
typedef struct time
{
int hour;
int min;
}Time; /*时间结点*/
typede
www.eeworm.com/read/334768/12574881
txt park.txt
/*停车场管理系统*/
#include
#include
#include
/*------------------------------------------------------------------------------*/
#define MAX 2 /*车库容量*/
#define price 0.05 /
www.eeworm.com/read/204469/15338905
h queue.h
#include
#define null 0
#include
template class Queue;
template class QueueNode{
friend class Queue;
friend ostream& operator
www.eeworm.com/read/204469/15338994
cpp page116.cpp
#include
#define null 0
#include
template class Queue;
template class QueueNode{
friend class Queue;
private:
Type data;
www.eeworm.com/read/204469/15338997
h queue.h
#include
#define null 0
#include
template class Queue;
template class QueueNode{
friend class Queue;
private:
Type data;