Balanced Binary AVL Trees Using Dynamic RAM Allocation

ABSTRACT Provides any amount of requested memory (as long as there is available RAM) and associates that memory with a user-defined alphanumeric key. Features very fast retrieval in sorted order, even faster sequential access (in the chronological order the requests were made). DESCRIPTION The alphanumeric keys are associated with a certain quantity of bytes located at a designated position in RAM. That RAM is and remains exclusively reserved for that Key. Via the key the address can be returned, and also the reserved bytes at that address. Keys are internally managed with a balanced binary AVL tree. It is possible to iterate through the whole collection of keys in the order in which these keys were created (and the memory allocated), returning the Key, the Memory Address and the Size. It is also possible to access all the Keys in sorted order (ascending as well as descending). All operations are considerabily faster than VB's Collection object (as far as such functions are provided by the Collection).