代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/281673/9142673
cpp bankteller.cpp
//: C04:BankTeller.cpp
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Using a queue and simulated m
www.eeworm.com/read/182872/9187632
cpp tree.cpp
#include"tree.h"
#include"node.h"
#include"member.h"
#include
typedef void (*Function)(void* node); //声明函数指针
const int MAX_QUEUE_SIZE = 100; //声明不变常量用于队列的长度
/*
www.eeworm.com/read/378741/9216956
dsw datastruct.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/378417/9231964
cpp page113.cpp
template class Queue{
public:
Queue(int=10);
void EnQueue(const Type & item);
Type DeQueue();
Type GetFront();
void MakeEmpty();
int IsEmpty() const;
www.eeworm.com/read/378417/9231969
cpp page116.cpp
#include
#define null 0
#include
template class Queue;
template class QueueNode{
friend class Queue;
private:
Type data;
www.eeworm.com/read/378417/9232010
cpp page115.cpp
#include
#include
template class Queue{
public:
Queue(int=10);
~Queue(){ delete []elements;}
void EnQueue(const Type & item);
Type DeQueue
www.eeworm.com/read/378375/9233428
java fac6_3_1.java
//本程序取自王晓东编著“算法分析与设计”第 204 页，例
//装载问题的分支限界改进解法
class FIFOBBloding
{
static int n; // 当前最优载重量
static int bestw; // 活结点队列
static ArrayQueue queue;
publi
www.eeworm.com/read/378375/9233441
java fac6_3_2.java
//本程序取自王晓东编著“算法分析与设计”第 205 页，例
//装载问题的分支限界改进解法（构造最优解）
private static class QNode
{
QNode parent;
boolean leftChild;
int weight;
//
private QNode(QNode theParent,b
www.eeworm.com/read/378375/9233460
java fac6_3.java
//本程序取自王晓东编著“算法分析与设计”第 198 页，例
//装载问题的分支限界解法
class Element implements Comparable
{
int w;
int id;
public Element(int ww,int ii)
{
w=ww;
id=i
www.eeworm.com/read/181685/9241549
h tagseqqueue.h
class TagSeqQueue
{
private:
DataType data[maxQueueSize];
int front;
int rear;
int tag;
public:
TagSeqQueue()
{front=rear=0;
tag=0;
};
~TagSeqQueue(){};
void Append(const DataTy