代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/368625/9682875
cpp 10_5.cpp
#include
#include
using namespace std;
template
void popElements(T &s);
void main()
{
queueintDequeQueue;
for(int i=0;i
www.eeworm.com/read/368277/9702841
change_log
Kernel_AODV Change Log
Changes for:
V 2.2.2
=====================
- Corrected LINK_LIMIT #ifdefs (Fix from Peter Barron)
- aodv_neigh.c
- hello.c
- module.c
- Add Packet Queuing back in
www.eeworm.com/read/172493/9705270
cpp fifolifo.cpp
#include
#include
#include
#include
using namespace std;
int main()
{
cout
www.eeworm.com/read/367524/9743765
cpp queuetest.cpp
#include
#include
#include
#include
using namespace std;
typedef struct {
int index;
char data[256];
} MYNODE, *PMYNODE;
int main()
{
www.eeworm.com/read/366926/9792630
java simpleobjectfifo.java
public class SimpleObjectFIFO extends Object {
private Object[] queue;
private int capacity;
private int size;
private int head;
private int tail;
public SimpleObjectFIFO(int cap) {
c
www.eeworm.com/read/415900/11048904
cpp student.cpp
#include"tree.h"
#include"node.h"
#include"member.h"
#include
typedef void (*Function)(void* node); //声明函数指针
const int MAX_QUEUE_SIZE = 100; //声明不变常量用于队列的长度
/*
www.eeworm.com/read/415674/11058937
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/415628/11060504
java requestqueue.java
import java.util.LinkedList;
public class RequestQueue {
private static final long TIMEOUT = 30000;
private final LinkedList queue = new LinkedList();
public synchronized Request get
www.eeworm.com/read/415628/11060531
java requestqueue.java
import java.util.LinkedList;
public class RequestQueue {
private final LinkedList queue = new LinkedList();
public synchronized Request getRequest() {
while (queue.size()
www.eeworm.com/read/415628/11060736
java requestqueue.java
import java.util.LinkedList;
public class RequestQueue {
private final LinkedList queue = new LinkedList();
public synchronized Request getRequest() {
while (queue.size()