代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/121167/14768077
cpp page116.cpp
#include
#define null 0
#include
template class Queue;
template class QueueNode{
friend class Queue;
private:
Type data;
www.eeworm.com/read/121167/14768114
cpp page115.cpp
#include
#include
template class Queue{
public:
Queue(int=10);
~Queue(){ delete []elements;}
void EnQueue(const Type & item);
Type DeQueue
www.eeworm.com/read/120966/14781113
cpp 进程管理.cpp
#include
#include
#include
class queue;
class node{
friend class queue;
private:
int data;
char px;
node *link;
node(int d=0,int p=0,node *l=NULL):da
www.eeworm.com/read/120923/14783466
cpp bankteller.cpp
//: C07:BankTeller.cpp
// From "Thinking in C++, 2nd Edition, Volume 2"
// by Bruce Eckel & Chuck Allison, (c) 2001 MindView, Inc.
// Available at www.BruceEckel.com.
// Using a queue and simulate
www.eeworm.com/read/120429/14803837
java deadlockqueue.java
// Page 198
class DeadlockQueue extends WorkQueue {
protected void processItem(final Object workItem)
throws InterruptedException {
// Create a new thread that returns wo
www.eeworm.com/read/120429/14803838
java workqueue.java
// Page 196
import java.util.*;
public abstract class WorkQueue {
private final List queue = new LinkedList();
private boolean stopped = false;
protected WorkQueue() { new Worke
www.eeworm.com/read/120429/14803839
java displayqueue.java
// Page 198
class DisplayQueue extends WorkQueue {
protected void processItem(Object workItem)
throws InterruptedException {
System.out.println(workItem);
Thread
www.eeworm.com/read/120385/14804230
cpp main7.cpp
// Section 16.7
// $ CC main7.cpp
/*
< 0 3 6 9 >
< 2 4 6 8 10 >
*/
#include "Queue.h"
#include "Queue.cpp"
using std::cout;
#include
using std::vector;
int main()
{
www.eeworm.com/read/119695/14824344
cpp chat.cpp
/* File : chat.cpp */
#include
#include
#include
#include "pthread.h"
#include "Mysocket.h"
#include "MyThread.h"
#include "MySync.h"
#include "TcpServThr.h"
www.eeworm.com/read/118532/14864727
h cqueue.h
templateclass queue
{
public:
virtual void deleteAllValues()=0;
virtual T dequeue()=0;
virtual void enqueue(T value)=0;
virtual T front()=0;
virtual int isEmpty()const=0;
}