代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/163659/10151350
cpp lru.cpp
#include "LRU.h"
//页数
int m_ipages;
//分配空间
Status InitQueue( Queue &Q )
{
Q.base = new ElemType[MAXSIZE + 1];
if( !Q.base )
return ERROR;
Q.front = Q.rear = 0;
return OK;
www.eeworm.com/read/163659/10151356
h lru.h
#include
#include
#include
#include
#define LEASTPAGES 8
#define MAXSIZE 5
#define OK 1
#define ERROR -1
#define FALSE 0
#define TRUE 1
typed
www.eeworm.com/read/358986/10172464
cpp t.cpp
// t.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include
/* 基数排序的算法源程序*/
#define R 10 /* R为基数, 测试数据要求用10个左右的数据项进行测试,因此R=10*/
str
www.eeworm.com/read/163073/10176955
cpp stepvisit.cpp
#include
#include
#include
#include
#define N 50
#define OVERFLOW 0
#define NULL 0
typedef struct BiTNode //定义线性链表
{
char data
www.eeworm.com/read/358682/10182218
cpp nested.cpp
// nested.cpp -- using a queue that has a nested class
#include
#include
#include "queuetp.h"
int main()
{
using std::string;
using std::cin;
using std::cou
www.eeworm.com/read/358191/10194611
h lqueue.h
// header file lqueue.h
// linked queue
#ifndef LinkedQueue_
#define LinkedQueue_
#include "node.h"
#include "xcept.h"
template
class LinkedQueue {
// FIFO objects
public:
www.eeworm.com/read/358191/10194619
cpp lqueue.cpp
// test linked queue class
#include
#include "lqueue.h"
void main(void)
{
LinkedQueue Q;
int x;
try {Q.Add(1).Add(2).Add(3).Add(4);
cout
www.eeworm.com/read/357357/10211879
java queueclass.java
class QueueClass implements QueueInterface
{
private int head;
private int tail;
private Man queue[];
public QueueClass()
{
head=tail=0;
queue= new Man[4];
}
public boolean isEmpty()
{
ret
www.eeworm.com/read/356899/10219400
s avrx_canceltimermessage.s
#include "avrx.inc"
/*
Copyright 1999-2001, Larry Barello
larry@barello.net
*/
;
; AvrX Time Queue Manager
;
_MODULE(avrx_canceltimermessage)
_EXT