代码搜索：initial
找到约 10,000 项符合「initial」的源代码
代码结果 10,000
www.eeworm.com/read/233704/14142844
bak register_initialize.v.bak
module register_initialize;
parameter size=1024,bytesize=8;
reg[bytesize-1:0] memory[size-1:0];
initial
begin:jjkk
integer index;
for(index=0;index
www.eeworm.com/read/233704/14142849
v register_initialize.v
module register_initialize;
reg areg;
parameter size=1024,bytesize=8;
reg[bytesize-1:0] memory[size-1:0];
initial
begin:jjkk
integer index;
for(index=0;index
www.eeworm.com/read/233704/14142860
v string.v
module string_test;
reg[8*14:1] stringvar;
initial
begin
stringvar="Hello world";
$display("%s is stored as %h",stringvar,stringvar);
stringvar={stringvar,"!!!"};
$display("%s is sto
www.eeworm.com/read/131415/14147241
c txc_os_mem_mgmt.c
/*--------------------------------------------------------------------------
******* ****
* ***** ** * * * * * * ***** **** * *
www.eeworm.com/read/233369/14156885
txt readme.txt
//-------------------------------------------------------------------
//
// Major Functions: TOP File FUZZY CONTROL
//
// --------------------------------------------------------------------
//
www.eeworm.com/read/232744/14183610
news
Overview of Changes from scim-tomoe-0.5.0 to scim-tomoe-0.6.0
=============================================================
* Adaptation to tomoe-gtk-0.6.0.
Overview of Changes from scim-tomoe-0.4.0
www.eeworm.com/read/130423/14194818
v convlen_test.v
/*****************************************************/
/* module convlen_test */
/*****************************************************/
//
//
/* This is the top-leve
www.eeworm.com/read/130423/14194856
v tcounter.v
module test_counter;
reg clk, rst;
wire [7:0] count;
counter #(5,10) dut (count,clk,rst);
initial // Clock generator
begin
clk = 0;
#10 forever #10 clk = !clk;
end
initi
www.eeworm.com/read/129974/14215640
m checkancestors1.m
function zerotree = checkancestors1(j,R,zerotree)
% zerotree=1 means coefficient is descended from zerotree root
% initial set zerotree=0
global N;
i = floor((j+3)/4 );
whi
www.eeworm.com/read/129915/14217727
m hmm_forward_backward.m
function [a, b] = HMM_Forward_Backward(a, b, V)
% Find the probability transition matrices a,b from sample data using the forward-backward algorithm
%
% Inputs:
% a - Initial estimate of the