GRASS Programmer's Manual
6.4.2(2012)
|
#include <minmaxheap.h>
Public Member Functions | |
MinMaxHeap (HeapIndex size) | |
virtual | ~MinMaxHeap () |
bool | full (void) const |
HeapIndex | get_maxsize () const |
HeapIndex | fill (T *arr, HeapIndex n) |
Protected Member Functions | |
virtual void | grow () |
Definition at line 725 of file minmaxheap.h.
MinMaxHeap< T >::MinMaxHeap | ( | HeapIndex | size | ) | [inline] |
Definition at line 727 of file minmaxheap.h.
virtual MinMaxHeap< T >::~MinMaxHeap | ( | ) | [inline, virtual] |
Definition at line 728 of file minmaxheap.h.
HeapIndex MinMaxHeap< T >::fill | ( | T * | arr, |
HeapIndex | n | ||
) |
Definition at line 742 of file minmaxheap.h.
bool MinMaxHeap< T >::full | ( | void | ) | const [inline] |
Definition at line 729 of file minmaxheap.h.
HeapIndex MinMaxHeap< T >::get_maxsize | ( | ) | const [inline] |
Definition at line 730 of file minmaxheap.h.
virtual void MinMaxHeap< T >::grow | ( | ) | [inline, protected, virtual] |
Implements BasicMinMaxHeap< T >.
Definition at line 734 of file minmaxheap.h.