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 >

Follow meta-treedb

meta-treedb Web Site

Other Useful Business Software

2018 Thomson Reuters Top 100 Global Tech Leaders 2018 Thomson Reuters Top 100 Global Tech Leaders Icon
2018 Thomson Reuters Top 100 Global Tech Leaders Icon

See how tech-sector leadership is being redefined in today’s complex business environment.

21st century technology-sector leadership requires not only optimal financial performance but also attention to many other factors, including management and investor confidence, risk and resilience, legal compliance, innovation, environmental impact, social responsibility, and reputation. Successfully managing these areas may determine which tech companies have the fortitude to succeed in the future. Here’s to those that made the list.
Who are today’s top global tech leaders?
Read the report

Rate This Project

Login To Rate This Project

User Reviews

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

Additional Project Details

Intended Audience

Developers

Programming Language

C++, C

Registered

2010-05-10