MemSL 4.0 details

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. With: * 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