The library (vicare containers istacks) implements a common
API for stack–like containers: data structure capable of
last–in/first–out operations. A data structure is stack–like if it
implements the operations: ‘empty?’, ‘top’, ‘push!’,
‘pop!’. Several libraries provide concrete stack implementations.
| • istacks common: | The common stacks API. | |
| • istacks lists: | Built-in lists as stacks. | |
| • istacks ilists: | Immutable lists as stacks. | |
| • istacks ralists: | Random-access lists as stacks. | |
| • istacks stacks: | Common stacks API for stacks. | |
| • istacks deques: | Deques as stacks. | |
| • istacks chains: | Chains as stacks. | |
| • istacks dynamic arrays: | Dynamic arrays as stacks. |