代码搜索:malloc

找到约 10,000 项符合「malloc」的源代码

代码结果 10,000
www.eeworm.com/read/279355/10444789

c 10gil.c

#include "stdlib.h" #include "math.h" void gil(t,h,y,n,eps,q,f) void (*f)(); int n; double t,h,eps,y[],q[]; { int i,j,k,m,ii; double x,p,hh,r,s,t0,dt,qq,*d,*u,*v,*g; s
www.eeworm.com/read/279355/10445188

c 4ssgj.c

#include "stdlib.h" #include "math.h" #include "stdio.h" int ssgj(a,n) int n; double a[]; { int i,j,k,m; double w,g,*b; b=malloc(n*sizeof(double)); for (k=0; k
www.eeworm.com/read/279355/10445233

c 9mtml.c

#include "stdlib.h" #include "math.h" #include "3rnd1.c" double mtml(n,a,b,f) int n; double a[],b[],(*f)(); { int m,i; double r,s,d,*x; x=malloc(n*sizeof(double));
www.eeworm.com/read/279355/10445560

c 15topo.c

#include "stdlib.h" void topo(n,r,m,p) int n,m,p[],r[]; { int top,i,j,k,t,*s,*g,*f; struct node { int suc; int next; } *q; q=(struct node *)malloc(m*sizeo
www.eeworm.com/read/279355/10445615

c 13lman.c

#include "stdlib.h" #include "4rinv.c" int lman(n,m,k,f,q,r,h,y,x,p,g) int n,m,k; double f[],q[],r[],h[],y[],x[],p[],g[]; { int i,j,kk,ii,l,jj,js; double *e,*a,*b; e=mallo
www.eeworm.com/read/352747/10518489

cpp algo6-1.cpp

// algo6-1.cpp 求赫夫曼编码。实现算法6.12的程序 #include"c1.h" #include"c6-7.h" #include"func6-1.cpp" void HuffmanCoding(HuffmanTree &HT,HuffmanCode &HC,int *w,int n) // 算法6.12 { // w存放n个字符的权值(均>0),构造赫
www.eeworm.com/read/352714/10522468

h phys_lmm.h

/* * phys_lmm.h * Modified for use in 15-410 at CMU * Zachary Anderson(zra) */ /* * Copyright (c) 1995, 1998, 1999 University of Utah and the Flux Group. * All rights reserved. * * This file
www.eeworm.com/read/352662/10527967

lst main.lst

C51 COMPILER V6.23a MAIN 06/09/2003 12:38:16 PAGE 1 C51 COMPILER V6.23a, COMPILATION OF MODULE MAIN OBJECT MODULE PLACED IN m
www.eeworm.com/read/352662/10527981

c main.c

#include /* special function register declarations */ /* for the intended 8051 derivative */ #include #include
www.eeworm.com/read/423304/10571612

cpp algo6-1.cpp

// algo6-1.cpp 求赫夫曼编码。实现算法6.12的程序 #include"c1.h" #include"c6-7.h" int min(HuffmanTree t,int i) { // 函数void select()调用 int j,flag; unsigned int k=UINT_MAX; // 取k为不小于可能的值 for(j=1;