Location:
Search - malloc
Search list
Description: 单链表的插入和删除实验目的：
1、定义单链表的结点类型
2、通过单链表的定义掌握线性表的链式存储结构的特点；
3、熟悉单链表的建立以及插入、删除等基本操作。
-# include <stdio.h>
# include<malloc.h>
# define ND sizeof(struct List)
struct List
{int data
struct List*next
}
void main()
{ int n,i=1,e,a
struct List*head
struct List*p,*q
q=head=p=(struct List*)malloc(ND)
Platform: |
Size: 1024 |
Author: 鹃 |
Hits:
Description: c/c++内存管理源代码，可以检测出内存泄露，并可以定位到泄露行-XMEM Extended C/C++ Dynamic Memory Control and Debug Library: The extended C/C++ Dynamic Memory Control and Debug Library XMEM is a replacement library for malloc/free and new/delete to find memory leaks and other memory related errors in C/C++ code.
Platform: |
Size: 1764352 |
Author: 杨天 |
Hits:
Description: 数据机构中的双向链表，可用来实现并集，并且是用c++编制-for(i=1 i<=link1.GetLengthofLink() i++)
{
int e=link1.GetElement(i)
if(link2.LinkLocate(e)==0)
{
newnode=(struct node*)malloc(sizeof(struct node))
newnode->data=e
newnode->next=NULL
newnode->front=NULL
link2.LinkInsert(1,newnode)
}
}
Platform: |
Size: 1024 |
Author: 姚依梦 |
Hits:
Description: 小型内存分配模块,用通用循环双向链表实现，改程序模拟系统malloc-Small memory allocation module, two-way linked list with the realization of general circulation, to process simulation system malloc
Platform: |
Size: 3072 |
Author: 毛泽东 |
Hits:
Description: 分析的是实例
#include<stdio.h>
#include<stdlib.h>
typedef struct BST* tree_pointer //定义数据类型
typedef struct BST{
int key
tree_pointer left
tree_pointer right
}BST
tree_pointer CreateBST(tree_pointer root, int data){ // 创建一个根
root = (tree_pointer)malloc(sizeof(BST))
root->key = data
root->left = NULL -Structure in the data analysis of the role of tree
Platform: |
Size: 72704 |
Author: 林明 |
Hits:
Description: 对内存的分配、释放和使用进行检查，以发现不合法指针，减少程序BUG，这部分程序已经在linux操作系统下验证通过。-Memory allocation, release and use of inspections to detect illegal pointer, reducing the procedure BUG, this part of the linux operating system procedures have been adopted under the verification.
Platform: |
Size: 31744 |
Author: 张权 |
Hits:
Description: XMEM Extended C/C++ Dynamic Memory Control and Debug Library: The extended C/C++ Dynamic Memory Control and Debug Library XMEM is a replacement library for malloc/free and new/delete to find memory leaks and other memory related errors in C/C++ code.
Platform: |
Size: 1184768 |
Author: tranph |
Hits:
Description: Uses malloc() to determine the amount of free memory on the system
Don´ t run this program in Windows with virtual memory enabled, as windows just increases virtual memory
Platform: |
Size: 1024 |
Author: qwerty123 |
Hits:
Description: 本文描述在网上能够找到的最简单，最快速的哈夫曼编码。本方法不使用任何扩展动态库，比如STL或者组件。只使用简单的C函数，比如：memset，memmove，qsort，malloc，realloc和memcpy。
大家都会发现，理解甚至修改这个编码都很容易-This article describes the Internet to find the simplest, fastest Huffman. This method does not use any extension of the dynamic libraries, such as STL or components. Only using a simple C function, such as: memset, memmove, qsort, malloc, realloc and memcpy. We will find, understand and even modify the code easily
Platform: |
Size: 145408 |
Author: 李虚东 |
Hits:
Description: 用char *malloc(unsigned size)函数向系统申请一次内存空间（如size=1000，单位为字节），
用首次适应法
addr = (char *)fmalloc(unsigned size) 和
ffree(unsigned size,char * addr)
或用循环首次适应法
addr = (char *)lmalloc(unsigned size) 和
lfree(unsigned size,char * addr)
模拟UNIX可变分区内存管理，实现对该内存区的分配和释放管理。
-With char* malloc (unsigned size) to apply a function to the system memory space (for example, size = 1000, measured in bytes), with the first law to adapt to addr = (char*) fmalloc (unsigned size) and ffree (unsigned size, char* addr) or the first cycle to adapt to law addr = (char*) lmalloc (unsigned size) and lfree (unsigned size, char* addr) variable partition simulation UNIX memory management, the realization of the memory allocation and release management .
Platform: |
Size: 4096 |
Author: 一零 |
Hits:
Description: 用C语言实现malloc,free函数，方法采用严蔚敏数据结构书上的方法-C implementation using malloc, free
Platform: |
Size: 2048 |
Author: okwangrong |
Hits:
Description: cuda 并行代码 Malloc And Memcpy例子-cuda examples of parallel code Malloc And Memcpy
Platform: |
Size: 2048 |
Author: dmal |
Hits:
Description: 内存池管理器，功能与malloc , new等类似，经过测试速度快了约15倍-Memory pool manager, function similar with malloc, new, tested about 15 times faster
Platform: |
Size: 1548288 |
Author: felix.xia |
Hits:
Description: 一元多项式相加减 #include<stdio.h>
#include<malloc.h>
typedef struct polynode /*用单链表存储多项式的结点结构*/
{
int coef
int exp
struct polynode *next
}node-Unary polynomial-phase addition and subtraction# include <stdio.h># include <malloc.h> typedef struct polynode/* single linked list node structure stored polynomial*/(int coef int exp struct polynode* next ) node
Platform: |
Size: 1024 |
Author: 张朗 |
Hits:
Description: 本文描述在网上能够找到的最简单，最快速的哈夫曼编码。本方法不使用任何扩展动态库，比如STL或者组件。只使用简单的C函数，比如：memset，memmove，qsort，malloc，realloc和memcpy。
-This article describes the Internet can find the simplest, most fast Huffman coding. This method does not use any extension dynamic libraries, such as STL or component. Using only a simple C function, for example: memset, memmove, qsort, malloc, realloc, and memcpy.
Platform: |
Size: 13312 |
Author: mxb |
Hits:
Description: 对malloc申请的内存单元进行是否泄漏的检测，比较实用-The application of the malloc memory unit is leak detection, more practical
Platform: |
Size: 307200 |
Author: 王光飞 |
Hits:
Description: C语言中malloc（） alloc（） 用法,此函数不经常用-use c malloc alloc ，this is not usually used
Platform: |
Size: 2048 |
Author: 小胖 |
Hits:
Description: 用Dijkstra法求最短路径，有向图与无向图均可-void ShortestPath_DIJ( Node a ,Status i ,Status v0 ,Status*D ,Status*pre )
{
int v,w,j,l=1
Status*final
Status min
final=(Status*)malloc( sizeof(Status)*i )
for(v=0 v<i v++)
{
final[v]=FALSE
pre[v]=FALSE
D[v]=a[v0][v]
if(D[v]<10000)
pre[v]=v0
}
Platform: |
Size: 1024 |
Author: 腾龙 |
Hits:
Description: 1. Program to remove all comments from a C program
2. Word count implementation using Apache s Hadoop
3. Program to implement calloc using malloc
Platform: |
Size: 2048 |
Author: l13xl |
Hits:
Description: malloc function for image in C
Platform: |
Size: 2048 |
Author: iyer |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
20
»