|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Dynamic stack implementation based on linked lists. More...
Go to the source code of this file.
Classes | |
| class | Aleph::DynListStack< T > |
| Dynamic stack of elements of generic type T based on a singly linked list. More... | |
| struct | Aleph::DynListStack< T >::Iterator |
| Iterator for traversing elements of the stack. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Dynamic stack implementation based on linked lists.
This file provides DynListStack, a LIFO stack backed by a singly linked list. It supports O(1) push and pop operations with unlimited capacity and includes functional operations like map, filter, and fold.
Definition in file tpl_dynListStack.H.