代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/249070/12523616
txt c11p627.txt
// *********************************************************
// Implementation file PQ.cpp for the ADT priority queue.
// A heap represents the priority queue.
// *************************************
www.eeworm.com/read/249070/12523942
cpp pq.cpp
// *********************************************************
// Implementation file PQ.cpp for the ADT priority queue.
// A heap represents the priority queue.
// *************************************
www.eeworm.com/read/249070/12524255
cpp queuel.cpp
// ********************************************************
// Implementation file QueueL.cpp for the ADT queue.
// ADT list implementation.
// ********************************************************
www.eeworm.com/read/248954/12530270
cpp 10_14.cpp
#include
#include
using namespace std;
int main()
{ queue< double > q; //创建空的队列容器
q.push( 3.2 ); q.push( 9.8 ); q.push( 5.4 ); //向空的队列容器添加元素
cout
www.eeworm.com/read/335316/12539811
txt treatment.txt
import java.io.*;
public class Treatment {
public static void main(String args[])throws IOException
{
char s;
QueueArray Queue=new QueueArray();
int Number=
www.eeworm.com/read/147630/12541461
cpp astar.cpp
#include
#include
#include
#define MAPMAXSIZE 200 //地图面积最大为 100x100 1152x768
#define MAXINT (100) //定义一个最大整数, 地图上任意两点距离不会超过它
#define STACKSIZE (500) //保
www.eeworm.com/read/334853/12569404
cpp syncedcoach.cpp
/*
* Copyright 2002-2005, Mersad Team, Allameh Helli High School (NODET).
*
* This program is free software, you can redistribute it and/or modify
* it under the terms of the GNU General Public
www.eeworm.com/read/334577/12585495
cpp testqueue.cpp
#include "testQueue.h"
void testQueue()
{
cout
www.eeworm.com/read/247673/12632491
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/146409/12652131
h queueadt.h
template
struct NODE
{
TYPE data;
NODE *next;
};
//Class Declaration
template
class Queue
{
private:
NODE *front;
int count;
NODE