I have been documenting myself about stacks, queues and deques for a small project. I will be requiring use of both stacks and queues for the project, and another type of structure, something similar to a stack, but that removes the final elements, such as this:
Stack from top to bottom (max 5 elem): [B][C][D][E][F]
Push A, becomes [A]=>[B][C][D][E]=>[F], result: [A][B][C][D][E]
I have been searching around wikipedia and such, but I don't know how to call this other than "some kind of stack". Results are LIFO, so popping would return A in the example, not F. The code is done as well, so I don't ask for help on that aspect.
My question is simpler: what would be the proper name for this structure?
EDIT: After examining the G5 library as suggested below. I decided to call them "Limited Stacks" or "Lstacks" since it's a name already used in a library. That would make the code more readable. Thanks to everyone!