Discovering Stack and Queue
The last two data structures that we are going to cover in this chapter are Stack and Queue. These are built-in Bosque collections and – unlike the previous ones – do not have dynamic twins. At the current stage of Bosque development, these concepts are rather small and do not offer much functionality. However, it's likely that they will be enhanced in the future.
Important note
At the time of writing, the Stack and Queue concepts have not been implemented yet. Any attempt to use them will result in errors. The concepts itself are declared in Bosque but they lack any internal implementation.
Since these concepts are quite small and not implemented yet, we will only review their basic methods because currently, they do not work at all.
Reviewing Stack methods
In general, stacks are data structures that have one specific characteristic; that is, you can only retrieve elements from them in the reverse order they were added...
