|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Dynamic queue implementation based on linked lists. More...
#include <iostream>#include <ahDry.H>#include <ahIterator.H>#include <ah-args-ctor.H>#include <htlist.H>#include <tpl_dynDlist.H>Go to the source code of this file.
Classes | |
| class | Aleph::DynListQueue< T > |
Dynamic queue of elements of generic type T based on single linked list. More... | |
| struct | Aleph::DynListQueue< T >::Iterator |
| Iterator on elements of a queue. More... | |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Dynamic queue implementation based on linked lists.
This file provides DynListQueue, a FIFO queue backed by a linked list. It supports O(1) enqueue and dequeue operations with unlimited capacity and efficient memory management.
Definition in file tpl_dynListQueue.H.