treedb can implement malloc functionality, and much more!
Need a heap that allocates from 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, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away.
Treedb comes with an AVL tree, doubly-linked-list and variable-entry sized-array implementations for you to use in your data structures.
Follow treedb
Other Useful Business Software
Get full visibility and control over your tasks and projects with Wrike.
Wrike offers world-class features that empower cross-functional, distributed, or growing teams take their projects from the initial request stage all the way to tracking work progress and reporting results.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of treedb!