Creates a stack structure. A stack is a LIFO (last in, first out) vector of
of items. It has O(1) insertion and O(1) removal.
Pushes a value onto the end of the stack, adding a new index.
Pushes a string onto the end of a stack, truncating it if it is too long.
Pushes an array of cells onto the end of a stack. The cells are pushed as a
block (i.e. the entire array takes up one stack slot), rather than pushing
each cell individually.
Pops a cell value from a stack.
Pops a string value from a stack.
Pops an array of cells from a stack.
Returns if a stack is empty.
Pops a value off a stack, ignoring it completely.
Destroys a stack and frees its memory.