meta-treedb Icon


on-disk memory library using meta-data

Add a Review
0 Downloads (This Week)
Last Update:
Download meta-treedb-1.5.0-03.tar.gz
Browse All Files
BSD Linux


meta-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, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away.

Meta-treedb comes with an AVL tree, doubly-linked-list and variable-entry-sized-array implementations for you to use in your data structures.

So, what distinguishes meta-treedb from treedb?
* "class" interfaces for treedb collections
These are vtables (virtual function tables) that implement th interface.
* faster compiles - only the "class" interfaces are visible to client code
This is at the expense of a small performance hit.
* the ability to use implementations that were developed after client code was compiled.

meta-treedb Web Site


Write a Review

User Reviews

Be the first to post a review of meta-treedb!

Additional Project Details

Intended Audience


Programming Language

C++, C



Thanks for helping keep SourceForge clean.

Screenshot instructions:
Red Hat Linux   Ubuntu

Click URL instructions:
Right-click on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)

More information about our ad policies

Briefly describe the problem (required):

Upload screenshot of ad (required):
Select a file, or drag & drop file here.

Please provide the ad click URL, if possible:

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

No, thanks