SDSL 3.0.1
Succinct Data Structure Library
|
#include <wt_hutu.hpp>
Public Member Functions | |
l_heap () | |
Default constructor. | |
bool | empty () const |
Indicates if the heap is empty. | |
heap_node< t_element > * | find_min () const |
Get the smallest element. | |
heap_node< t_element > * | find_snd_min () const |
Get the second smallest element. | |
heap_node< t_element > * | insert (t_element *x) |
Insert an element into the heap. | |
void | delete_min () |
Delete the smallest element in the heap. | |
void | delete_element (heap_node< t_element > *item) |
void | merge (l_heap< t_element > *rhs) |
void | free_memory () |
Definition at line 76 of file wt_hutu.hpp.
|
inline |
Default constructor.
Definition at line 160 of file wt_hutu.hpp.
|
inline |
Definition at line 213 of file wt_hutu.hpp.
|
inline |
Delete the smallest element in the heap.
Definition at line 203 of file wt_hutu.hpp.
|
inline |
Indicates if the heap is empty.
Definition at line 165 of file wt_hutu.hpp.
|
inline |
Get the smallest element.
Definition at line 171 of file wt_hutu.hpp.
|
inline |
Get the second smallest element.
Definition at line 177 of file wt_hutu.hpp.
|
inline |
Definition at line 247 of file wt_hutu.hpp.
|
inline |
Insert an element into the heap.
x | Element that is inserted into the heap. |
Definition at line 193 of file wt_hutu.hpp.
|
inline |
Definition at line 240 of file wt_hutu.hpp.