代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/338984/12268635
java queue.java
package association.fptree;
/**
* 树广度遍历的辅助队列,尾进头出；
* */
class Queue{
Elem head,tail,elem;
//void in(FPTree.Node node){
void in(T node){
elem=new Elem(node);
if ((head==null)&&(t
www.eeworm.com/read/338797/12282089
h queue.h
// specification file for an unlimited queue for storing bytes
#ifndef CRYPTOPP_QUEUE_H
#define CRYPTOPP_QUEUE_H
#include "simple.h"
//#include
NAMESPACE_BEGIN(CryptoPP)
/**
www.eeworm.com/read/338797/12282324
cpp queue.cpp
// queue.cpp - written and placed in the public domain by Wei Dai
#include "pch.h"
#ifndef CRYPTOPP_IMPORTS
#include "queue.h"
#include "filters.h"
NAMESPACE_BEGIN(CryptoPP)
static con
www.eeworm.com/read/150427/12293906
h queue.h
/****************************************************************************
*
* Copyright (c) 2000, 2001
* Software Research Lab.
* Institute of Computing Tech.
* Chinese Acad
www.eeworm.com/read/150427/12293925
cpp queue.cpp
// Queue.cpp: implementation of the CQueue class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "Queue.h"
#include "malloc.h"
#include "s
www.eeworm.com/read/338565/12294005
h queue.h
/*=========================================================================
Copyright 2007- Jiaxun feihong, Inc.
程序名称: queue.h
作 者: lijinbin
工程名称:
创建日前: 2007-11-15
模块描述: 一种简洁的FIFO实现方法
www.eeworm.com/read/252063/12304871
h queue.h
/* 队列
*
*/
#ifndef QUEUE_CLASS
#define QUEUE_CLASS
#include "dclinkedlist.h"
template
class Queue
{
private:
// 私有数据成员，队列数组
DCLinkedList queuelist;
public:
// 构造函数
www.eeworm.com/read/338036/12327180
c queue.c
#include
#define Max 100
void SetNull(front, rear)
int *front, *rear;
{
*front = 0;
*rear = 0;
}
int Empty(front,rear)
int *front, *rear;
{
if(*front == *rear)
return(1)
www.eeworm.com/read/251644/12328822
hpp queue.hpp
/* The following code example is taken from the book
* "The C++ Standard Library - A Tutorial and Reference"
* by Nicolai M. Josuttis, Addison-Wesley, 1999
*
* (C) Copyright Nicolai M. Josuttis 19