treedb can implement malloc functionality, and much more!
Need a heap that allocates of a fixed size chunk of memory? No problem.
But where treedb comes into its own is when it comes to allocating from a
mmap()ed disk file - the memory becomes persistent.
If you follow the tests/examples, you too can store dictionaries,
or whatever you can think of in disk-based memory, just an open() and
Treedb comes with an AVL tree, doubly-linked-list and
implementations for you to use in your data structures.
To UNSUBSCRIBE, email to debian-devel-REQUEST@lists.debian.org
with a subject of "unsubscribe". Trouble? Contact email@example.com