|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Stack implementations backed by dynamic or fixed arrays. More...
#include <iostream>#include <aleph.H>#include <htlist.H>#include <tpl_dynDlist.H>#include <ah-args-ctor.H>#include <ah-dry.H>#include <tpl_memArray.H>#include <ah-errors.H>Go to the source code of this file.
Classes | |
| class | Aleph::ArrayStack< T > |
| Stack implemented with simple dynamic array and with bounds verification. More... | |
| class | Aleph::ArrayStack< T >::Iterator |
| Iterator on the items of a stack. More... | |
| class | Aleph::FixedStack< T > |
| Fixed length stack. More... | |
| class | Aleph::FixedStack< T >::Iterator |
| Iterator on the items of a stack. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Stack implementations backed by dynamic or fixed arrays.
This file provides two stack implementations:
ArrayStack<T>: Dynamic stack with bounds checking and automatic resizingFixedStack<T>: Fixed-capacity stack without bounds checking (fastest)Both provide LIFO semantics with push/pop operations.
Definition in file tpl_arrayStack.H.