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.

Project Activity

See All Activity >

Follow treedb

treedb Web Site

Other Useful Business Software
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of treedb!

Additional Project Details

Registered

2010-02-10