代码搜索：QueueNode
找到约 295 项符合「QueueNode」的源代码
代码结果 295
www.eeworm.com/read/212829/15148301
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/212828/15148490
c 12-13.c
#include "stdio.h"
#include "malloc.h"
//#define n 10
#define QueueSize 100 //假定预分配的队列空间最多为100个元素
typedef int DataType; //假定队列元素的数据类型为字符
typedef struct node{
DataType data;
struct node *nex
www.eeworm.com/read/212828/15148548
c 4-7.c
#include "stdio.h"
#define QueueSize 100 //假定预分配的队列空间最多为100个元素
typedef char DataType ; //假定队列元素的数据类型为字符
typedef struct node{
DataType data;
struct node *next;
}QueueNode;
typedef struct{
www.eeworm.com/read/212828/15148564
c 4-10.c
#include "stdio.h"
#define m 100
#define QueueSize 100 //假定预分配的队列空间最多为100个元素
typedef struct info{
int row;
int col;
}Position;
typedef Position DataType ; //假定队列元素的数据类型为字符
typedef struct n
www.eeworm.com/read/210671/15193972
h queue.h
// QUEUE.H
// Definition of class Queue
#ifndef QUEUE_H
#define QUEUE_H
#include
#include
#include "queuend.h"
using std::cout;
template
class Queue {
pu
www.eeworm.com/read/208727/15238650
cpp 单链表.cpp
#include
class Time{
public:
Time()
{ h = m = 0;
}
Time(int hr, int min)
{ if (hr>=0 && hr=0 && min
www.eeworm.com/read/159761/6786539
java queue.java
/**
* Title:
* Description:
* Copyright: Copyright (c) 2005
* Company:
* @author not attributable
* @version 1.0
*/
public class Queue {
private class QueueN
www.eeworm.com/read/159761/6786552
java~1~ queue.java~1~
/**
* Title:
* Description:
* Copyright: Copyright (c) 2005
* Company:
* @author not attributable
* @version 1.0
*/
public class Queue {
private class QueueN
www.eeworm.com/read/182642/6840488
cpp queue.cpp
#include
#include
#include
#include "Queue.h"
//置空队
void InitQueue(LinkQueue *Q)
{
Q->front = Q->rear = NULL;
}
//判队空
int QueueEmpty(LinkQueue *Q)
{
www.eeworm.com/read/395294/8186749
h queue.h
#ifndef QUEUE_CLASS
#define QUEUE_CLASS
#include
#include
template
class Queue;
template
class QueueNode
{
friend class Queue;
private: