Stack and Queue
LIFO stack and FIFO queue macros + a library for developing additional stack and queue operations. Both containers include the ability to save/load data from snapshots.
See the info texts for documentation.
The containers are both implemented as circular buffers. This allows us to, for example, erase elements from the bottom of a stack by just moving the marker upwards, without the need for iteration.
Erase Bottom (Stack)
Erase Top (Stack)
Erase Back (Queue)
Erase Front (Queue)
*note* If you are creating your own algorithms and have the snapshot ports hooked up, the internal markers can sometimes get messed up during development. Reset buttons are provided inside the 'Stack Snap Store' and 'Queue Snap Store' primary macros which reset the markers back to zero.