msm::PriorityQueue< T > Class Template Reference

#include <MsmMap.h>

Public Member Functions
	PriorityQueue (int nelems=0)
void	init (int nelems)
void	clear ()
void	insert (const T &t)
void	remove (T &t)

Detailed Description

template<class T>
class msm::PriorityQueue< T >

Definition at line 337 of file MsmMap.h.

Constructor & Destructor Documentation

PriorityQueue()

template<class T>

msm::PriorityQueue< T >::PriorityQueue ( int  nelems = 0 )

inline

Definition at line 339 of file MsmMap.h.

References msm::PriorityQueue< T >::init().

                                  {
        if (nelems > 0)  init(nelems);
      }

Member Function Documentation

clear()

template<class T>

void msm::PriorityQueue< T >::clear ( )

inline

Definition at line 346 of file MsmMap.h.

                   {
        a.resize(0);
      }

init()

template<class T>

void msm::PriorityQueue< T >::init ( int  nelems )

inline

Definition at line 342 of file MsmMap.h.

Referenced by msm::PriorityQueue< T >::PriorityQueue().

                            {
        a.resize(nelems);  // pre-allocate space
        a.resize(0);       // nothing stored yet (does not free memory)
      }

insert()

template<class T>

void msm::PriorityQueue< T >::insert ( const T &  t )

inline

Definition at line 349 of file MsmMap.h.

                              {
        a.append(t);
        upheap();
      }

remove()

template<class T>

void msm::PriorityQueue< T >::remove ( T &  t )

inline

Definition at line 353 of file MsmMap.h.

                        {
        int last = a.len() - 1;
        if (last < 0) return;
        t = a[0];
        if (last > 0) a[0] = a[last];
        a.resize(last);  // remove last element from array
        downheap();
      }

---

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

• MsmMap.h