代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/362558/9992233
h common.h
#include
#include
#include
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
www.eeworm.com/read/166579/10015058
cpp kalman_c.cpp
/*****************************************
****** 卡尔曼滤波器算法实现 *********
****** c语言实现 ***********
******
******
******实现函数：int klman(n,m,k,f,q,r,h,y,x,p,g)
******
*****
www.eeworm.com/read/166450/10019934
c grad.c
#include "math.h"
#include "stdlib.h"
#include "stdio.h"
void grad(n,a,b,eps,x)
int n;
double a[],b[],x[],eps;
{ int i,j,k;
double *p,*r,*s,*q,alpha,beta,d,e;
p=malloc(
www.eeworm.com/read/166450/10019979
c netn.c
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
int netn(n,eps,t,h,x,k,f)
int n,k;
double eps,t,h,x[];
void (*f)();
{ extern int rgauss();
int i,j,l;
doubl
www.eeworm.com/read/166450/10019996
c rkt2.c
#include "stdlib.h"
#include "math.h"
void rkt2(t,h,y,n,eps,f)
void (*f)();
int n;
double t,h,eps,y[];
{ int m,i,j,k;
double hh,p,dt,x,tt,q,a[4],*g,*b,*c,*d,*e;
g=mall
www.eeworm.com/read/166450/10019997
c hamg.c
#include "stdlib.h"
#include "math.h"
void hamg(t,h,n,y,eps,k,z,f)
void (*f)();
int n,k;
double t,h,eps,y[],z[];
{ void rkt5();
int i,j,m;
double a,q,*b,*d,*u,*v,*w,*g
www.eeworm.com/read/166450/10020004
c elr2.c
#include "stdlib.h"
#include "math.h"
void elr2(t,h,y,n,eps,f)
void (*f)();
int n;
double t,h,eps,y[];
{ int i,j,m;
double hh,p,x,q,*a,*b,*c,*d;
a=malloc(n*sizeof(doub
www.eeworm.com/read/166450/10020010
c rkt1.c
#include "stdlib.h"
void rkt1(t,y,n,h,k,z,f)
void (*f)();
int n,k;
double t,h,y[],z[];
{ int i,j,l;
double a[4],tt,*b,*d;
b=malloc(n*sizeof(double));
d=malloc(n*size
www.eeworm.com/read/361726/10038612
txt 2_4.txt
merge(int a[],int b[],int c[])
/*让数组的第一个元素存放数组中元素的个数*/
{
int i=1,j=1,k=1;
c[0]=0;
while(i
www.eeworm.com/read/166053/10039099
c algo6-1.c
/* algo6-1.c 求赫夫曼编码。实现算法6.12的程序 */
#include"c1.h"
#include"c6-7.h"
int min1(HuffmanTree t,int i)
{ /* 函数void select()调用 */
int j,flag;
unsigned int k=UINT_MAX; /* 取k为不小于可能的值 */