Search Results for "memory management"

...The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks

DDMTestbed is a testbed that allows you to generate random instances and evaluate your proposed resolutive method measuring execution time, memory occupied and distance from the optimal solution. It has been written in C language.

The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc

CGL(C Generic Library) is a stl-like library written in pure C.It implements iterators, memory management,generic containers such as list,map, generic algorithms such as sort() and search(),and it can manipulate any types of data.

A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.