Search Results for "whatever"

...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 the interface...

Opens SQLite files and lets the user brows tables, data, triggers, relations, performance info and in general whatever can be extracted from the DB and underlying platform.

Crase enables instant access to structured information (personal contacts, software modelling, ..., whatever). The functionality is based on the mix of techniques, such as the graph database, metadata and functionality from composition and others.

DeBase aims to be a personal all-in-one easy-to-use application to store whatever information the user (re)defines as important.