搜索资源列表
0305111
- 很好的一个DD。。 能够进行快速排序...利用C语言实现，8种排序算法！ 例如：插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序！-good a DD. . To conduct rapid sequencing ... use C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hil
iseemem
- 这是一个用于C或C++程序开发的内存防护系统，它可以有效的侦测到内存泄漏及内存读写异常的发生，并可以精确的指出发生问题的原因及相关的代码。相对与1.0版，2.1版本采用了全新的内核，应用了私有堆、虚拟内存、多线程存储等诸多技术，防护效果有了一个质的提升。YZ 编写，编译器：VC6。-for C or C program memory protection system, which can effectively detect memory leaks and memory reader unu
valgrind-3.2.1.tar
- The Valgrind distribution has multiple tools. The most popular is the memory checking tool (called Memcheck) which can detect many common memory errors such as: * touching memory you shouldn t (eg. overrunning heap block boundaries) *
HeapSort22
- 算法中的堆排序算法的实现-algorithm Heap Sort algorithm.
mpool-2.1.0
- 内存池实现 BACKGROUND: This is a memory pool library which was written to allow a program to have heaps that it could destroy without fragmenting memory. You can have multiple heaps and reset them easily completely reclaiming the memory (a
Rhapsody-0.1.8.tar
- sourceforge历史版本完整下载: http://sourceforge.net/project/showfiles.php?group_id=202044 提供了基于b树索引算法的文件数据数据库模块详见storage/目录下面的 btree.c与pager.c container目录为常用的容器实现，如果rbtree avltree map heap list vector hashtable deque T树 B树, test目录为测试程序代码经过初步测试，比较稳定。 os_api:装
php3018exp_c
- php3.0.18 s heap overflow,get a nobody shell.
ms04028
- ms04028漏洞利用程序，利用GDIPLUS.DLL的堆溢出漏洞-ms04028 exploits procedures, the use of GDIPLUS.DLL heap overflow vulnerability
ccs
- 弗洛伊德算法，堆排序的时间，主要由建立初始堆和反复重建堆这两部分的时间开销构成，它们均是通过调用Heapify实现的。 -Floyd algorithm, HEAPSORT time, mainly by the establishment of the initial stack and heap repeatedly reconstruction spending time in these two parts of composition, they are by calling H
heap
- 将一段内存块当做Heap处理，内含全部源代码，也可以让你了解heap管理的细节，特别适合多个进程之间批量传递数据。-Heap will be handled as a block of memory that contains all the source code, you can also let you know the details of heap management, particularly suitable for bulk transfer of data between m
heap
- 這是一個用C語言所寫的minHeap程式 具有create,findmin,deletemin,Insert這些函式-It is written in a language with a C program with minHeap create, findmin, deletemin, Insert these functions
safe-heap
- safer heap-allocate strategy
safe-heap
- safer heap-allocate strategy
heap
- STL中关于heap用法STL里面的堆操作一般用到的只有4个。他们就是make_heap() 、pop_heap() 、push_heap() 、sort_heap() 他们的头函数是algorithm -About STL heap Usage STL inside the reactor operation is generally used only four. Them is make_heap the () pop_heap () push_heap () sort_heap
test-heap-profiler
- Constructor Heap Profile Test Helper Source Code for Linux.
test-heap
- Check Heap Map Source Code for Linux.
heap
- Grows the capacity of a binary heap so that it can handle a larger number of \e cfs_binheap_node_t objects.
Heap memory
- Работа с heap by zltigo Структура heap: {first_heap_mcb| memory part} {heap_mcb| memory part}...{heap_mcb| memory part} heap_mcb - описатель элемента памяти (Memory Comtrol Block) memory part - элемент памяти, который описывается соответствующим MCB
heap memory C++
- Работа с heap by zltigo
heap.cpp
- 这里需要做一个假设：对于数组中下标为i的节点其左子树和右子树都是保持最大堆性质的堆。在假设成立的前提上，经过这一个维护函数维护过的堆才能够保证是一个最大堆。(There is a hypothesis that the left subtree and the right subtree of the node with the subscr ipt of I in the array are the heaps that maintain the maximum heap properties