Memory Structures Library Easy to use collection classes for MemSL
Download

Memory Structures Library Ranking & Summary

Memory Structures Library Tags

memory debugger memory debugger memsl class handle exception memsl

Memory Structures Library Description

Easy to use collection classes for MemSL Includes a complete data structures/collection classes library, memory tracing, memory debugging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.The MemSL has implementations of structures (i.e. threaded trees, AVL trees, dynamic hashing) that are extremely hard to find and far harder to implement. Here are some key features of "Memory Structures Library": · Single, Double, and Circular Linked Lists · AVL Balanced and Threaded Binary Trees · Dynamic Hashing Tables · Stacks, Queues and Dequeues (using arrays or linked lists) · Sets (Pascal implementation, with union, difference, intersection, etc.) · Bags, Tables and Dictionaries · Priority Heaps (uses the MemSL multi-dimensional array allocator) · Priority Search Queue · Data Handling and User Defined Functions · Using Multiple MemSL Data Structures to Index the same Data · Portability · Memory Tracing/Debugging (C Only) · Runtime Memory Tracing/Debugging (C Only) · Definable Memory Handlers (C Only) · Error/Warning Message Handlers · Entry/Exit Source Code Tracing/Debugging · Runtime Entry/Exit Source Code Tracing/Debugging

Memory Structures Library Related Software