Memory Structures Library (MemSL) is a complete
data structures/collection classes library with
memory tracing, memory debugging, entry/exit
tracing, exception handling, definable memory
handlers, built-in thread support, and much more.
It supports 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, priority search
queue, and more.
