代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/136959/13350966
c bitcnt_4.c
/*
** BITCNT_4.C - Recursive bit counting functions using table lookup
**
** public domain by Bob Stout
*/
#include "bitops.h" /* from Snippets */
static char bits[256] =
{
0, 1, 1, 2, 1,
www.eeworm.com/read/147682/5728162
m asptrlslattice.m
% [ff,bb,fb,be,cf,b,y,e,kf,kb,c]=asptrlslattice(ff,bb,fb,be,cf,b,a,x,d)
%
% Performs filtering and coefficient update using the
% Recursive Least Squares Lattice Joint Process Estimator
%
www.eeworm.com/read/101082/6249708
c makedir.c
/* makedir.c - make a directory */
#if defined (BSD42) || defined (hpux)
/* Modified to try recursive create. Really, this should be broken
* out into a subr so that SYS5 systems can do this too.
www.eeworm.com/read/101082/6250225
c makedir.c
/* makedir.c - make a directory */
#if defined (BSD42) || defined (hpux)
/* Modified to try recursive create. Really, this should be broken
* out into a subr so that SYS5 systems can do this too.
www.eeworm.com/read/100206/6273265
h chkudf.h
/*
* chkudf.h configuration parameters
* NUM_PARTS - Maximum number of partition maps
* MAX_DEPTH - Maximum depth for recursive directory listing
* MAX_SECTOR_SIZE - bytes per sector
* NUM_CACHE
www.eeworm.com/read/493843/6391515
m rls.m
function [W,E] = rls(x,d,nord,lambda)
%RLS Recursive Least Squares.
%---
%USAGE [W,E] = rls(x,d,nord,lambda)
%
% x : input data to the adaptive filter.
% d : desired o
www.eeworm.com/read/479166/6700236
cpp fig06_29.cpp
// Fig. 6.29: fig06_29.cpp
// Testing the recursive fibonacci function.
#include
using std::cout;
using std::cin;
using std::endl;
unsigned long fibonacci( unsigned long ); // funct
www.eeworm.com/read/477110/6747850
m rne_mdh.m
%RNE_MDH Compute inverse dynamics via recursive Newton-Euler formulation
%
% TAU = RNE(ROBOT, Q, QD, QDD)
% TAU = RNE(ROBOT, [Q QD QDD])
%
% Returns the joint torque required to achieve the specified
www.eeworm.com/read/157455/11702382
cpp rsumct.cpp
// step count for recursive sum of n numbers
#include
int count = 0;
template
T Rsum(T a[], int n)
{// Return sum of numbers a[0:n - 1].
count++; // for if condition
www.eeworm.com/read/157453/11702870
cpp rsumct.cpp
// step count for recursive sum of n numbers
#include
int count = 0;
template
T Rsum(T a[], int n)
{// Return sum of numbers a[0:n - 1].
count++; // for if condition