代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/154277/5638627
java persistqueue.java
package com.gctech.sms.sp.cms.core2;
import com.gctech.sms.sp.cms.msg2.*;
import EDU.oswego.cs.dl.util.concurrent.LinkedQueue;
public class PersistQueue
{
LinkedQueue queue = null;
String
www.eeworm.com/read/154277/5638642
java persistqueue.java
package com.gctech.sms.sp.cms.core;
import com.gctech.sms.sp.cms.msg.*;
import EDU.oswego.cs.dl.util.concurrent.LinkedQueue;
public class PersistQueue
{
LinkedQueue queue = null;
String fi
www.eeworm.com/read/475959/6771424
cpp 10_14.cpp
#include
#include
using namespace std;
int main()
{ queue< double > q; //创建空的队列容器
q.push( 3.2 ); q.push( 9.8 ); q.push( 5.4 ); //向空的队列容器添加元素
cout
www.eeworm.com/read/124034/6785577
ģ
// 模拟View.cpp : implementation of the CMyView class
//
#include "stdafx.h"
#include "模拟.h"
#include "模拟Doc.h"
#include "模拟View.h"
#include
#include
#ifdef _DEBUG
#de
www.eeworm.com/read/233441/6787960
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/475100/6803562
tcl ns-default.tcl
# -*- Mode:tcl; tcl-indent-level:8; tab-width:8; indent-tabs-mode:t -*-
# Modified and extended by Sandeep Kumar, Kopparapu Suman and Richa
# Jain, Indian Institute of Technology, Bombay.
# June, 200
www.eeworm.com/read/473450/6842784
java singlemyqueue.java
class SingleMyQueue
{
private SingleLocation[] queue;
private int maxSize=100;
private int front;
private int rear;
public SingleMyQueue()
{
queue=new SingleLocation[maxSize];
fo
www.eeworm.com/read/473450/6842795
java myqueue.java
class MyQueue
{
private Location[] queue;
private int maxSize=100;
private int front;
private int rear;
public MyQueue()
{
queue=new Location[maxSize];
for(int i=0;i
www.eeworm.com/read/473450/6842937
java serverrandomqueue.java
class ServerRandomQueue
{
static int size;
static ColorSet[] queue;
static int head;
static int rear;
static boolean flag=false;
static int[] front;//The queue head pointers for variou