代码搜索：float
找到约 10,000 项符合「float」的源代码
代码结果 10,000
www.eeworm.com/read/285822/8815624
c mperpsd.c
#include
#include
#include
#include "msp.h"
void mperpsd(complex x[],int n,int nshift,int nsamp,int iwidow,float ts)
{
/*-------------------------------------------
www.eeworm.com/read/285822/8815629
c mlattic.c
#include
#include
#include
#include "msp.h"
void mlattic(float b[],float a[],int l,float k[],
float c[],int itype,int *ierror)
{
/*--------------------------------
www.eeworm.com/read/285822/8815639
c morderb.c
#include
#include
#include
#include "msp.h"
void morderb(float *f1,float *f2,float *f3,float *f4,float fs,
float alpha1,float alpha2,int *l,int iband,int itype,int *
www.eeworm.com/read/285822/8815652
c mbutwcf.c
#include
#include
#include
#include "msp.h"
void mbutwcf(int l,int k,int ln,float d[],float c[],int *ierror)
{
/*---------------------------------------------------
www.eeworm.com/read/285822/8815658
c mdecint.c
#include
#include
#include
#include "msp.h"
void mdecint(float x[],float h[],float y[],int nh,int ny,int m,
int l,int *k)
{
/*-------------------------------------
www.eeworm.com/read/285822/8815680
c mcorpsd.c
#include
#include
#include
#include "msp.h"
void mcorpsd(complex x[],complex r[],int n,int lag,int iwindow,float t)
{
/*--------------------------------------------
www.eeworm.com/read/285822/8815683
c mconvo1.c
#include
#include
#include
#include "msp.h"
void mconvo1(float x[],float h[],float y[],int n,int m,int l)
{
/*------------------------------------------------------
www.eeworm.com/read/285822/8815695
c mbiline.c
#include
#include
#include
#include "msp.h"
void mbiline(float d[],float c[],int ln,
float b[],float a[],int *ierror)
{
/*-------------------------
www.eeworm.com/read/285822/8815744
c munwrap.c
#include
#include
#include
#include "msp.h"
void munwrap(float phase[],int n)
{
/*----------------------------------------------------------------------
Routine
www.eeworm.com/read/285689/8822650
c legendp1.c
float p(int n, float x)
{/*求勒让德多项式值的递归算法*/
float p1,p2;
if (n==0) return(1.0);
else if (n==1) return(x);
else {
p1=(2*n-1)*x*p(n-1,x);
p2