代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/327101/13098774
h queue.h
// specification file for an unlimited queue for storing bytes
#ifndef CRYPTOPP_QUEUE_H
#define CRYPTOPP_QUEUE_H
#include "cryptlib.h"
NAMESPACE_BEGIN(CryptoPP)
// The queue is implemente
www.eeworm.com/read/327101/13098913
cpp queue.cpp
// queue.cpp - written and placed in the public domain by Wei Dai
#include "pch.h"
#include "queue.h"
#include "misc.h"
NAMESPACE_BEGIN(CryptoPP)
// this class for use by ByteQueue only
cl
www.eeworm.com/read/140161/13103398
c queue.c
#ifdef DEBUG
#include
#endif
/*-------------------------------------------------------------------
* QUEUE.C: General purpose queue management routines:
*
* Copyright (c)
www.eeworm.com/read/326597/13132100
h queue.h
/* Queue.h */
#include
#include
using namespace std ;
const int nDefaultQueueSize = 50;
template
class Queue {
private:
vector vqueue; //存放队列元素的指针(
www.eeworm.com/read/241438/13144311
h queue.h
#include
template
class Queue
{
public:
Queue(int MaxQueueSize=10);
~Queue(){delete [] queue;}
bool IsEmpty() {return front==rear;}
bool IsFull()
{
if((rear+1
www.eeworm.com/read/241438/13144356
h queue.h
// queue implemented as an array
// 课本上的，用的是first和last
#ifndef ARRAY_QUEUE
#define ARRAY_QUEUE
#include
template
class ArrayQueue {
public:
www.eeworm.com/read/241438/13144365
h queue.h
#include
using namespace std;
template
class Queue
{
public:
Queue(int MaxQueueSize=10);
~Queue(){delete [] queue;}
bool IsEmpty() {return front==rear;}
bool IsFull(
www.eeworm.com/read/240985/13182521
h queue.h
/*------------------------------------------------------------------------*/
/* */
/* QUEUE.H