代码搜索:recursive

找到约 2,177 项符合「recursive」的源代码

代码结果 2,177
www.eeworm.com/read/467642/7006477

tig test39.tig

/* This is illegal, since there are two functions with the same name in the same (consecutive) batch of mutually recursive functions. See also test48 */ let function g(a:int):int = a function
www.eeworm.com/read/467642/7006481

tig test48.tig

/* This is legal. The second function "g" simply hides the first one. Because of the intervening variable declaration, the two "g" functions are not in the same batch of mutually recursive fun
www.eeworm.com/read/467642/7006488

tig test4.tig

/* define a recursive function */ let /* calculate n! */ function nfactor(n: int): int = if n = 0 then 1 else n * nfactor(n-1) in nfactor(10) end
www.eeworm.com/read/467642/7006500

tig test47.tig

/* This is legal. The second type "a" simply hides the first one. Because of the intervening variable declaration, the two "a" types are not in the same batch of mutually recursive types. S
www.eeworm.com/read/467642/7006509

tig test38.tig

/* This is illegal, since there are two types with the same name in the same (consecutive) batch of mutually recursive types. See also test47 */ let type a = int type a = string in 0 end
www.eeworm.com/read/427515/7095576

m recserp.m

function y=recserp(x,z) % RECSERP % RECSERP(x,z) constructs a recursive time series based on product % x: N*K z: N*K % y(1)=x(1)+z(1) % y(t)=y(t-1)*x(t)+z(t) for t=2,..N y=[]; y(1,:)=x(1,:)
www.eeworm.com/read/427515/7095577

m recserar.m

function y=recserar(x,y0,a) % RECSERAR % RECSERAR(x,y0,a) constructs a recursive time series % x: N*K y0: P*K a: P*K y: N*K % y(t)=x(t)+a(1)y(t-1)+...a(p)y(t-p) for t=p+1,..N % y(t)=y0(t) f
www.eeworm.com/read/437118/7754814

tig test39.tig

/* This is illegal, since there are two functions with the same name in the same (consecutive) batch of mutually recursive functions. See also test48 */ let function g(a:int):int = a function
www.eeworm.com/read/437118/7754818

tig test48.tig

/* This is legal. The second function "g" simply hides the first one. Because of the intervening variable declaration, the two "g" functions are not in the same batch of mutually recursive fun
www.eeworm.com/read/437118/7754828

tig test4.tig

/* define a recursive function */ let /* calculate n! */ function nfactor(n: int): int = if n = 0 then 1 else n * nfactor(n-1) in nfactor(10) end