PUBLIC

CircleQueueAC::CircleQueueAC(const SizeT) CircleQueueAC::~CircleQueueAC(void) CircleQueueAC::operator<<(const DataC &) CircleQueueAC::operator>>(DataC &) CircleQueueAC::Empty(void) CircleQueueAC::Size(void) const CircleQueueAC::IsEmpty(void) const

CircleQueueAC<class DataC>
The class CircleQueueAC is a FIFO queue represented by the circular buffer of a specified number of items.
include	"amma/CAQueue.hh"
User Level:	Default
Library:	Mold
Example:	exBiHash.cc
Section:	Obsolete
In Scope:	std

Comments:
All operations has a complexity O(1). The constructor and the destructor performs only the memory allocation and deallocation.

DataC * startAddress;

the pointer into the beginning of the data memory

DataC * firstIn;

the first empty item

DataC * firstOut;

the first full item

SizeT number;

the number of items of the whole queue

CircleQueueAC(const SizeT size = 10000)

~CircleQueueAC()

Destructor. Modifications of the object. ----------------------------

CircleQueueAC<DataC> & operator<<(const DataC & data)

Pushes the 'data' as the last item into the queue.

CircleQueueAC<DataC> & operator>>(DataC & data)

Pops the first item 'data' from the queue.

CircleQueueAC<DataC> & Empty()

Cleans the queue.

SizeT Size() const

Returns the current number of elements in the queue. Logical operations. -------------------

BooleanT IsEmpty() const

Does the queue contain any item