代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/482399/6624224
cpp 着色问题6422color.cpp
#include
#include
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
class OutOfBounds{};
class Node
{
friend class Graph;
friend class Queue;
pr
www.eeworm.com/read/482399/6624273
cpp railq.cpp
#include
template
class Node{
public:
T data;
Node *next;
};
template
class Queue{
public:
Queue() {front=rear=0;}
~Queue();
bool Empty() const
www.eeworm.com/read/481966/6633587
cpp 2080.cpp
/* This Code is Submitted by wywcgs for Problem 2080 on 2005-11-12 at 12:15:56 */
#include
#include
const int MAX = 10240;
const int INFINITE = 10000000;
class Queue {
www.eeworm.com/read/481966/6633967
cpp 1083.cpp
/* This Code is Submitted by wywcgs for Problem 1083 on 2006-01-09 at 13:37:48 */
#include
#include
#include
using namespace std;
const int MAX = 128;
bool space[MAX
www.eeworm.com/read/481966/6634201
cpp 2136.cpp
/* This Code is Submitted by wywcgs for Problem 2136 on 2006-04-08 at 20:33:48 */
#include
#include
#include
using namespace std;
const int RM = 32;
const int CM
www.eeworm.com/read/481225/6645066
cc synch-sleep.cc
// synch.cc
// Routines for synchronizing threads. Three kinds of
// synchronization routines are defined here: semaphores, locks
// and condition variables (the implementation of the last two
/
www.eeworm.com/read/479792/6679010
h j1939cfg.h
#ifndef __j1939cfg_h
#define __j1939cfg_h
/*
j1939cfg.h
This file will configure the J1939 library for a specific application.
Refer to the J1939 C Library User Guide for more information on
www.eeworm.com/read/349895/6684221
c 30.c
#include "stdio.h"
#define STACKSIZE 2
struct Car
{
char Label;
float InTime;
};
struct StackCar
{
struct Car *Top;
struct Car *BottomStack;
int Size;
};
int StackInitial(str
www.eeworm.com/read/477670/6730464
java queueimp.java
import java.io.*;
import java.util.Scanner;
class node
{
public static int member;
public int data;
public node link;
public node()
{
member++;
}
}
class queue
{
www.eeworm.com/read/477670/6730465
java queuearray.java
import java.io.*;
import java.util.Scanner;
class queue
{
int a[],front,back,n;
public queue(int size)
{
n=size;
a=new int [n];
front=-1;
back=-1;
}
pub