代码搜索：until
找到约 4,232 项符合「until」的源代码
代码结果 4,232
www.eeworm.com/read/227351/14430569
dsp c4_2_3.dsp
.MODULE/RAM/ABS=H#0000 DIFF;
{y(i)=a1×y(i-1)+…＋an×y(i-n)＋b0×x(i)+ b1×x(i-1)+…＋bn×x(i-n);}
.CONST n=2;
.CONST m=1024;
www.eeworm.com/read/124057/14598883
lib example.lib
;
; Example.lib - for use with BAS051
; copyright (c) 1989 W. Washington
;
;
basint: ; initialization code
;
; place any additional initization code here
;
mov scon, #h'52 ; initialize
www.eeworm.com/read/217300/14969808
c p12-21.c
#include
#include
#include
int discard_until_mark (int socket)
{
while (1) {
char buffer[1024];
int result, success, n = 0;
/* 查看到达带外数据标
www.eeworm.com/read/212909/15145367
summary djdplj_top.map.summary
Analysis & Synthesis Status : Failed - Sun May 20 17:10:17 2007
Quartus II Version : 7.0 Build 33 02/05/2007 SJ Full Version
Revision Name : djdplj_top
Top-level Entity Name : djdplj_top
Family :
www.eeworm.com/read/212909/15145388
rpt djdplj_top.flow.rpt
Flow report for djdplj_top
Sun May 20 17:10:17 2007
Quartus II Version 7.0 Build 33 02/05/2007 SJ Full Version
---------------------
; Table of Contents ;
---------------------
1. Legal No
www.eeworm.com/read/158872/5592153
exp condbreak.exp
# Copyright 1997, 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License a
www.eeworm.com/read/393841/8260180
vhd sdr_sdram_tb.vhd
--/******************************************************************************
--*
--* LOGIC CORE: SDR SDRAM Controller test bench
--* MODULE NAME: sdr_sdram_tb()
--*
www.eeworm.com/read/292794/8333544
dsp c4_2_3.dsp
.MODULE/RAM/ABS=H#0000 DIFF;
{y(i)=a1×y(i-1)+…＋an×y(i-n)＋b0×x(i)+ b1×x(i-1)+…＋bn×x(i-n);}
.CONST n=2;
.CONST m=1024;
www.eeworm.com/read/292794/8333848
dsp c4_2_3.dsp
.MODULE/RAM/ABS=H#0000 DIFF;
{y(i)=a1×y(i-1)+…＋an×y(i-n)＋b0×x(i)+ b1×x(i-1)+…＋bn×x(i-n);}
.CONST n=2;
.CONST m=1024;
www.eeworm.com/read/174111/9606910
dsp c4_2_3.dsp
.MODULE/RAM/ABS=H#0000 DIFF;
{y(i)=a1×y(i-1)+…＋an×y(i-n)＋b0×x(i)+ b1×x(i-1)+…＋bn×x(i-n);}
.CONST n=2;
.CONST m=1024;