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

Yaffa is an always evolving idea - now new approach for a data repository mixed with some features of object oriented databases with ease of use, no administration in mind and of course it will fit into the actual environment whatever that is.

This is an sql query engine for csv files, for when you do not have the time/energy/resources/inclination/whatever to load the data into a real database.

The Sh.I.A. project aims to develop a chatterbot (like Jabberwacky) that can learn whatever you teach it. This is oriented to novel developers and enthusiasts (like me :))who want to learn about A.I..

In Law implements a database that does not require a schema. Items are created in the database and related to each other in whatever way is needed. It is to RDBMSes what PERL is to Java.

The Centre d'Informations (CI) aim is to articulate and display whatever type of knowledge available on a given field (see screenshots examples for various fields). The software is built as a network of information articulated using concepts (figure). The website should not be understood as a conventional search engine but as different ways to navigate within this knowledge (information and concept) network.