代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/114928/15033880
cpp seqqueue.cpp
#include"SeqQueue.h"
#include
#include
SeqQueue::SeqQueue(){
f = 0;r = 0;
}
int SeqQueue::isEmptyQueue(){
return(f==r);
}
void SeqQueue::enQueue(int x){
if (r+
www.eeworm.com/read/215702/15052460
h 9_10.h
///9_10.h
#ifndef QUEUE_CLASS
#define QUEUE_CLASS
#include
#include
using namespace std;
const int MaxQSize = 50; //队列元素最大个数
//类的声明
template
class Queue
{
www.eeworm.com/read/114232/15063021
c 23.c
#define NULL 0
#include
#include
#include
#include
//定义一个pcb的结构体
FILE *GroupFile[10];
typedef struct index{
char name; //指令
int time; //指令执行时间
}index;
struct pcb {
char filename
www.eeworm.com/read/214876/15085341
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/114100/15101305
html 20010.html
VB how to control(know) Printer Queue
VB how to control(know) Printer Queue
www.eeworm.com/read/214343/15104987
java skewheap.java
// Implementation of priority queues/heaps using binary trees.
// (c) 1998, 2001 duane a. bailey
package structure;
import java.util.Iterator;
import java.util.Random;
/**
* An implementation of a p
www.eeworm.com/read/213874/15123669
java messagequeue.java
import java.util.*;
public class MessageQueue {
public MessageQueue(){
queue = new Vector();
}
public void send(Object item){
queue.addElement(item);
t3.setText("send");
}
public Obj
www.eeworm.com/read/213371/15136402
java eventdriver.java
package simcpu;
import java.util.PriorityQueue;
public class EventDriver {
int now=0,last=0;
SimSystem sys;
public EventDriver(SimSystem sys) {
super();
this.sys = sys;
}
p
www.eeworm.com/read/212376/15157232
m comein.m
function q=comein(p,varargin)
% @QUEUE\COMEIN a variable comes to the end of a queue.
% 调用格式
% comein(p,a,b,...) 使输入宗量a,b等排在p之后形成新队列，
% 其名沿用p位置上的输入队列名.
% q=comein(p,a,b,...) 使输入宗量a,