#include <CandidateHeapList.hpp>
Collaboration diagram for CandidateHeapList:

Purpose: Sorted List like described in Sethian/Kimmel FMMs
@ Copyrights: Bernard De Cuyper & Eddy Fraiha 2002, Eggs & Pictures. MIT/Open BSD copyright model.
Public Methods | |
| CandidateHeapList (int maxData) | |
| ~CandidateHeapList () | |
| bool | isEmpty () |
| bool | isFull () |
| int | numberOfData () |
| Psi2DValue * | getTop () |
| Psi2DValue * | get (int i) |
| void | insertData (Psi2DValue *data) |
| void | removeFirstValue () |
| void | updateData (Psi2DValue *data) |
| void | output () |
Protected Methods | |
| void | reorderUp (int key) |
| void | reorderDown (int key) |
| void | reorder (int akey) |
Private Attributes | |
| int | nmax |
| int | n |
| Psi2DValue ** | heap |
![]() |
