代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/203036/15367378
mac tsk.mac
;
; --- Version 2.2 93-06-08 10:16 ---
;
; CTask - Definitions for assembler routines
;
; Public Domain Software written by
; Thomas Wagner
; Ferrari electronic Gmbh
; Beusselstrasse 27
;
www.eeworm.com/read/202268/15387393
cpp devqueue.cpp
// DevQueue.cpp -- Custom IRP queuing support
// Copyright (C) 1999 by Walter Oney
// All rights reserved
#include "stddcls.h"
#include "driver.h"
typedef struct _NOTIFY_CONTEXT {
P
www.eeworm.com/read/112473/15484676
h queueasarray.h
//Header file QueueAsArray
#ifndef H_QueueAsArray
#define H_QueueAsArray
#include
#include
using namespace std;
template
class queueType
{
public:
www.eeworm.com/read/112473/15484688
h queueasarray.h
//Header file QueueAsArray
#ifndef H_QueueAsArray
#define H_QueueAsArray
#include
#include
using namespace std;
template
class queueType
{
public:
www.eeworm.com/read/111443/15512593
cpp graph.cpp
#include
#include
//头函数定义
const int max_vexnum=100; //最大结点数
int vexnum,arcnum; //结点数和边数
int matrix[ma
www.eeworm.com/read/110420/15534457
c bootpdip.c
#include
#include
#include "global.h"
#include "arp.h"
#include "iface.h"
#include "mbuf.h"
#include "netuser.h"
#include "pktdrvr.h"
#include "timer.h"
#include "boot
www.eeworm.com/read/109743/15550972
h circlequeue.h
#ifndef _CIRCLEQUEUE_
#define _CIRCLEQUEUE_
#include
struct Node_Queue
{
Node_Queue(char* p,Node_Queue* nxt,Node_Queue* pr)
{
if(p)
{
ptr = new char[strlen(p)+1];
strcpy(ptr,p);
www.eeworm.com/read/109695/15552170
h inlines.h
/*
* Netbufs don't come with nifty queuing functions
* like mbufs. We therefore make our own quques by
* squirreling away an extra pointer before the data
* in a netbuf. As we can't guarantee that
www.eeworm.com/read/106262/15642268
c grtsb.c
void topsort(Graph& G) { // Topological sort: Queue
Queue Q(G.n());
// int Count[G.n()];
int *Count;
Count = new int [G.n()];
for (int v=0; v