Implementing circular stack for Command Stack

[roman-koshchei]

I added CircularStack, which is a fixed size stack that goes around if there is no more space to add new items.
It's related to the comment:

// @todo this is garbage for performance, as it has to copy the entire buffer when it's full
// could be solved by using linked lists instead of dynamic arrays (vectors)
// optimal solution may be to preallocate an array instead, and use a cursor to manage undo/redo <-- probably do this
// luckily we only store pointers so should be decent performance for now (as long as max_undo_steps doesn't grow too large)

I am sure we can make it even better by using only 1 stack instead of 2 for undo and redo commands. But I just wanted to make the initial step. I am not a game dev, but I like implementing data structures, so here it is.

Code is tested in my another project works fine. Currently, size type is hard-coded based on max_undo_steps type, but it can also be put into a template later.

Waiting for a feedback.

[PanosK92]

Thanks a lot for the PR!

Since the engine isn’t used for game development yet, there’s no need to worry too much about perfection. For example, I’m happy with how max_undo_steps is hardcoded, its nature doesn't require anything else, and simplicity is key, just as mentioned in the coding style\general advice.

Your work is a nice step forward, feel free to proceed. I’m ready to merge when you are.

[roman-koshchei]

Thanks, it's ready to be merged.
I think putting size type into a template will be overkill and introduce unnecessary complexity at this point.

[PanosK92]

I agree, thanks!

[PanosK92]

I reached out on X, please check.