代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/323605/13334214
h linkradixsorter.h
//基于静态链的基数排序
//静态队列类
class StaticQueue{
public:
int head;
int tail;
};
//基于静态链的基数排序类
template
class LinkRadixSorter{
private:
void Distribute(Record* Array,int
www.eeworm.com/read/137249/13337067
c qus.c
/*************************************************************************/
/* */
/* Copyright (c) 1993-1998 Accelerated
www.eeworm.com/read/137249/13337105
xrf an.xrf
hdr=Global Cross Reference Report - Wed Jun 21 09:09:56 2000
DATA C060 start,*dtpd
START 2408 *start,init
STKTOP 15490 init,start,*dtpd
_Application_Initialize
www.eeworm.com/read/323253/13346511
java lru.java
import javax.swing.*;
import java.io.*;
import java.util.*;
import java.awt.*;
import java.awt.event.*;
public class Lru extends JFrame implements ActionListener{
JFrame frame1,frame2
www.eeworm.com/read/323191/13347640
c last.c
#include "stdio.h"
#include "conio.h"
#include "stdlib.h"
#include "Conio.h"
#include "graphics.h"
#define closegr closegraph
#define NULL 0
#define memorysize 300
#define skinds 3
typedef en
www.eeworm.com/read/136959/13351051
h deque.h
/*
* File : DEQUE.H
*
* Peter Yard 02 Jan 1993.
*/
#ifndef DEQUEUE__H
#define DEQUEUE__H
#include "sniptype.h" /* For True_, False_ */
typedef struct nodeptr datanode
www.eeworm.com/read/136879/13356037
cpp fig20_24.cpp
// Fig. 20.24: fig20_24.cpp
// Testing Standard Library adapter class template queue
#include
#include
using namespace std;
int main()
{
queue< double > values;
www.eeworm.com/read/136879/13356593
cpp fig15_12.cpp
// Fig. 15.12: fig15_12.cpp
// Driver to test the template Queue class
#include
#include "queue.h"
int main()
{
Queue< int > intQueue;
int dequeueInteger;
cout
www.eeworm.com/read/136685/13366456
m comein.m
function q=comein(p,varargin)
% @QUEUE\COMEIN a variable comes to the end of a queue.
% 调用格式
% comein(p,a,b,...) 使输入宗量a,b等排在p之后形成新队列，
% 其名沿用p位置上的输入队列名.
% q=comein(p,a,b,...) 使输入宗量a,
www.eeworm.com/read/136685/13366640
m stack.m
function ST=stack(v)
% 调用格式
% ST=stack 创建一个"空"堆栈对象.
% ST=stack(v) 创建包含变量v的堆栈对象。
if nargin>1;error('Too many arguments.');end;
if nargin==0 % 没有输入宗量情况
Q=queue;
s.value=[];