代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/468102/6999751
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/466944/7024187
html datastructures.binomialqueue.html
Class DataStructures.BinomialQueue
www.eeworm.com/read/466324/7033216
java exercise17_5.java
public class Exercise17_5 {
public static void main(String[] args) {
MyQueue queue = new MyQueue();
queue.add("Tom");
queue.add("George");
queue.add("Peter");
}
}
// MyQueue.java:
www.eeworm.com/read/466430/7034906
ndsl_makefile
# Copyright (c) 1994, 1995, 1996
# The Regents of the University of California. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are per
www.eeworm.com/read/464569/7065047
java priorityqueue.java
/**
*
* Class to implement priority queue with pointers
*
* written by : R. G. Garside
*
* first written : 10/July/96
* last rewritten : 11/July/96
*
*/
import java.io.* ;
import java.lancs
www.eeworm.com/read/197608/7069734
makefile
# Makefile for cbook/17-Looking-Ahead/programs
# Created by the ExportAll facility
# ***************************************************************
PROGRAMS = \
qtest \
testsort \
fact \
www.eeworm.com/read/450169/7082992
cpp dingpiao.cpp
#include
#include
#include
#include
#include
#define MAX 50
typedef struct LNode
{
char name[10];
int number;
struct LNode *next;
}LNode;
www.eeworm.com/read/154303/7106936
txt ex8_14.txt
Example 8.14 POJO Service Activator: OrderServiceActivator.java
// imports. . .
public class OrderServiceActivator implements javax.jms.MessageListener{
// Queue session and receiver: see JM
www.eeworm.com/read/332978/7142092
java priorityblockingqueuedemo.java
//: concurrency/PriorityBlockingQueueDemo.java
import java.util.concurrent.*;
import java.util.*;
import static net.mindview.util.Print.*;
class PrioritizedTask implements
Runnable, Comparable
www.eeworm.com/read/463983/7171166
cpp 广度优先.cpp
int visited[MAXVEX];
int queue[MAXVEX];
void bfs(adjlist adj,int vi)
{
int front=0,rear=1,v,i;
struct edgenode *p;
for(i=0,i