代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/297340/8028965
h queue.h
/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
/* Modified and extended by Pablo Martin and Paula Ballester,
* Strathclyde University, Glasgow.
* June, 2003.
*/
/* Copyr
www.eeworm.com/read/196983/8037701
mak queue.mak
# ****************************************************************************
# * *
# * queue.mak
www.eeworm.com/read/196983/8037757
h queue.h
/*****************************************************************************
* *
* ------------------------------- queue
www.eeworm.com/read/196983/8037802
c queue.c
/*****************************************************************************
* *
* ------------------------------- queue
www.eeworm.com/read/397473/8043722
vi queue.vi
www.eeworm.com/read/397011/8072344
java queue.java
package exec.day1002;
import java.util.*;
public class Queue implements Iterable{
private LinkedList list;
public Queue(){
list = new LinkedList();
}
public void in(A a){
list
www.eeworm.com/read/296787/8077240
h queue.h
#include "common.h"
typedef int QElemType;
typedef struct QNode{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct{
QueuePtr front; //队头指针
QueuePtr rear; //队尾指针
www.eeworm.com/read/296787/8077272
cpp queue.cpp
#include "stdafx.h"
#include
#include "queue.h"
Status InitialQueue(Queue &Q){
//构造一个穿队Q
Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode));
if(!Q.front) exit(OVERFLOW);
Q.front
www.eeworm.com/read/396882/8085145
h queue.h
#ifndef QUEUE_H
#define QUEUE_H
#include
using std::cerr;
using std::ostream;
#include
using std::exit;
// declaration of QueueItem
template class QueueIte
www.eeworm.com/read/396882/8085178
cpp queue.cpp
template
Queue::~Queue()
{
while ( ! is_empty() )
remove();
}
template
void Queue::add( const Type &val )
{
// allocate