代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/389494/8517195
cpp 数据结构实现－队列－循环队列－用链表实现[anank].cpp
/*********************************************************************************
** Program Name : implementation of circle queue ( by chain )
** Author Name : Lu Jian Hua
** Time : 2007
www.eeworm.com/read/389448/8519610
java fac6_3.java
//本程序取自王晓东编著“算法分析与设计”第 198 页，例
//装载问题的分支限界解法
class Element implements Comparable
{
int w;
int id;
public Element(int ww, int ii)
{
w = ww;
id = ii;
}
public
www.eeworm.com/read/389379/8525765
c qus.c
/*************************************************************************/
/* */
/* Copyright (c) 1993-2001 Accelerated
www.eeworm.com/read/289731/8531730
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/188512/8532341
cpp fig21_17.cpp
// Fig. 21.17: Fig21_17.cpp
// Template Queue class test program.
#include
using std::cout;
using std::endl;
#include "Queue.h" // Queue class definition
int main()
{
Queue<
www.eeworm.com/read/388924/8564249
txt fullbinarytree.h.txt
www.pudn.com > asd.rar > FullBinaryTree.h
#ifndef FULLBINARYTREE
#define FULLBINARTTREE
#include
#include
#include"BinaryTree.h"
template class FullBina
www.eeworm.com/read/289241/8566263
h list.h
// list.h: interface for the list class.
//
//////////////////////////////////////////////////////////////////////
#ifndef HEADFILE_LIST
#define HEADFILE_LIST
class list // 线性表类
{
privat
www.eeworm.com/read/289241/8566277
cpp 08_05.cpp
// 08_05.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include "list.h"
#include
#include
using namespace std;
int main(int argc, c
www.eeworm.com/read/188135/8569442
cpp 11-5.cpp
#include
#include
const MAX =200;
class queue
{
protected:
int qdata[MAX];
int tail,head;
public:
queue(void)
{
tail=head=0;
}
void pushta
www.eeworm.com/read/188135/8569612
cpp 12-7.cpp
#include
#include
#include
template
class queue
{
private:
Type size;
Type start;
Type end;
Type *data;
public:
queue();
queu