代码搜索：malloc
找到约 10,000 项符合「malloc」的源代码
代码结果 10,000
www.eeworm.com/read/279355/10444695
c 10gear.c
#include "math.h"
#include "stdlib.h"
#include "4rinv.c"
int gear(a,b,hmin,hmax,h,eps,n,y0,k,t,z,ss,f)
void (*f)(),(*ss)();
int n,k;
double a,b,hmin,hmax,h,eps,y0[],t[],z[];
www.eeworm.com/read/352714/10522533
c strdup.c
/*
* strdup.c
* Modified for use in 15-410 at CMU
* Zachary Anderson(zra)
*/
/*
* Copyright (c) 1994, 1998 University of Utah and the Flux Group.
* All rights reserved.
*
* This file is part
www.eeworm.com/read/351797/10609945
c pr_loqo.c
/*
* File: pr_loqo.c
* Purpose: solves quadratic programming problem for pattern recognition
* for support vectors
*
* Author: Alex J. Smola
* Created: 10/14/97
www.eeworm.com/read/159593/10637760
c jtf.c
#include "funct.c"
void jtf(double x0[],double h0,double s[],int n,double a[],double b[])
{int i;
double *x[3],h,f1,f2,f3;
for(i=0;i
www.eeworm.com/read/159592/10637776
c jtf.c
#include "funct.c"
void jtf(double x0[],double h0,double s[],int n,double a[],double b[])
{int i;
double *x[3],h,f1,f2,f3;
for(i=0;i
www.eeworm.com/read/277434/10639143
c 12cplx.c
#include "stdlib.h"
int cplx(n,m,a,b,alpha,eps,x,xx,k,s,f)
int n,m,k;
void (*s)();
double a[],b[],alpha,eps,x[],xx[],(*f)();
{ double rn(double *);
int r,g,i,j,it,kt,jt,kk;
www.eeworm.com/read/277434/10639433
c 10gear.c
#include "math.h"
#include "stdlib.h"
#include "4rinv.c"
int gear(a,b,hmin,hmax,h,eps,n,y0,k,t,z,ss,f)
void (*f)(),(*ss)();
int n,k;
double a,b,hmin,hmax,h,eps,y0[],t[],z[];
www.eeworm.com/read/159331/10669098
c main.c
/*
* Copyright (c) 1995,2000 TriMedia Technologies Inc.
*
* +------------------------------------------------------------------+
* | This software is furnished under a license and may
www.eeworm.com/read/421949/10675898
c pr_loqo.c
/*
* File: pr_loqo.c
* Purpose: solves quadratic programming problem for pattern recognition
* for support vectors
*
* Author: Alex J. Smola
* Created: 10/14/97
www.eeworm.com/read/277022/10687729
cpp 作业排序.cpp
#include
#include
int FIND(int *parent,int i)
{//查找含有元素i的树根,使用压缩规则去压缩由i到根j的所有结点
int j,k,t;
j=i;
while(parent[j]>0)
j=parent[j];//找根
k=i;
while(k