代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/212376/15157325
m stack.m
function ST=stack(v)
% 调用格式
% ST=stack 创建一个"空"堆栈对象.
% ST=stack(v) 创建包含变量v的堆栈对象。
if nargin>1;error('Too many arguments.');end;
if nargin==0 % 没有输入宗量情况
Q=queue;
s.value=[];
www.eeworm.com/read/211952/15170009
dpr p1487.dpr
program p1487;
{$APPTYPE CONSOLE}
type
point=^node;
node=record
card:integer;
left,right:point;
end;
var
n,m
www.eeworm.com/read/211352/15182598
java seqcircularqueue.java
package circularQueue;
public class SeqCircularQueue implements Queue
{
private int front=0,rear=0;
private Object[] queue;
public SeqCircularQueue(int maxSize){queue=new Object[maxSize];}
www.eeworm.com/read/211015/15188772
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/210310/15202016
java blockingqueuetest.java
import java.io.*;
import java.util.*;
import java.util.concurrent.*;
public class BlockingQueueTest
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
S
www.eeworm.com/read/209876/15212350
cpp 1.cpp
#include
//队列类声明
class queue
{
private:
char *table;
int size;
int front,rear;
public:
queue(int n=0);
~queue();
bool isempty();
bool isfull();
bool enqueue(const c
www.eeworm.com/read/209766/15214646
cpp fifo.cpp
#include "iostream.h"
#define MAXLEN 3
typedef int elemtype;
typedef struct
{
elemtype data[MAXLEN];
int front,rear;
}queue;
void init(queue *sq)
www.eeworm.com/read/209537/15217740
frm form1.frm
VERSION 5.00
Begin VB.Form Form1
BorderStyle = 1 'Fixed Single
Caption = "银行离散事件模拟"
ClientHeight = 5220
ClientLeft = 3840
ClientTop = 2115
www.eeworm.com/read/209121/15227174
c fragment.c
#include "package.h"
/* Queue of FragSdu */
/* for power save buffers, etc., searchable with Qsearch operator: */
/* index:= Qsearch(queue, addr) where queue is an SduQueue, */
/* index identi
www.eeworm.com/read/208727/15238650
cpp 单链表.cpp
#include
class Time{
public:
Time()
{ h = m = 0;
}
Time(int hr, int min)
{ if (hr>=0 && hr=0 && min