代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/144074/12819407
h queue.h
#ifndef QUEUE_CLASS
#define QUEUE_CLASS
#include
#include
#include "link.h"
template
class Queue
{
private:
// a linked list object to hold th
www.eeworm.com/read/245098/12823598
o queue.o
www.eeworm.com/read/245098/12823625
c queue.c
/*
* Boa, an http server
* Copyright (C) 1995 Paul Phillips
* Copyright (C) 1997-2002 Jon Nelson
*
* This program is free software; you can redistribute i
www.eeworm.com/read/143694/12850748
h queue.h
#ifndef QUEUE_H
#define QUEUE_H
#include
#include
using namespace std;
const int MAXSIZE = 100000; //Maximum size of the queue.
const int WIDTH = 5; //Print f
www.eeworm.com/read/331093/12851998
h queue.h
const int MaxQueueSize=100;
typedef //为Datatype定义合适的类型
class SeqQueue
{
private:
Datatype data[MaxQueueSize];
int front;
int rear;
int count;
public:
SeqQueue(voi
www.eeworm.com/read/143612/12856472
c queue.c
//由顺序表构成的循环队列的算法
#define MAX 10 // 最多9个元素
#define NULL -1 //失败标志
typedef struct
{ int d[MAX] ; //用数组作为队列的储存空间
int front,rear ; //指示队头位置和队尾位置的变量
} SEQUEUE ; //顺序队列类型定义
SEQUEUE sq
www.eeworm.com/read/143612/12856494
asm queue.asm
;循环队列有关算法
FRONT EQU 2000H ;循环队列存储空间的起始地址。
N EQU 200 ;数组数据元素的个数（不超过255）。
F DATA 3EH ;队首指针的存放单元。
R DATA 3FH ;队尾指针的存放单元。
XH DATA 30H ;待入队数据高字节的存放单元。
XL DATA 31H ;待入队数据低字节的存放单元。
ORG 0000H
LJMP
www.eeworm.com/read/330930/12860537
h queue.h
/*
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are
www.eeworm.com/read/244387/12869455
h queue.h
/*
* File: queue.h
* -------------
* This file provides an interface to a simple queue
* abstraction.
*/
#ifndef _queue_h
#define _queue_h
#include "genlib.h"
/*
* Type: queueADT
* ---------
www.eeworm.com/read/244387/12869468
c queue.c
/*
* File: queue.c
* -------------
* This file implements the queue.h abstraction using an array.
*/
#include
#include "genlib.h"
#include "queue.h"
/*
* Constants:
* ----------
*