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.

Project Activity

See All Activity >

License

GNU Library or Lesser General Public License version 3.0 (LGPLv3)

Follow meta-treedb

meta-treedb Web Site

Other Useful Business Software
Free and Open Source HR Software Icon
Free and Open Source HR Software

OrangeHRM provides a world-class HRIS experience and offers everything you and your team need to be that HR hero you know that you are.

Give your HR team the tools they need to streamline administrative tasks, support employees, and make informed decisions with the OrangeHRM free and open source HR software.
Rate This Project
Login To Rate This Project

User Reviews

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

Additional Project Details

Operating Systems

Linux, BSD

Intended Audience

Developers

Programming Language

C++, C

Related Categories

C++ Database Engines Servers, C Database Engines Servers

Registered

2010-05-10