代码搜索：zero
找到约 10,000 项符合「zero」的源代码
代码结果 10,000
www.eeworm.com/read/359245/10159641
m dir2latc.m
function [K]=dir2latc(b)
%[K]=dir2latc(b);
%K=格型滤波器的系数矩阵
%b=FIR滤波器的直接形式系数矩阵
M=length(b);
K=zeros(1,M);
b1=b(1);
if b1==0
error('b(1) is equal to zero')
end
K(1)=b1;A=b/b1;
for m=M:-1:2
www.eeworm.com/read/358682/10182023
cpp exceed.cpp
// exceed.cpp -- exceeding some integer limits
#include
#define ZERO 0 // makes ZERO symbol for 0 value
#include // defines INT_MAX as largest int value
int main()
{
www.eeworm.com/read/358469/10188856
asm c2_7_1.asm
.def start
start:
mvk 31,b0
ZERO A2
ZERO A3
MVKL 0FFFEH,A4
MVKLH 0FFFFH,A4
MVKL 2,A0
MVKL
www.eeworm.com/read/358389/10189994
v alusim.v
module simALU;
wire zero;
wire [31:0] result;
reg [2:0] ctl;
reg [31:0] a, b;
alu aaa (ctl, a, b, result, zero);
initial
begin
ctl = 3'b100;
a = 32'd0;
b = 32'd4;
end
endmodule
www.eeworm.com/read/358191/10194497
cpp huffman.cpp
// Huffman tree
#include
#include "minheap.h"
#include "binary.h"
#include "huffman.h"
template
BinaryTree HuffmanTree(T a[], int n)
{// Generate Huffman tree wi
www.eeworm.com/read/161842/10362904
cpp listboxst.cpp
#include "stdafx.h"
#include "ListBoxST.h"
#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif
#define MASK_DWDATA 0x01 // dwItemData is valid
#d
www.eeworm.com/read/161587/10394665
cpp huffman.cpp
// Huffman tree
#include
#include "minheap.h"
#include "binary.h"
#include "huffman.h"
template
BinaryTree HuffmanTree(T a[], int n)
{// Generate Huffman tree wi
www.eeworm.com/read/353043/10476652
cmd 2-7.cmd
post.out
-a
-image
-zero
-memwidth 8
ROMS
{
Flash: org = 0, len = 0x3000,romwidth = 8, files = {post.hex}
}
www.eeworm.com/read/278058/10577315
cpp exceed.cpp
// exceed.cpp -- exceeding some integer limits
#include
#define ZERO 0 // makes ZERO symbol for 0 value
#include // defines INT_MAX as largest int value
int main()
{
www.eeworm.com/read/423159/10582824
c ex2-1.c
#include
int main()
{
static float f[] =
{
-2.0, -1.0, -0.75, -0.5,
0.0, 0.5, 0.75, 1.0, 2.0
} ;
int i, j ;
for (i = 8; i >= 0; i--)
{
void *p = &f[i] ;
lon