代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/315460/13542164
makefile
# Makefile for cbook/17-Looking-Ahead/programs
# Created by the ExportAll facility
# ***************************************************************
PROGRAMS = \
qtest \
testsort \
fact \
www.eeworm.com/read/314540/13564633
java server.java
import javax.microedition.lcdui.*;
import java.io.*;
import java.io.DataInputStream;
import java.io.DataOutputStream;
import java.io.IOException;
import java.util.Vector;
import
www.eeworm.com/read/312711/13606013
h graphfile.h
#include
#include
#include
#define MAXSIZE 30
//顶点最大数
// #define MAX 100
typedef struct ArcNode{
int adjvex;//该弧所指向的顶点位置
struct ArcNode *nextarc;//指向下一条弧的指针
}A
www.eeworm.com/read/312240/13614626
java sortfb2.java
package dispatcher;
import sun.misc.Queue;
class sortFB2 {
public static int[] sort(int n[][]) throws InterruptedException{
final int N=10;
Queue queue[]=new Queue[N];
for(int i=0;i
www.eeworm.com/read/312240/13614630
java intqueue.java
package dispatcher;
import sun.misc.Queue;
public class IntQueue extends Queue {
public void Enqueue(int i){
enqueue(new Integer(i));
}
public int Dequeue() throws InterruptedException
www.eeworm.com/read/312240/13614633
java sortfb.java
package dispatcher;
import sun.misc.Queue;
class sortFB {
public static int[] sort(int n[][]) throws InterruptedException{
final int N=10;
Queue queue[]=new Queue[N];
for(int i=0;i
www.eeworm.com/read/311844/13624858
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/309649/13666906
h deque.h
/* +++Date last modified: 05-Jul-1997 */
/*
* File : DEQUE.H
*
* Peter Yard 02 Jan 1993.
*/
#ifndef DEQUEUE__H
#define DEQUEUE__H
#include "sniptype.h" /* For
www.eeworm.com/read/308882/13688046
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/307145/13727637
c topsort.c
/* topsort.c
Implementation of a topological sort */
#include "topsort.h"
#include
#define Enqueue(zze) {queue[last]=zze;last++;}
#define Dequeue(zze) {zze=queue[first];first++;}