#include <priorityarray.h>
◆ PriorityArray() [1/2]
template<class TYPE>
PriorityArray::PriorityArray |
( |
int | size | ) |
|
◆ PriorityArray() [2/2]
template<class TYPE>
PriorityArray::PriorityArray |
( |
const PriorityArray< TYPE > & | rhs | ) |
|
◆ ~PriorityArray()
template<class TYPE>
PriorityArray::~PriorityArray |
( |
| ) |
|
◆ Add()
template<class TYPE>
void PriorityArray::Add |
( |
const TYPE & | elm, |
|
|
float | pri ) |
◆ At()
template<class TYPE>
TYPE & PriorityArray::At |
( |
int | index | ) |
|
return n'th array element
◆ Clear()
template<class TYPE>
void PriorityArray::Clear |
( |
| ) |
|
◆ Copy()
◆ Delete()
template<class TYPE>
void PriorityArray::Delete |
( |
| ) |
|
|
private |
◆ Destroy()
template<class TYPE>
void PriorityArray::Destroy |
( |
TYPE * | elm | ) |
|
|
private |
destroy an element (call destructor without freeing memory)
◆ IsEmpty()
template<class TYPE>
bool PriorityArray::IsEmpty |
( |
| ) |
const |
◆ operator=()
◆ operator[]()
template<class TYPE>
TYPE & PriorityArray::operator[] |
( |
int | index | ) |
const |
◆ Size()
template<class TYPE>
int PriorityArray::Size |
( |
| ) |
const |
get number of elements in array
◆ UpdateMinPriElementIndex()
template<class TYPE>
void PriorityArray::UpdateMinPriElementIndex |
( |
| ) |
|
|
private |
update the min pri element index
◆ elements
◆ maxElements
◆ minPriElementIndex
◆ numElements
The documentation for this class was generated from the following file: