代码搜索:queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/155949/11836952
c digit15.c
#include
#include
#define MAX 1000
#define BUFMAX 10
#define FALSE 0
#define TRUE 1
#define BDMAX 5
#define LEFT 1
#define RIGHT 2
#define UP 3
#define D
www.eeworm.com/read/258191/11877651
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 simulated m
www.eeworm.com/read/155327/11884248
h cqueue.h
templateclass queue
{
public:
virtual void deleteAllValues()=0;
virtual T dequeue()=0;
virtual void enqueue(T value)=0;
virtual T front()=0;
virtual int isEmpty()const=0;
}
www.eeworm.com/read/155309/11885531
java bank.java
/*
* 创建日期 2005-2-26
*
* TODO 要更改此生成的文件的模板,请转至 窗口 - 首选项 - Java - 代码样式 - 代码模板
*/
package simulator;
import java.awt.*;
import java.awt.event.*;
public class Bank extends Business implem
www.eeworm.com/read/155309/11885551
java supermarket.java
/*
* 创建日期 2005-2-26
*
* TODO 要更改此生成的文件的模板,请转至 窗口 - 首选项 - Java - 代码样式 - 代码模板
*/
package simulator;
import java.awt.*;
import java.awt.event.*;
public class Supermarket extends Business
www.eeworm.com/read/344239/11896235
java priorityblockingqueuedemo.java
//: concurrency/PriorityBlockingQueueDemo.java
import java.util.concurrent.*;
import java.util.*;
import static net.mindview.util.Print.*;
class PrioritizedTask implements
Runnable, Comparable
www.eeworm.com/read/155053/11900343
pas eightnumberfrm.pas
unit EightNumberFrm;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, StdCtrls, ExtCtrls, Grids, ComCtrls;
t
www.eeworm.com/read/155053/11900361
~pas eightnumberfrm.~pas
unit EightNumberFrm;
interface
uses
Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms,
Dialogs, StdCtrls, ExtCtrls, Grids, ComCtrls;
t
www.eeworm.com/read/257293/11934854
c sort_radix.c
/* 基数排序的算法源程序*/
#include
#define D 3 /* D为排序码的最大位数 */
#define R 10 /* R为基数 */
typedef int KeyType;
typedef int DataType;
struct Node
www.eeworm.com/read/257099/11950147
cpp tu-shixian.cpp
#include
#include
#include
#include "tu.head"
bool visited[MAX_VERTEX_NUM];
void CreateGraph(ALGraph &G){
int i, j = 0, k = 0;
char hand, tide;
ArcNode