代码搜索:zero

找到约 10,000 项符合「zero」的源代码

代码结果 10,000
www.eeworm.com/read/475959/6771519

cpp 3_34.cpp

#include #include using namespace std; struct complex { double real; double imag; }; int fun(unsigned n, int &zero) //完成统计功能的函数,引用作形参,传回统计结果 { int count=0,ma
www.eeworm.com/read/474556/6811914

cs clavier.cs

namespace WoWBot { using Microsoft.VisualBasic.CompilerServices; using System; using System.Threading; using System.Windows.Forms; public class Clavier { publ
www.eeworm.com/read/473927/6822400

txt 448.txt

Rule: -- Sid: 448 -- Summary: This event is generated when an ICMP "Source Quench" message is generated that has a non-zero ICMP code. -- Impact: Informational. This may indicate that the ICMP
www.eeworm.com/read/473179/6857494

txt 凸包(graham).txt

// CONVEX HULL I // modified by rr 不能去掉点集中重合的点 #include #define eps 1e-8 #define zero(x) (((x)>0?(x):-(x))
www.eeworm.com/read/473191/6857902

txt 凸包(graham).txt

// CONVEX HULL I // modified by rr 不能去掉点集中重合的点 #include #define eps 1e-8 #define zero(x) (((x)>0?(x):-(x))
www.eeworm.com/read/472457/6868621

tdf chengfa.tdf

CONSTANT ZERO=B"0"; CONSTANT ONE=B"1"; SUBDESIGN chengfa (A[4..1],Z[4..1],ABLE:INPUT; ADDOUT[8..1]:OUTPUT;) VARIABLE C[8..1],D[8..1],E[8..1],F[8..1]:NODE; CA[8..1],DA[8..1],EA[8..1],FA[8..1]:N
www.eeworm.com/read/195100/8173886

cs shellexecute.cs

using System; using System.Runtime.InteropServices; using Addot.Internals; namespace Addot.Win32 { public class ShellExecute { private struct SHELLEXECUTEEX {
www.eeworm.com/read/295122/8186247

cpp zplat.cpp

// Zplat.cpp: implementation of the CZplat class. // ////////////////////////////////////////////////////////////////////// #include "stdafx.h" #include "Zplat.h" #ifdef _DEBUG #undef THIS_F
www.eeworm.com/read/193561/8217570

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/294317/8242104

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