代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/437118/7754841
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/437118/7754850
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/144074/12819399
h treescan.h
#ifndef TREE_SCANS
#define TREE_SCANS
#include "treenode.h"
#include "queue.h"
#include "stack.h"
#ifndef NULL
const int NULL = 0;
#endif // NULL
// preorder recursive scan of the n
www.eeworm.com/read/143587/12859024
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/143587/12859033
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/143587/12859049
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/143587/12859076
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/143587/12859103
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/142282/12953011
m koch.m
%KOCH: Plots 'Koch Curve' Fractal
%
% koch(n) plots the 'Koch Curve' Fractal after n iterations
% e.g koch(4) plots the Koch Curve after 4 iterations.
% (be patient for n>8, depending on Computer
www.eeworm.com/read/328104/13046381
txt test1.txt
function recursive (a:integer):integer;
begin
if a>600 then
begin
write("a=",a)
end
else
begin
a := recursive(a*2)
end;
recursive := a
end;
begin
write("in main ",recursive(