代码搜索:diff

找到约 8,375 项符合「diff」的源代码

代码结果 8,375
www.eeworm.com/read/226770/14452647

makefile

default: it clean: rm -f alloc.o alloc_re.o buffer.o buffer_0.o buffer_1.o buffer_2.o \ buffer_get.o buffer_put.o buffer_read.o buffer_write.o byte.a \ byte_chr.o byte_copy.o byte_cr.o byte_diff.o
www.eeworm.com/read/217145/14977118

targets

anycast choose compile haveip6.h load preprocess sockaddr_in6.h socket.lib uint32.h anycast.o buffer_2.o buffer_put.o byte_copy.o byte_diff.o byte_zero.o error.o error_str.o ip4_scan.o ip6_scan.o ndel
www.eeworm.com/read/214091/15113277

m xia329.m

function xia329(a,b,j,f3) a1=a; b1=b; f=inline(f3); syms x y=diff(f(x)); f2=inline(y); xx=linspace(a,b,100); s=abs(f2(xx)); s1=zeros(1,100); s2=ones(1,100); if s>s1 & s
www.eeworm.com/read/214091/15113367

m diedai.m

function diedai(a,b,j,f3) a1=a; b1=b; f=inline(f3); syms x y=diff(f(x)); f2=inline(y); xx=linspace(a,b,100); s=abs(f2(xx)); s1=zeros(1,100); s2=ones(1,100); if s>s1 & s
www.eeworm.com/read/214091/15113521

m xia329.m

function xia329(a,b,j,f3) a1=a; b1=b; f=inline(f3); syms x y=diff(f(x)); f2=inline(y); xx=linspace(a,b,100); s=abs(f2(xx)); s1=zeros(1,100); s2=ones(1,100); if s>s1 & s
www.eeworm.com/read/212376/15157163

m exm080714m_1.m

%exm080714m_1.m clc disp('按任意键,开始运行。') disp('(1) 用符号计算求此方程解析解') pause xsym=dsolve('D2x+100*Dx+0.9999*x=0','x(0)=1,Dx(0)=0','t') dxsym=diff(xsym,'t') disp(' ') disp('按任意键,继续运行。') disp('(2) 三
www.eeworm.com/read/229403/4756172

patch i386-gcc-soft-float.patch

diff -urN gcc-3.3.2-orig/gcc/config/i386/i386.h gcc-3.3.2/gcc/config/i386/i386.h --- gcc-3.3.2-orig/gcc/config/i386/i386.h 2003-06-25 16:18:31.000000000 -0500 +++ gcc-3.3.2/gcc/config/i386/i386.h 2003
www.eeworm.com/read/224355/4803583

patch i386-gcc-soft-float.patch

diff -urN gcc-3.3.2-orig/gcc/config/i386/i386.h gcc-3.3.2/gcc/config/i386/i386.h --- gcc-3.3.2-orig/gcc/config/i386/i386.h 2003-06-25 16:18:31.000000000 -0500 +++ gcc-3.3.2/gcc/config/i386/i386.h 2003
www.eeworm.com/read/216502/4892095

seq-hard

1,1,2,1,2,2,3,1,2,2,3,2,3,3,4:1{(1's in binary nos)}:number of 1's in binary numbers 1,1,2,2,4,2,6,4,6,4,10:4{(phi(n))}:Euler's [totient|phi]{ function}|phi(n) 1,2,2,4,2,4,2,4,6,2:6{(diff of primes)}:
www.eeworm.com/read/216499/4892127

seq-hard

1,1,2,1,2,2,3,1,2,2,3,2,3,3,4:1{(1's in binary nos)}:number of 1's in binary numbers 1,1,2,2,4,2,6,4,6,4,10:4{(phi(n))}:Euler's [totient|phi]{ function}|phi(n) 1,2,2,4,2,4,2,4,6,2:6{(diff of primes)}: