代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/122684/14674262
cpp bankteller.cpp
//: C20:BankTeller.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 1999
// Copyright notice in Copyright.txt
// Using a queue and simula
www.eeworm.com/read/122561/14683917
dpr putgetdemo.dpr
program PutGetDemo;
// **************************************************************************
// **************************************************************************
// ****************
www.eeworm.com/read/122383/14695997
cpp bfs.cpp
/******Don't forget to download*****
*****GRAPHICAL DATA FILE STRUCTURE*****
*****A approach to learn DFS Graphically*****
Only @ http://www.vivekpatel.cjb.net */
//Breadth First Search
www.eeworm.com/read/122383/14696015
bak bfs.bak
//Breadth First Search Traversal (BFS)
#include
#include
#define MAX_NODE 50
struct node{
int vertex;
node *next;
};
node *adj[MAX_NODE]; //For storing Adjacency
www.eeworm.com/read/221894/14715677
h 9_10.h
//9_10.h
#ifndef QUEUE_CLASS
#define QUEUE_CLASS
#include
#include
const int MaxQSize = 50; //队列元素最大个数
//类的定义
template
class Queue
{
private:
www.eeworm.com/read/221726/14725802
cpp grama.cpp
#include
#include
#include
#include "GRAMA.h"
CGRAMA::CGRAMA():start_symbol(-5) //构造函数
{
char *buf,ch;
List buflist;
int i=0;
ifstream
www.eeworm.com/read/121363/14758638
cpp 3.cpp
#include
#include
#define NULL 0
typedef struct node{
int data;
int num;
node *next;
}node,*queue;
typedef struct{
queue front;
queue rear;
}sqQueue;
www.eeworm.com/read/121315/14760257
txt 进程调度模拟程序.txt
#define NULL 0
#include
#include
#include
#include
//定义一个pcb的结构体
FILE *GroupFile[10];
typedef struct index{
char name; //指令
www.eeworm.com/read/121304/14760481
java topicserverimpl.java
/*
* Copyright 1999 by dreamBean Software,
* All rights reserved.
*/
import java.io.IOException;
import java.util.Collection;
import java.util.ArrayList;
import java.util.Iterator;
impo
www.eeworm.com/read/121167/14768070
cpp page113.cpp
template class Queue{
public:
Queue(int=10);
void EnQueue(const Type & item);
Type DeQueue();
Type GetFront();
void MakeEmpty();
int IsEmpty() const;