DataStructures::Queue< queue_type > Class Template Reference

A queue implemented as an array with a read and write index. More...

#include <DS_Queue.h>

Collaboration diagram for DataStructures::Queue< queue_type >:

List of all members.

Public Member Functions
	Queue ()
	~Queue ()
	Queue (Queue &original_copy)
bool	operator= (const Queue &original_copy)
void	Push (const queue_type &input, const char *file, unsigned int line)
void	PushAtHead (const queue_type &input, unsigned index, const char *file, unsigned int line)
queue_type &	operator[] (unsigned int position) const
void	RemoveAtIndex (unsigned int position)
queue_type	Peek (void) const
queue_type	PeekTail (void) const
queue_type	Pop (void)
queue_type	PopDeref (void)
unsigned int	Size (void) const
bool	IsEmpty (void) const
unsigned int	AllocationSize (void) const
void	Clear (const char *file, unsigned int line)
void	Compress (const char *file, unsigned int line)
bool	Find (queue_type q)
void	ClearAndForceAllocation (int size, const char *file, unsigned int line)

---

Detailed Description

template<class queue_type>
class DataStructures::Queue< queue_type >

A queue implemented as an array with a read and write index.

Definition at line 24 of file DS_Queue.h.

---

Constructor & Destructor Documentation

template<class queue_type >

DataStructures::Queue< queue_type >::Queue

(

)

Definition at line 78 of file DS_Queue.h.

template<class queue_type >

DataStructures::Queue< queue_type >::~Queue

(

)

Definition at line 89 of file DS_Queue.h.

Here is the call graph for this function:

template<class queue_type >

DataStructures::Queue< queue_type >::Queue

(

Queue< queue_type > &

original_copy

)

Definition at line 245 of file DS_Queue.h.

Here is the call graph for this function:

---

Member Function Documentation

template<class queue_type >

unsigned int DataStructures::Queue< queue_type >::AllocationSize

(

void

)

const [inline]

Definition at line 72 of file DS_Queue.h.

Here is the caller graph for this function:

template<class queue_type >

void DataStructures::Queue< queue_type >::Clear	(	const char *	file,
		unsigned int	line
	)			[inline]

Definition at line 301 of file DS_Queue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class queue_type >

void DataStructures::Queue< queue_type >::ClearAndForceAllocation	(	int	size,
		const char *	file,
		unsigned int	line
	)

Definition at line 362 of file DS_Queue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class queue_type >

void DataStructures::Queue< queue_type >::Compress	(	const char *	file,
		unsigned int	line
	)

Definition at line 317 of file DS_Queue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class queue_type>

bool DataStructures::Queue< queue_type >::Find

(

queue_type

q

)

Definition at line 343 of file DS_Queue.h.

template<class queue_type >

bool DataStructures::Queue< queue_type >::IsEmpty

(

void

)

const [inline]

Definition at line 66 of file DS_Queue.h.

Here is the caller graph for this function:

template<class queue_type >

bool DataStructures::Queue< queue_type >::operator=

(

const Queue< queue_type > &

original_copy

)

Definition at line 270 of file DS_Queue.h.

Here is the call graph for this function:

template<class queue_type >

queue_type & DataStructures::Queue< queue_type >::operator[]

(

unsigned int

position

)

const [inline]

Definition at line 372 of file DS_Queue.h.

Here is the call graph for this function:

template<class queue_type >

queue_type DataStructures::Queue< queue_type >::Peek

(

void

)

const [inline]

Definition at line 175 of file DS_Queue.h.

Here is the caller graph for this function:

template<class queue_type >

queue_type DataStructures::Queue< queue_type >::PeekTail

(

void

)

const [inline]

Definition at line 185 of file DS_Queue.h.

template<class queue_type >

queue_type DataStructures::Queue< queue_type >::Pop

(

void

)

[inline]

Definition at line 96 of file DS_Queue.h.

Here is the caller graph for this function:

template<class queue_type >

queue_type DataStructures::Queue< queue_type >::PopDeref

(

void

)

[inline]

Definition at line 113 of file DS_Queue.h.

template<class queue_type>

void DataStructures::Queue< queue_type >::Push	(	const queue_type &	input,
		const char *	file,
		unsigned int	line
	)

Definition at line 197 of file DS_Queue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class queue_type>

void DataStructures::Queue< queue_type >::PushAtHead	(	const queue_type &	input,
		unsigned	index,
		const char *	file,
		unsigned int	line
	)

Definition at line 132 of file DS_Queue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class queue_type >

void DataStructures::Queue< queue_type >::RemoveAtIndex

(

unsigned int

position

)

Definition at line 386 of file DS_Queue.h.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class queue_type >

unsigned int DataStructures::Queue< queue_type >::Size

(

void

)

const [inline]

Definition at line 57 of file DS_Queue.h.

Here is the caller graph for this function:

---

The documentation for this class was generated from the following file:

• DS_Queue.h