tpl_arrayQueue.H File Reference

Circular queue implementations backed by arrays. More...

#include <ahAssert.H>
#include <ahDefs.H>
#include <htlist.H>
#include <ah-dry.H>
#include <ah-args-ctor.H>
#include <tpl_dynDlist.H>
#include <tpl_memArray.H>

Include dependency graph for tpl_arrayQueue.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::ArrayQueue< T >
	Queue implemented with a single dynamic array. More...
struct	Aleph::ArrayQueue< T >::Iterator
	Simple iterator on elements of a queue. More...
class	Aleph::FixedQueue< T >
	Very simple queue implemented with a contiguous array. More...
struct	Aleph::FixedQueue< T >::Iterator
	Simple iterator on elements of a queue. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Detailed Description

Circular queue implementations backed by arrays.

This file provides two queue implementations:

• ArrayQueue<T>: Dynamic circular queue with bounds checking
• FixedQueue<T>: Fixed-capacity circular queue (no bounds checking)

Both use circular indexing for O(1) enqueue/dequeue operations.

Author

Leandro Rabindranath León

Definition in file tpl_arrayQueue.H.