搜索资源列表
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) *
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:装
A-dynamic-memory-manage-module
- This the program related to heap memory managing functions, free() and malloc().-This is the program related to heap memory managing functions, free() and malloc().
heap
- linux下， c语言，数据结构， 用堆实现内存分配管理 malloc()功能。-linux下，c语言编程 用framebuffer 实现俄罗斯方块。
safe-heap
- safer heap-allocate strategy
safe-heap
- safer heap-allocate strategy
rmm
- This memory manager provides general heap management and arbitrary alignment for any number of memory segments.
cmemory
- ICU Heap allocation. All ICU heap allocation, both for C and C++ new of ICU class types, comes through these functions.-ICU Heap allocation. All ICU heap allocation, both for C and C++ new of ICU class types, comes through these functions.
d_surf
- rasterization driver surface heap manager.
DdmHeap
- DDM-related heap functions.
Heap
- Garbage-collecting memory allocator.
Color
- Collector Heap Iterator for Linux.
ttsbit0
- TrueType and OpenType embedded bitmap support (body). This is a heap-optimized version. -TrueType and OpenType embedded bitmap support (body). This is a heap-optimized version.
ZipArchive
- Read-only access to Zip archives, with minimal heap allocation.
test-heap-profiler
- Constructor Heap Profile Test Helper Source Code for Linux.
scopeinfo
- Add stack locals and collect heap locals for linux API Driver.
test-heap
- Check Heap Map Source Code for Linux.
qatomic_sparc
- Heap and handle info printer 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.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