This is implementation of Bayer-Trees, which are normally used for indices of data bases. These routines provide all stuff that is needed to create and destroy; insert, update and delete; load and destroy; search and traverse; check a tree. Sort huge amounts of data by doing a multi-phase sorting on temporary files.
NeoMem allows you to store and organize all kinds of information in a cross between a word processor and database. The interface is similar to Windows Explorer, except that instead of dealing with files on a hard disk you deal with objects in a file. It can be used to store to do lists, books, website passwords, addresses, account information, and collections of all kinds. You can define your own classes for items that you want to store information about, and define properties for those objects. Each object can also store formatted text in a simple word processor view.