This toolbox implements pointer variables and can be used to implement dynamic data structures such as linked lists.
In this implementation, virtual memory is simply a large cell array and the pointers are integers that index into it. The core program keeps track of which slots are used and which are free and leaves it up to the user to ensure that all allocated slots are being used and that all pointers are used correctly.
Some advantages of this approach are that the virtual memory is distinct from the rest of the workspace, and any object can be assigned to a given memory slot.
The toolbox is intended mainly for pedagogical purposes, and provides a safe environment to learn about linked lists, dynamic data structures, wild pointers, dangling pointers, memory leaks, seg faults, etc - without having to worry about things like low-level memory allocation and type matching.
The demo file shows how to use the basic routines MALLOC, MREAD, MWRITE, MFREE, MWIPE, and how to implement a stack as a linked list.
Let me know if you find this useful. Enjoy!
|
