代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/337054/12399994
txt 迷宫java.txt
//001-100 01-10 10 in java language
import java.util.LinkedList;
class Point
{
public int x;
public int y;
public Point(int x,int y)
{
this.x=x;
this.y=y;
}
}
public class Doork
www.eeworm.com/read/148785/12426116
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/250122/12430035
m exm08943_2.m
%exm08943_2.m
clc,echo on
AA=' 继承性 '; %“生成字符串”指令
ST=stack(AA) %“堆栈对象的创建”指令
class(ST) %“类别检查”指令
isa(ST,'stack') %“检查是否堆栈”指令
isa(ST,'queue') %“检查是否队列”指令
%由于设计中采用了继承性，所以"是堆栈，
www.eeworm.com/read/250122/12430604
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/250122/12430745
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=[];
www.eeworm.com/read/250122/12431023
m exm0892_2.m
%exm0892_2.m
clear,clc,echo on
%（1）创建一个队列对象，并显示。
qe='Hello! 你好 ！'; %“生成字符串”指令
Q=queue(qe) %“生成队列对象Q，并显示”指令
pause,%按任意键，继续。
%（2）类别检查和是否对象判断
class(Q) %“类别检查”指令
isobject
www.eeworm.com/read/132141/14107806
h lqueue.h
// header file lqueue.h
// linked queue
#ifndef LinkedQueue_
#define LinkedQueue_
#include "node.h"
#include "xcept.h"
template
class LinkedQueue {
// FIFO objects
public:
www.eeworm.com/read/132141/14107821
cpp lqueue.cpp
// test linked queue class
#include
#include "lqueue.h"
void main(void)
{
LinkedQueue Q;
int x;
try {Q.Add(1).Add(2).Add(3).Add(4);
cout
www.eeworm.com/read/234146/14120801
c bintree.c
/* Demo of simple binary tree operations.
*
* Written by Cyril Hu (cyrilhu@gmail.com), public domain.
*/
#include
typedef struct bitree {
char data;
struct bitree *lchild, *rchild;
} BT;
v
www.eeworm.com/read/233811/14134636
c pqueue.c
/*
* Copyright 1997, Regents of the University of Minnesota
*
* pqueue.c
*
* This file contains functions for manipulating the bucket list
* representation of the gains associated with each vert