代码搜索:malloc

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

代码结果 10,000
www.eeworm.com/read/199684/7836175

c kalmanfiler.c

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

cpp huffman2.cpp

#include #include #include #include #include #define swap(x,y,t) ((t)=(x),(x)=(y),(y)=(t)) #define N 26 char string[N]={'a','b','c','d','e','f','g'
www.eeworm.com/read/199468/7849561

h arraymalloc.h

////ArrayMalloc.h//多维数组的动态开辟和删除。 #include //////C//// //1D float* MallocFloat1( int n) {float * p; p=(float*)malloc(n*sizeof(float)); return p; } void FreeFloat1(float *p)
www.eeworm.com/read/299403/7861334

c 6grad.c

#include "4trmul.c" #include "math.h" #include "stdlib.h" #include "stdio.h" void grad(a,n,b,eps,x) int n; double a[],b[],x[],eps; { int i,k; double *p,*r,*s,*q,alpha,bet
www.eeworm.com/read/299227/7874119

h graph4.h

//图类结构体定义与相关操作graph4.h typedef struct {char *data; int *visited; float **edge; int max,size; }Graph; //初始化图 void SetGraph(Graph *G,int n) {int i,j; G->data=new char[n]; G->visited=new
www.eeworm.com/read/399145/7886296

cpp test.cpp

#include #include #include "Queue.h" void main() { LinkQueue pQ,pQ1,pQ2; char d[]={'a','m','g','d','e','f','h'}; pQ=(LinkQueue)malloc(sizeof(LinkQueue)); QueueInitia
www.eeworm.com/read/298940/7922175

cpp dijkstra.cpp

// Dijkstra.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include "Dijkstra.h" #include "NodeArray.h" #ifdef _DEBUG #define new DEBUG_NEW #undef THIS_FI
www.eeworm.com/read/433448/7929065

cpp huffmancoding.cpp

#include "StdAfx.h" void HuffmanCoding(HuffmanTree &HT,HuffmanCode&HC,int *w,int n) { int m,i,c,s1,s2,start,f; char * cd; HuffmanTree p; if(n
www.eeworm.com/read/298649/7947022

c memory.c

/*----------------------------------------------------------------------------*/ /* memory.c - memory management routines for sga code */ /*----------------------------------
www.eeworm.com/read/197853/7965581

txt jz.txt

double * MatrixOpp(double A[],int m,int n) /*矩阵求逆*/ { int i,j,x,y,k; double *SP=NULL,*AB=NULL,*B=NULL,X,*C; SP=(double *)malloc(m*n*sizeof(double)); AB=(double *)mall