tHeap< T > Class Template Reference

#include <tHeap.h>

Inheritance diagram for tHeap< T >:

Inheritance graph
[legend]
Collaboration diagram for tHeap< T >:

Collaboration graph
[legend]

List of all members.

Public Member Functions

 tHeap ()
 ~tHeap ()
void Insert (T *e)
void Remove (T *e)
void Replace (T *e)
T * Remove (int i)
T * operator() (int i)
const T * operator() (int i) const
T * Events (int i)
int Len () const
tHeapBaseoperator & ()


Detailed Description

template<class T>
class tHeap< T >

Definition at line 109 of file tHeap.h.


Constructor & Destructor Documentation

template<class T>
tHeap< T >::tHeap (  )  [inline]

Definition at line 111 of file tHeap.h.

00111 {};

template<class T>
tHeap< T >::~tHeap (  )  [inline]

Definition at line 112 of file tHeap.h.

00112 {};


Member Function Documentation

template<class T>
void tHeap< T >::Insert ( T *  e  )  [inline]

Definition at line 114 of file tHeap.h.

Referenced by nBandwidthSceduler::AddArbitrator(), eWall::eWall(), eHalfEdge::FindPath(), and nBandwidthTaskPriorizer::Insert().

00114 {tHeapBase::Insert(e);}  // starts to manage object e

Here is the caller graph for this function:

template<class T>
void tHeap< T >::Remove ( T *  e  )  [inline]

Definition at line 115 of file tHeap.h.

Referenced by eHalfEdge::ClearPathData(), eHalfEdge::FindPath(), nBandwidthTaskPriorizer::Next(), and nBandwidthSceduler::RemoveArbitrator().

00115 {tHeapBase::Remove(e);}  // stops (does not delete e)

Here is the caller graph for this function:

template<class T>
void tHeap< T >::Replace ( T *  e  )  [inline]

Definition at line 116 of file tHeap.h.

00116 {tHeapBase::Replace(e);}

template<class T>
T* tHeap< T >::Remove ( int  i  )  [inline]

Reimplemented from tHeapBase.

Definition at line 117 of file tHeap.h.

00117 {return static_cast<T*> (tHeapBase::Remove(i));}

template<class T>
T* tHeap< T >::operator() ( int  i  )  [inline]

Reimplemented from tHeapBase.

Definition at line 119 of file tHeap.h.

00119 {return static_cast< T *>(tHeapBase::operator()(i));}

template<class T>
const T* tHeap< T >::operator() ( int  i  )  const [inline]

Reimplemented from tHeapBase.

Definition at line 120 of file tHeap.h.

00120 {return static_cast<const T *>(tHeapBase::operator()(i));}

template<class T>
T* tHeap< T >::Events ( int  i  )  [inline]

Definition at line 121 of file tHeap.h.

00121 {return static_cast<T *>(tHeapBase::operator()(i));}

template<class T>
int tHeap< T >::Len (  )  const [inline]

Reimplemented from tHeapBase.

Definition at line 123 of file tHeap.h.

Referenced by eHalfEdge::ClearPathData(), eHalfEdge::FindPath(), nBandwidthTaskPriorizer::Next(), nBandwidthArbitrator::OnChange(), nBandwidthTaskPriorizer::PeekNext(), sn_SendPlanned1(), and nBandwidthArbitrator::Timestep().

00123 {return tHeapBase::Len();}

Here is the caller graph for this function:

template<class T>
tHeapBase* tHeap< T >::operator & (  )  [inline]

Definition at line 125 of file tHeap.h.

00125 {return this;}


The documentation for this class was generated from the following file:
Generated on Sat Mar 15 23:56:48 2008 for Armagetron Advanced by  doxygen 1.5.4