代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/151556/12201400
m rctrap.m
function T=rctrap(f,a,b,n)
%Input - f is the integrand input as a string 'f'
% - a and b are upper and lower limits of integration
% - n is the number of times for recursion
%Output - T
www.eeworm.com/read/128030/14318427
cpp factor2.cpp
//factor2.cpp
//calculates factorials using recursion
#include
using namespace std;
unsigned long factfunc(unsigned long); //declaration
int main()
{
int n;
www.eeworm.com/read/16793/690852
fact
# Who said shells can't use recursion? Here is a factorial function.
# You call it with a number as an argument, and it returns the factorial
# of that number.
fact ()
{
local num=$1;
if [ "
www.eeworm.com/read/247849/4474168
x-djgpp
# translate the version string, so it can be used on DJGPP, where only
# one dot in filename is allowed
# to avoid recursion when redefining $(version)
_version:=$(version)
__version=$(subst ., ,$(_v
www.eeworm.com/read/204713/5030148
java except.java
package jvm;
public class Except extends TestCase {
public String getName() {
return "Except";
}
public boolean test() {
boolean ok = true;
ok = ok && recursion();
return ok;
}
www.eeworm.com/read/186388/5233791
x-djgpp
# translate the version string, so it can be used on DJGPP, where only
# one dot in filename is allowed
# to avoid recursion when redefining $(version)
_version:=$(version)
__version=$(subst ., ,$(_v
www.eeworm.com/read/338546/3315261
g java.g
/** A Java 1.5 grammar for ANTLR v3 derived from the spec
*
* This is a very close representation of the spec; the changes
* are comestic (remove left recursion) and also fixes (the spec
* isn'
www.eeworm.com/read/432926/1886280
pde tree.pde
/**
* Recursive Tree
* by Daniel Shiffman.
*
* Renders a simple tree-like structure via recursion.
* The branching angle is calculated as a function of
* the horizontal mouse location. Move
www.eeworm.com/read/362876/2926419
config
# This file contains a description of the codelets that compose fftw.
# NOTW is a list of the sizes that FFTW contains hard-coded transforms for
# (the "base cases" of the FFT recursion):
NOTW="1 2
www.eeworm.com/read/362876/2926454
config
# This file contains a description of the codelets that compose fftw.
# NOTW is a list of the sizes that FFTW contains hard-coded transforms for
# (the "base cases" of the FFT recursion):
NOTW="1 2