ASSA::PriorityQueue< T, Compare > Class Template Reference

#include <PriorityQueue.h>

Public Member Functions
	PriorityQueue (size_t max_=20)
	PriorityQueue (size_t max_, const Compare &)
virtual	~PriorityQueue ()
virtual void	insert (const T &)
virtual T	pop ()
virtual const T &	top () const
virtual bool	remove (T &)
virtual size_t	size ()
virtual T &	operator[] (int)
virtual void	setHeapImpl (size_t, const Compare &)

Protected Member Functions
const PriorityQueue_Impl< T, Compare > *	getPriorityQueueImpl () const
	PriorityQueue (const PriorityQueue &)
PriorityQueue &	operator= (const PriorityQueue &)

Protected Attributes
Compare	m_comp

Private Attributes
PriorityQueue_Impl< T, Compare > *	m_impl

Detailed Description

template<class T, class Compare>
class ASSA::PriorityQueue< T, Compare >

Definition at line 34 of file PriorityQueue.h.

Constructor & Destructor Documentation

PriorityQueue() [1/3]

template<class T, class Compare>

ASSA::PriorityQueue< T, Compare >::PriorityQueue ( size_t max_ = 20 )

inline

Definition at line 68 of file PriorityQueue.h.

    : m_impl (0)
{
    // This is a perfect place for using Factory to decide which
    // implementation to use
    // const char self[]="PriorityQueue::PriorityQueue(maxsz)"; trace();
 
    setHeapImpl (maxsz_, m_comp);
}

References m_comp, m_impl, and setHeapImpl().

Referenced by operator=(), and PriorityQueue().

PriorityQueue() [2/3]

template<class T, class Compare>

ASSA::PriorityQueue< T, Compare >::PriorityQueue ( size_t max_, const Compare & x_ )

inline

Definition at line 81 of file PriorityQueue.h.

    : m_comp (x_), m_impl (0)
{
    // This is perfect place for using Factory to decide which
    // implementation to use
    setHeapImpl (maxsz_, m_comp);
}

References m_comp, m_impl, and setHeapImpl().

~PriorityQueue()

template<class T, class Compare>

ASSA::PriorityQueue< T, Compare >::~PriorityQueue ( )

inlinevirtual

Definition at line 107 of file PriorityQueue.h.

{
    delete m_impl;
}

References m_impl.

PriorityQueue() [3/3]

template<class T, class Compare>

ASSA::PriorityQueue< T, Compare >::PriorityQueue ( const PriorityQueue< T, Compare > & )

protected

References PriorityQueue().

Member Function Documentation

getPriorityQueueImpl()

template<class T, class Compare>

const PriorityQueue_Impl< T, Compare > * ASSA::PriorityQueue< T, Compare >::getPriorityQueueImpl ( ) const

inlineprotected

Definition at line 155 of file PriorityQueue.h.

{
    return (const PriorityQueue_Impl<T, Compare>*) m_impl;
}

References m_impl.

insert()

template<class T, class Compare>

void ASSA::PriorityQueue< T, Compare >::insert ( const T & el_ )

inlinevirtual

Definition at line 115 of file PriorityQueue.h.

{
    m_impl->insert (el_);
}

References m_impl.

operator=()

template<class T, class Compare>

PriorityQueue & ASSA::PriorityQueue< T, Compare >::operator= ( const PriorityQueue< T, Compare > & )

protected

References PriorityQueue().

operator[]()

template<class T, class Compare>

T & ASSA::PriorityQueue< T, Compare >::operator[] ( int idx )

inlinevirtual

Definition at line 163 of file PriorityQueue.h.

{
    return (*m_impl)[idx];
}

References m_impl.

pop()

template<class T, class Compare>

T ASSA::PriorityQueue< T, Compare >::pop ( )

inlinevirtual

Definition at line 123 of file PriorityQueue.h.

{
    return m_impl->pop ();
}

References m_impl.

remove()

template<class T, class Compare>

bool ASSA::PriorityQueue< T, Compare >::remove ( T & t_ )

inlinevirtual

Definition at line 139 of file PriorityQueue.h.

{
    return m_impl->remove (t_);
}

References m_impl.

setHeapImpl()

template<class T, class Compare>

void ASSA::PriorityQueue< T, Compare >::setHeapImpl ( size_t maxsz_, const Compare & x_ )

inlinevirtual

Definition at line 92 of file PriorityQueue.h.

{
    // Maybe here you would want to copy contents of the old
    // implementation to the new one?
    //
 
    if (m_impl != 0)
        delete m_impl;
 
    m_impl = new PriorityQueue_Heap<T, Compare> (maxsz_, x_);
}

References m_impl.

Referenced by PriorityQueue(), and PriorityQueue().

size()

template<class T, class Compare>

size_t ASSA::PriorityQueue< T, Compare >::size ( )

inlinevirtual

Definition at line 147 of file PriorityQueue.h.

{
    return m_impl->size ();
}

References m_impl.

top()

template<class T, class Compare>

const T & ASSA::PriorityQueue< T, Compare >::top ( ) const

inlinevirtual

Definition at line 131 of file PriorityQueue.h.

{
    return m_impl->top ();
}

References m_impl.

Member Data Documentation

m_comp

template<class T, class Compare>

Compare ASSA::PriorityQueue< T, Compare >::m_comp

protected

Definition at line 53 of file PriorityQueue.h.

Referenced by PriorityQueue(), and PriorityQueue().

m_impl

template<class T, class Compare>

PriorityQueue_Impl< T, Compare >* ASSA::PriorityQueue< T, Compare >::m_impl

private

Definition at line 59 of file PriorityQueue.h.

Referenced by getPriorityQueueImpl(), insert(), operator[](), pop(), PriorityQueue(), PriorityQueue(), remove(), setHeapImpl(), size(), top(), and ~PriorityQueue().

---

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

• PriorityQueue.h