---

queue Class Template Reference

The queue class extends the FIFO_LIST template (which in this case is instantiated with queueElem *. More...

#include <queue.h>

Inheritance diagram for queue::

List of all members.

Public Methods
queueElem<T>*	queueStart ()
	Get the first element in the queue. More...
void	deleteStart ()
	Remove the element at the start of the list. More...
void	addQueue (packnode< T > *node, size_t indent)
	Add an element to the queue. More...
bool	queueEmpty ()
	return true if the queue is empty. More...

---

Detailed Description

template<class T> class queue

The queue class extends the FIFO_LIST template (which in this case is instantiated with queueElem *.

This class is designed to support breadth first printing of a wavelet packet tree.

Author:

Ian Kaplan

Definition at line 94 of file queue.h.

---

Member Function Documentation

template<class T> void queue<T>::addQueue ( packnode< T > * node, size_t indent ) [inline]

Add an element to the queue. Definition at line 122 of file queue.h. Referenced by packtree_base_int::breadthFirstPrint(), and packtree_base::breadthFirstPrint(). { queueElem<T> *elem = new queueElem<T>(node, indent); add( elem ); } // addQueue

template<class T> void queue<T>::deleteStart ( ) [inline]

Remove the element at the start of the list. This function does not actually call delete to recover the object. It relies on the fact that the FIFO_LIST template uses pool allocation and the memory will be recovered when the pool is deallocated. Definition at line 111 of file queue.h. Referenced by packtree_base_int::breadthFirstPrint(), and packtree_base::breadthFirstPrint(). { handle h = first(); if (h != 0) { queueElem<T> *elem = get_item( h ); remove(); // no delete elem; } } // deleteStart

template<class T> bool queue<T>::queueEmpty ( ) [inline]

return true if the queue is empty. Definition at line 129 of file queue.h. Referenced by packtree_base_int::breadthFirstPrint(), and packtree_base::breadthFirstPrint(). { return (first() == 0); }

template<class T> queueElem< T > * queue<T>::queueStart ( ) [inline]

Get the first element in the queue. Definition at line 98 of file queue.h. Referenced by packtree_base_int::breadthFirstPrint(), and packtree_base::breadthFirstPrint(). { handle h = first(); queueElem<T> *elem = get_item( h ); return elem; } // queueStart

---

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

• queue.h

---