代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/455289/7374242
cpp main.cpp
#include
#include
int main(void){
using namespace std;
//创建queue对象
queue q;
//元素入队
q.push(3);
q.push(19);
q.push(29);
q.push(26);
q.push(33);
//元素出队
w
www.eeworm.com/read/454938/7381171
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/453483/7418799
properties i18n_pane.properties
# Queue table features
queue.table.column.filename.title=Filename
queue.table.column.filename.align=left
queue.table.column.filename.width=230
queue.table.column.size.title=Size
queue.table.colu
www.eeworm.com/read/453108/7426697
h seqqueue.h
#include"stdio.h"
#include"stdlib.h"
typedef struct
{
DataTypeQ queue [MaxQueueSize];
int rear;
int front;
int count;
}SeqQueue;
void QueueInitiate( SeqQueue *Q )
{
Q->rear =
www.eeworm.com/read/453104/7426729
h seqqueue.h
#include"stdio.h"
#include"stdlib.h"
typedef struct
{
DataTypeQ queue [MaxQueueSize];
int rear;
int front;
int count;
}SeqQueue;
void QueueInitiate( SeqQueue *Q )
{
Q->rear =
www.eeworm.com/read/452710/7435347
c printq.c
#include
printq(head)
int head;
{
int i, tail;
tail = head + 1;
printf("queue contents:\n\n");
for(i=q[head].qnext; i != tail; i=q[i].qnext)
kprintf("key: %d next: %
www.eeworm.com/read/452710/7435891
h,v tcb.h,v
head 1.3;
access;
symbols;
locks
dls:1.3; strict;
comment @ * @;
1.3
date 97.09.21.19.26.19; author dls; state Dist;
branches;
next 1.2;
1.2
date 94.05.10.20.48.46; author dls; state
www.eeworm.com/read/452453/7440898
java messagelist.java
package com.jdon.jserver.connector.queue;
import java.util.*;
import java.nio.*;
import java.nio.channels.*;
import com.jdon.util.Debug;
/**
* Copyright: Jdon.com Copyright (c) 2003
www.eeworm.com/read/452050/7448764
cc 2699180_ac_593ms_10320k.cc
#include
#include
#define INF 2100000000
#define MAX 100000
using namespace std;
int l, a, b;
struct Node
{
char change[21];
int cost;
}oper[33];
char st[21], ed
www.eeworm.com/read/452050/7448766
cpp 2699077_wa.cpp
#include
#include
#define INF 2100000000
#define MAX 100000
using namespace std;
int l, a, b;
struct Node
{
char change[21];
int cost;
}oper[33];
char st[21], ed