代码搜索:recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/278099/10570513
c treedir.c
/* +++Date last modified: 05-Jul-1997 */
/*
** TREEDIR.C - simple recursive directory lister
**
** public domain demo by Bob Stout
*/
#include
#include
#include "sni
www.eeworm.com/read/159596/10637490
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/276620/10722590
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
www.eeworm.com/read/349909/10784677
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/274773/10853236
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/272527/10954031
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/469773/6926722
plg usb1_1.plg
Build target 'usb1_1'
compiling main.c...
compiling int.c...
linking...
*** WARNING L13: RECURSIVE CALL TO SEGMENT
SEGMENT: ?CO?MAIN
CALLER: ?PR?GET_DESCRIPTOR?MAIN
*** WARNING L15: MULTIPLE
www.eeworm.com/read/467642/7006482
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/467642/7006501
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/467642/7006521
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(