代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/153735/12009690
c sl_udp.c
/*****************************************************************************
@(#) sl_udp.c,v 0.7 2000/11/25 07:18:52 brian Exp
-------------------------------------------------------------------
www.eeworm.com/read/340916/12123349
cpp soln10_2.cpp
// Soln 10_2.cpp
// The contents of a priority_queue container are automatically in ascending
// sequence if you create the container so it uses the greater predicate
// to order the contents.
www.eeworm.com/read/254615/12127505
mak tstmodem.mak
# ********************** START OF TSTMODEM.MAK **********************
#
#
#CC = bcc -w -I..\common -I..\common16
CC = cl /W4 /AL /I..\common /I..\common16
FILES = pc8250.obj pcirq.obj queue.o
www.eeworm.com/read/254608/12127675
mak chapt05.mak
# ********************** START OF CHAPT05.MAK **********************
#
# This is the make file for the Chapter 5 test program.
# Just remove the leading comments from the CC and LINK lines
# for
www.eeworm.com/read/254606/12127699
mak chapt03.mak
# ********************** START OF CHAPT03.MAK **********************
#
# This is the make file for the Chapter 3 test program.
# Just remove the leading comment line from your compiler, then
# exe
www.eeworm.com/read/150894/12252001
txt jinc.txt
#include"stdafx.h"
#include "iostream.h"
//define pcb
typedef struct pcb
{
char name[10]; //进程名
char state; //状态w(就绪)r(运行)f(结束)
int id; //id号
int super; //优先级
int ntime;
www.eeworm.com/read/339051/12265529
c bootpdip.c
/*
* Center for Information Technology Integration
* The University of Michigan
* Ann Arbor
*
* Dedicated to the public domain.
* Send questions to info@citi.u
www.eeworm.com/read/150122/12310928
cpp patterndlg.cpp
// patternDlg.cpp : implementation file
//
#include "stdafx.h"
#include "pattern.h"
#include "patternDlg.h"
#include "Afxwin.h"
#include "Afxdlgs.h"
#include "winuser.h"
#include "Store.h"
www.eeworm.com/read/251851/12315206
m flow_reach.m
function [reachable,time_limit] = flow_reach(X0,l0,cell)
% Perform conservative reachability analysis using `flow pipe
% approximations` from the given initial location and continuous set.
%
% S
www.eeworm.com/read/337980/12331477
java simulate.java
public class Simulate{
public static void main(String[] args){
double lambda_a = 19.0;
double lambda_s = 20.0;
double t_end = 7.0;
Sim1(lambda_a, lambda_s, t_end);
}