代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/144445/12789387
cpp 层次非递归遍历.cpp
//层次的非递归算法
#include
#include
#include"建立树.h"
#define MAX 20
void LevleOrder(BiTree T)/*层次遍历二叉树T，从第一层开始，每层从左到右*/
{
BiTree Queue[MAX],b; /*用一维数组表示队列，front和rear分别表示队首和队尾指针*/
www.eeworm.com/read/245201/12810622
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/144089/12818231
txt q.txt
Q 【 缩 】 Quality 质 量
Q 【 缩 】 Querying 询问
Q 【 缩 】 Queue 队 列
Q 【 缩 】 Queuing 排 队
www.eeworm.com/read/143896/12831366
cpp jcbview.cpp
// JCBView.cpp : implementation of the CJCBView class
//
#include "stdafx.h"
#include "JCB.h"
#include "JCBDoc.h"
#include "JCBView.h"
#include "JCBDlg.h"
#ifdef _DEBUG
#define new DEB
www.eeworm.com/read/330875/12862718
java requestqueue.java
package guardedsuspension.sample;
import java.util.LinkedList;
public class RequestQueue {
private final LinkedList queue = new LinkedList();
public synchronized Request getRequest()
www.eeworm.com/read/244387/12869454
makefile
# Makefile for cbook/17-Looking-Ahead/programs
# Created by the ExportAll facility
# ***************************************************************
PROGRAMS = \
qtest \
testsort \
fact \
www.eeworm.com/read/330644/12877459
txt 2.txt
#define NULL 0
#include
#include
#include
#include
//定义一个pcb的结构体
FILE *GroupFile[10];
typedef struct index{
www.eeworm.com/read/243648/12930032
m inqueue.m
function [Q,pos]=InQueue(p,Q,Qlen)
i=1;
while iQlen
fprintf('Not Postion Available In The
www.eeworm.com/read/243648/12930039
m inqueue2.m
function [Q,pos]=InQueue2(p,value,Q,Qlen)
disp('=========in InQueue2================');
i=1;
while i