代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/366065/9834443
test notify.test
# -*- tcl -*-
#
# notify.test --
#
# This file tests several functions in the file, 'generic/tclNotify.c'.
#
# This file contains a collection of tests for one or more of the Tcl
# built-in commands.
www.eeworm.com/read/365797/9846480
c qjoblib.c
/* qJobLib.c - fifo queue with singly-linked lists with intLocks */
/* Copyright 1990-2001 Wind River Systems, Inc. */
#include "copyright_wrs.h"
/*
modification history
--------------------
01w,19o
www.eeworm.com/read/365329/9869432
c queues.c
#include "Queue.h"
int main (int argc, char ** argv)
{ void * q;
unsigned n;
initQueue();
q = new(Queue, 1);
while (* ++ argv)
switch (** argv) {
case '+':
add(q, *argv + 1);
break;
www.eeworm.com/read/365329/9869435
depend
Object.o : Object.h Object.r
Point.o : Point.h Object.h Point.r Object.r
Circle.o : Circle.h Point.h Object.h Circle.r Point.r Object.r
List.o : List.h Object.h List.r Object.r
Queue.o : Queue.h L
www.eeworm.com/read/169168/9876671
cpp main.cpp
#include
#include "rv.h"
#include "event.h"
#include "queuemmmk.h"
// Simulates an M/M/m/K queueing system. The simulation terminates
// once 100000 customers depart from the system.
int
www.eeworm.com/read/169144/9879653
c 51单片机的fifo(先入先出)循环队列实现.c
//////////////////////////////////////////////////////////
// 文件：config.h
//////////////////////////////////////////////////////////
#ifndef __CONFIG_H
#define __CONFIG_H
//这一段无需改动
//This segme
www.eeworm.com/read/169058/9883639
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/364985/9884203
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/364985/9884514
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/364985/9884586
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=[];