代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/223154/14652436
m rc2ar.m
function [MX,res,arg3,acf] = rc2ar(rc);
% converts reflection coefficients into autoregressive parameters
% uses the Durbin-Levinson recursion for multiple channels
% function [AR,RC,PE,ACF] = rc2
www.eeworm.com/read/233448/4683335
c acc1.c
/* { dg-options "-O2 -ffast-math" } */
/* Fast maths allows tail recursion to be turned into iteration. */
double
foo (int n, double f)
{
if (n == 0)
return f;
else
return f + foo (n -
www.eeworm.com/read/229812/4737122
c inline04.c
#include "fail.h"
#include
#pragma inline_recursion(on)
#pragma inline_depth(4)
int /*inline*/ fact( int i )
{
if( i == 0 ) {
return 1;
}
return fact(i-1)*i;
www.eeworm.com/read/366702/2879840
c acc1.c
/* { dg-options "-O2 -ffast-math" } */
/* Fast maths allows tail recursion to be turned into iteration. */
double
foo (int n, double f)
{
if (n == 0)
return f;
else
return f + foo (n -
www.eeworm.com/read/107346/15608714
cpp code.cpp
/* pxdscript code.c
*
* history:
* 4/3 - Created with an empty recursion through tree
*/
#include "stdafx.h"
#include "code.h"
#include "memory.h"
#include "tree.h"
#include "error.h"
www.eeworm.com/read/100710/15866555
pl check_dir.pl
#!/usr/bin/perl
# Just a simple script - doesn't do recursion
use IO::Socket;
use strict;
$|=1;
my $response;
my $req;
my $sockname = $ARGV[0] || usage();
my $dir = $ARGV[1] || usage();
my $file;
www.eeworm.com/read/385015/8824336
bas modmxquery.bas
Attribute VB_Name = "modMXQuery"
Option Explicit
' winsock
Private Const DNS_RECURSION As Byte = 1
Private Const AF_INET = 2
Private Const SOCKET_ERROR = -1
Private Const ERROR_BUFFER_OVERFL