代码搜索:recursive

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

代码结果 2,177
www.eeworm.com/read/461147/7232663

h binarytree.h

#ifndef BINARYTREE_H_ #define BINARYTREE_H_ #include"BinaryNode.h" #include template class BinaryTree { public: BinaryTree(); bool empty(); void preorder(void(*visit)
www.eeworm.com/read/460384/7252179

f90 e_624_01.f90

PROGRAM CALL_FACTORlAL !调用FACTORIAL函数的主程序 INTERFACE RECURSIVE FUNCTION FACTORIAL(N) RESULT(F_RES) INTEGER :: N,F_RES END FUNCTION FACTORIAL END INTERFACE INTEGER ::N WRITE(*,'(A,$)
www.eeworm.com/read/449504/7503135

m recresid.m

function rresid = recresid(y,x) % PURPOSE: compute recursive residuals %---------------------------------------------- % USAGE: rresid = recresid(y,x) % where: y = dependent variable vector (n x 1) %
www.eeworm.com/read/443644/7629612

c mutex_w32.c

/* ** 2007 August 14 ** ** The author disclaims copyright to this source code. In place of ** a legal notice, here is a blessing: ** ** May you do good and not evil. ** May you find forgiveness
www.eeworm.com/read/437118/7754820

tig test7.tig

/* define valid mutually recursive functions */ let function do_nothing1(a: int, b: string):int= (do_nothing2(a+1);0) function do_nothing2(d: int):string = (do_nothing1(d, "str");" ") in do_no
www.eeworm.com/read/437118/7754842

tig test6.tig

/* define valid mutually recursive procedures */ let function do_nothing1(a: int, b: string)= do_nothing2(a+1) function do_nothing2(d: int) = do_nothing1(d, "str") in do_nothing1(0, "str2") en
www.eeworm.com/read/437118/7754864

tig test18.tig

/* error : definition of recursive functions is interrupted */ let function do_nothing1(a: int, b: string):int= (do_nothing2(a+1);0) var d:=0 function do_nothing2(d: int):string = (do_nothing1(
www.eeworm.com/read/399279/7875626

f90 e_624_01.f90

PROGRAM CALL_FACTORlAL !调用FACTORIAL函数的主程序 INTERFACE RECURSIVE FUNCTION FACTORIAL(N) RESULT(F_RES) INTEGER :: N,F_RES END FUNCTION FACTORIAL END INTERFACE INTEGER ::N WRITE(*,'(A,$)
www.eeworm.com/read/398648/7932231

m iforgot.m

function iforgot(n) %IFORGOT Recursive Function Call Example. % % D.C. Hanselman, University of Maine, Orono, ME, 04469 % 1/25/95 % Copyright (c) 1996 by Prentice-Hall, Inc. if nargin==0,n=20;end if
www.eeworm.com/read/296068/8125107

c mutex.c

/* ** 2007 August 14 ** ** The author disclaims copyright to this source code. In place of ** a legal notice, here is a blessing: ** ** May you do good and not evil. ** May you find forgiveness