代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/201477/15407726
cpp lqueue.cpp
// test linked queue class
#include
#include "lqueue.h"
void main(void)
{
LinkedQueue Q;
int x;
try {Q.Add(1).Add(2).Add(3).Add(4);
cout
www.eeworm.com/read/200131/15440166
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,
www.eeworm.com/read/200131/15440259
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/113906/15444487
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/113544/15453531
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/113120/15470072
h hanoi.h
#pragma once
#include
#include
#include
using namespace std;
class Hanoi
{
public:
Hanoi(void);
~Hanoi(void);
bool initial(int);
void PrintPath(int);
www.eeworm.com/read/113029/15472099
cpp fig21_25.cpp
// Fig. 21.25: fig21_25.cpp
// Standard library adapter priority_queue test program.
#include
using std::cout;
using std::endl;
#include // priority_queue adapter definiti
www.eeworm.com/read/113029/15472336
cpp fig17_14.cpp
// Fig. 17.14: fig17_14.cpp
// Template Queue class test program.
#include
using std::endl;
#include "queue.h" // Queue class definition
int main()
{
Queue< int > intQueue;
www.eeworm.com/read/112473/15484685
cpp testproglinkedqueue.cpp
//Test Program linked queue
#include
#include "linkedQueue.h"
using namespace std;
int main()
{
linkedQueueType queue;
int x, y;
queue.initializeQueue();
x = 4;
www.eeworm.com/read/112403/15486052
txt 循环队列的出入队程序.txt
#define MAXN 26
int q[MAXN];
int head=0,tail=0,tag=0;
main()
{
int i,j,z,k,t;
int p;
printf("\nInput the number\n");
scanf("%d",&j);
printf("\nInput the number in the queue.\n");
for (i=0