代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/413622/11149353
cpp a.cpp
#include
#define maxnode 8
#define max 5
struct node
{
int mark;
node *next;
};
struct Graph
{
int n,e;
node *graphvertex[maxnode];
};
Graph*creatgraph()
{
Graph*g
www.eeworm.com/read/413622/11149361
cpp a.cpp
#include
#define maxnode 8
struct node
{
int mark;
node *next;
};
struct Graph
{
int n,e;
node *graphvertex[maxnode];
};
Graph*creatgraph()
{
Graph*graph=new Graph;
i
www.eeworm.com/read/266961/11199726
h logqueue.h
#ifndef LOGQUEUE_H
#define LOGQUEUE_H
/*
日志队列
采用list 就已经足够了。
采用信号灯模式获取资源，当信号灯
*/
class LOGQueue{
public:
LOGQueue(UINT limit)
{
handles[SemaphoreIndex] = ::CreateSemapho
www.eeworm.com/read/266537/11220246
c dungeon.c
/* Contest : Ulm Local Contest 1997
* Problem D : Dungeon Master
* Method : Breadth-First Search
* Author : Mark Dettinger
* Date : May 29, 1997
*/
#include
#include
www.eeworm.com/read/265456/11263849
txt 数据结构实现－队列－循环队列－用链表实现[anank].txt
/*********************************************************************************
** Program Name : implementation of circle queue ( by chain )
** Author Name : Lu Jian Hua
** Time : 2007
www.eeworm.com/read/336165/12467028
pas listform.pas
unit ListForm;
interface
uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
StdCtrls, Contnrs;
type
TForm1 = class(TForm)
ButtonAdd: TButton;
Bu
www.eeworm.com/read/336008/12482633
java bank.java
import java.awt.*;
import java.awt.event.*;
public class Bank extends Business implements Runnable
{
private Queue queue = null;
public Bank()
{
super("The Bank");
queue = new Queue()
www.eeworm.com/read/336008/12482648
java supermarket.java
import java.awt.*;
import java.awt.event.*;
public class Supermarket extends Business
{
private Queue[] queue = new Queue[Simulator.NUM_AGENTS];
public Supermarket()
{
super("The Superma
www.eeworm.com/read/335795/12498184
cpp main7.cpp
// Section 16.7
// $ CC main7.cpp
/*
< 0 3 6 9 >
< 2 4 6 8 10 >
*/
#include "Queue.h"
#include "Queue.cpp"
using std::cout;
#include
using std::vector;
int main()
{
www.eeworm.com/read/249070/12523381
txt c07p357b.txt
// ********************************************************
// Implementation file QueueL.cpp for the ADT queue.
// ADT list implementation.
// ********************************************************