MemSL A free C/C++ library of useful routines allowing the efficient use of complex data structures
Download

MemSL Ranking & Summary

MemSL Tags

memory trace debug error handler memory tracer memory debugger

MemSL Description

A free C/C++ library of useful routines allowing the efficient use of complex data structures MemSL includes a complete data structures/collection classes library, memory tracing, exception handling, definable memory handlers, memory debugging, entry/exit tracing, built-in threads support and much more. MemSL has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing) that are extremely hard to find and far harder to implement. Here are some key features of "MemSL": · 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 Debugging, Error Handling and Entry/Exit Tracing: · 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

MemSL Related Software