winzip icon

Balanced Binary AVL Trees Using Dynamic RAM Allocation

Submitted on: 2/11/2015 3:06:00 PM
By: Herbert Glarner (from psc cd)  
Level: Advanced
User Rating: By 7 Users
Compatibility: VB 6.0
Views: 1677
     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).

winzip iconDownload code

Note: Due to the size or complexity of this submission, the author has submitted it as a .zip file to shorten your download time. Afterdownloading it, you will need a program like Winzip to decompress it.Virus note:All files are scanned once-a-day by Planet Source Code for viruses, but new viruses come out every day, so no prevention program can catch 100% of them. For your own safety, please:
  1. Re-scan downloaded files using your personal virus checker before using it.
  2. NEVER, EVER run compiled files (.exe's, .ocx's, .dll's etc.)--only run source code.
  3. Scan the source code with Minnow's Project Scanner

If you don't have a virus scanner, you can get one at many places on the net

Other 3 submission(s) by this author


Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Advanced category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)

Other User Comments

 There are no comments on this submission.

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)

To post feedback, first please login.