代码搜索：queue

找到约 10,000 项符合「queue」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/107468/15606706

c framereadfragmented.c

/* framereadfragmented.c - framereadfragmented */ #include #include #include #include #include #include #include #include
·
www.eeworm.com/read/107043/15614373

cpp 单链表.cpp

#include class Time{ public: Time() { h = m = 0; } Time(int hr, int min) { if (hr>=0 && hr=0 && min
·
www.eeworm.com/read/106262/15642193

cpp aqmain.cpp

// aqmain.cpp #include #include #include #include #include "..\include\book.h" typedef int ELEM; #include "..\include\aqueue.h" main() {
·
www.eeworm.com/read/104737/15683978

java deadlockqueue.java

// Page 198 class DeadlockQueue extends WorkQueue { protected void processItem(final Object workItem) throws InterruptedException { // Create a new thread that returns wo
·
www.eeworm.com/read/104737/15683979

java workqueue.java

// Page 196 import java.util.*; public abstract class WorkQueue { private final List queue = new LinkedList(); private boolean stopped = false; protected WorkQueue() { new Worke
·
www.eeworm.com/read/104737/15683980

java displayqueue.java

// Page 198 class DisplayQueue extends WorkQueue { protected void processItem(Object workItem) throws InterruptedException { System.out.println(workItem); Thread
·
www.eeworm.com/read/103957/15715822

c barber_ok.c

#include #include #include #include #include #include #define DEFAULT_N (15+3) /*没有参数时，缺省为15个顾客和3个理发师*/ /*宏定义wait和sig
·
www.eeworm.com/read/103618/15727564

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/103618/15727760

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/103618/15727798

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=[];
·