Advertisement

Results for "Author: herbert glarner"

ASP_Volume2 #29315
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).

ASP_Volume3 #64968
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).

ASP_Volume3 #64969
UserControl: Split window, scrollbars with MouseWheel support

UserControl featuring window splitter, useful for editors, worksheets, tables and more. Exposes the work areas: use them in your client like you would use any other PictureBox. Full mouse support, including MouseWheel.

ASP_Volume3 #64970
A+ Pathfinding Algorithm

Implementation of the fast A+ Pathfinding Algorithm, complete with testing environment, guiding you through the algorithm step by step.

ASP_Volume3 #64971
Professional Scrollbars, Subclassing for multiple objects

Uses subclassing to provide *multiple* objects of your controls with professional scrollbars: No more annoying flashing scrollbars with a focus you can't get rid of. - Uses COM reference stealing and variables storing for hWnd windows.

C_Volume2 #70377
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).

Java_Volume1 #88921
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).

2_2002-2004 #116068
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).

3_2004-2005 #134612
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).

4_2005-2006 #170265
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).

4_2005-2006 #170266
UserControl: Split window, scrollbars with MouseWheel support

UserControl featuring window splitter, useful for editors, worksheets, tables and more. Exposes the work areas: use them in your client like you would use any other PictureBox. Full mouse support, including MouseWheel.

4_2005-2006 #170267
A+ Pathfinding Algorithm

Implementation of the fast A+ Pathfinding Algorithm, complete with testing environment, guiding you through the algorithm step by step.

4_2005-2006 #170268
Professional Scrollbars, Subclassing for multiple objects

Uses subclassing to provide *multiple* objects of your controls with professional scrollbars: No more annoying flashing scrollbars with a focus you can't get rid of. - Uses COM reference stealing and variables storing for hWnd windows.

5_2007-2008 #192783
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).

5_2007-2008 #192784
UserControl: Split window, scrollbars with MouseWheel support

UserControl featuring window splitter, useful for editors, worksheets, tables and more. Exposes the work areas: use them in your client like you would use any other PictureBox. Full mouse support, including MouseWheel.

5_2007-2008 #192785
A+ Pathfinding Algorithm

Implementation of the fast A+ Pathfinding Algorithm, complete with testing environment, guiding you through the algorithm step by step.

5_2007-2008 #192786
Professional Scrollbars, Subclassing for multiple objects

Uses subclassing to provide *multiple* objects of your controls with professional scrollbars: No more annoying flashing scrollbars with a focus you can't get rid of. - Uses COM reference stealing and variables storing for hWnd windows.

6_2008-2009 #215301
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).

6_2008-2009 #215302
UserControl: Split window, scrollbars with MouseWheel support

UserControl featuring window splitter, useful for editors, worksheets, tables and more. Exposes the work areas: use them in your client like you would use any other PictureBox. Full mouse support, including MouseWheel.

6_2008-2009 #215303
A+ Pathfinding Algorithm

Implementation of the fast A+ Pathfinding Algorithm, complete with testing environment, guiding you through the algorithm step by step.

Languages
Top Categories
Global Discovery