代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/216209/15024214
h queue.h
#ifndef _QUEUE_H
#define _QUEUE_H
#define queue_init(queue,buf,sz) queue.buffer = buf;queue.size = sz;\
queue.length = 0;queue.head = queue.tail = 0;
#define queue_unused(queue) queue.siz
www.eeworm.com/read/216209/15024221
c queue.c
#include "queue.h"
bit queue_input(Queue idata *queue,char c) reentrant{
if(queue_unused((*queue)) > 1){
queue->buffer[queue->head] = c;
queue->head = (queue->head+1)%queue->size;
queue-
www.eeworm.com/read/115116/15026106
c queue.c
#include
#define Max 100
void SetNull(front, rear)
int *front, *rear;
{
*front = 0;
*rear = 0;
}
int Empty(front,rear)
int *front, *rear;
{
if(*front == *rear)
return(1)
www.eeworm.com/read/216104/15027167
java queue.java
package association.fptree;
/**
* 树广度遍历的辅助队列,尾进头出；
* */
class Queue{
Elem head,tail,elem;
//void in(FPTree.Node node){
void in(T node){
elem=new Elem(node);
if ((head==null)&&(t
www.eeworm.com/read/215702/15052288
h queue.h
//queue.h
#ifndef QUEUE_CLASS
#define QUEUE_CLASS
#include
#include
using namespace std;
#include "link.h"
template
class Queue
{
private:
// 用
www.eeworm.com/read/214878/15085302
h queue.h
#ifndef QUEUE_H_
#define QUEUE_H_
#include "list.h"
#include "StartConv.h"
template
class queue : list // Private inheritance
{
public:
int size( ) const
{ re
www.eeworm.com/read/214878/15085310
cpp queue.cpp
#ifndef QUEUE_CPP_
#define QUEUE_CPP_
#include "StartConv.h"
template
priority_queue::priority_queue( )
: theItems( 1 ), l
www.eeworm.com/read/214876/15085346
h queue.h
/***********************/
/* Queue类的定义 */
/***********************/
const int QueueMaxSize=100;
template
class Queue{
public:
Queue(){count=0;front=rear=0;}
~Queue(){fr
www.eeworm.com/read/214343/15105164
java queue.java
// Interface for queues.
// (c) 1998,2001 duane a. bailey
package structure;
/**
* Interface describing a first-in, first-out structure.
* Values are added at the tail, and removed from the head.
www.eeworm.com/read/213972/15119070