代码搜索:STARTING
找到约 9,113 项符合「STARTING」的源代码
代码结果 9,113
www.eeworm.com/read/160301/5575776
h mode.h
// Copyright (c) 1994 James Clark
// See the file COPYING for copying permission.
#ifndef Mode_INCLUDED
#define Mode_INCLUDED 1
#ifdef SP_NAMESPACE
namespace SP_NAMESPACE {
#endif
enum Mode {
grp
www.eeworm.com/read/159715/5581857
scn base_sp.scn
*** SAMPLE SINGLE PROCESSOR APPLICATION ***
Creating and starting an application task
Application task was invoked with argument (0) and has id of 0x10002
*** END OF SAMPLE SINGLE PROCESSOR APPLICATIO
www.eeworm.com/read/473274/6850374
asm dsp28xxx_sectioncopy_bios.asm
;############################################################################
;
; FILE: DSP28xxx_SectionCopy_BIOS.asm
;
; DESCRIPTION: Provides functionality for copying intialized sections fro
www.eeworm.com/read/295657/8147888
m c1ex15.m
% Example 1-15
%
t = -10:.005:10;
x = stp_fn(t - 2); % Generate step starting at t = 2
y = impls_fn(t + 3, 0.05); % Generate unit impulse at t = -3
z = 2*rmp_fn(4 - t); % Generate backwards
www.eeworm.com/read/395537/8168739
m trid.m
% Broyden tridiagonal function
% ----------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% function [fvec,J]=trid(n,m,x,option)
% Dimensions -> n=variable, m=n
% Problem no. 30
% Stand
www.eeworm.com/read/395537/8168866
m trid.m
% Broyden tridiagonal function
% ----------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% function [fvec,J]=trid(n,m,x,option)
% Dimensions -> n=variable, m=n
% Problem no. 30
% Stand
www.eeworm.com/read/395532/8169150
m trid.m
% Broyden tridiagonal function
% ----------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% function [fvec,J]=trid(n,m,x,option)
% Dimensions -> n=variable, m=n
% Problem no. 30
% Stand
www.eeworm.com/read/392996/8316168
std test.2.std
Shortest Remaining Time Next (SRTN) scheduling
Starting at Ticks: total 10
Queuing threads.
Queuing thread threadA at Time 10, priority 0
threadA, Starting Burst of 29 Ticks: total 30
threadA, Still 2
www.eeworm.com/read/392996/8316192
1
Shortest Job First (SJF) scheduling
Starting at Ticks: total 10
Queuing threads.
Queuing thread threadA at Time 10, priority 0
Queuing thread threadB at Time 20, priority 0
Queuing thread threadC at T
www.eeworm.com/read/392996/8316199
std test.0.std
First-Come First-Served (FCFS) scheduling
Starting at Ticks: total 10
Queuing threads.
Queuing thread threadA at Time 10, priority 0
Queuing thread threadB at Time 20, priority 0
Queuing thread thread