代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/365515/9860037
t queue.t
#!./perl -w
# ID: %I%, %G%
use strict ;
use lib 't' ;
use BerkeleyDB;
use Test::More;
use util(1) ;
plan(skip_all => "Queue needs Berkeley DB 3.3.x or better\n" )
if $BerkeleyDB::db_versio
www.eeworm.com/read/365329/9869413
d queue.d
// new(Queue, minimal-dimension)
% ListClass Queue: List {
%}
www.eeworm.com/read/365329/9869430
dc queue.dc
% Queue add {
return addLast(_self, element);
}
% Queue take {
return takeFirst(_self);
}
%init
www.eeworm.com/read/364985/9884516
m queue.m
function q=queue(v)
%@QUEUE\QUEUE queue class constructor function
% 调用格式
% q=queue 创建一个"空"队列对象.
% q=queue(v) 创建包含变量v的队列对象。
superiorto('double','sparse','struct','cell','char','inline'
www.eeworm.com/read/168992/9886295
h queue.h
// Queue.h: interface for the CQueue class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(AFX_QUEUE_H__CE3D3265_BB0F_43F3_9DC1_F873751D025C__INCLUDED_)
#
www.eeworm.com/read/168992/9886343
cpp queue.cpp
// Queue.cpp: implementation of the CQueue class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "BFSearch.h"
#include "Queue.h"
#ifde
www.eeworm.com/read/364817/9892112
h queue.h
#ifndef __QUE_H__
#define __QUE_H__
#define maxsize 10
void InitQueue(struct sqqueue *p); /*初始化队列*/
bit EnQueue(struct sqqueue *q, double e1,uchar e2;); /*入队*/
void History DeQueue(struct sq
www.eeworm.com/read/364817/9892153
c queue.c
#include "queue.h"
extern xdata double dCounter;;
extern uchar MeasureType;
void InitQueue(struct sqqueue *p) /*初始化队列*/
{
p->front=0;
p->rear=0;
}
bit EnQueue(struct sqqueue *q, double e
www.eeworm.com/read/364817/9892156
lst queue.lst
C51 COMPILER V7.50 QUEUE 09/17/2008 12:03:00 PAGE 1
C51 COMPILER V7.50, COMPILATION OF MODULE QUEUE
OBJECT MODULE PLACED IN q
www.eeworm.com/read/364791/9895173
h queue.h
/*
* Copyright (c) 2002 The Board of Trustees of the University of Illinois and
* William Marsh Rice University
* Copyright (c) 2002 The University of Utah
* Copyright (c) 2002