SDSL 3.0.3
Succinct Data Structure Library
Loading...
Searching...
No Matches
sdsl::_hutu_shape< t_wt >::l_heap< t_element > Class Template Reference

#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 ()
 

Detailed Description

template<class t_wt>
template<class t_element>
class sdsl::_hutu_shape< t_wt >::l_heap< t_element >

Definition at line 78 of file wt_hutu.hpp.

Constructor & Destructor Documentation

◆ l_heap()

template<class t_wt>
template<class t_element>
sdsl::_hutu_shape< t_wt >::l_heap< t_element >::l_heap ( )
inline

Default constructor.

Definition at line 168 of file wt_hutu.hpp.

Member Function Documentation

◆ delete_element()

template<class t_wt>
template<class t_element>
void sdsl::_hutu_shape< t_wt >::l_heap< t_element >::delete_element ( heap_node< t_element > * item)
inline

Definition at line 230 of file wt_hutu.hpp.

◆ delete_min()

template<class t_wt>
template<class t_element>
void sdsl::_hutu_shape< t_wt >::l_heap< t_element >::delete_min ( )
inline

Delete the smallest element in the heap.

Definition at line 219 of file wt_hutu.hpp.

◆ empty()

template<class t_wt>
template<class t_element>
bool sdsl::_hutu_shape< t_wt >::l_heap< t_element >::empty ( ) const
inline

Indicates if the heap is empty.

Definition at line 172 of file wt_hutu.hpp.

◆ find_min()

template<class t_wt>
template<class t_element>
heap_node< t_element > * sdsl::_hutu_shape< t_wt >::l_heap< t_element >::find_min ( ) const
inline

Get the smallest element.

Returns
The smallest element in the heap or nullptr if it does not exist.

Definition at line 181 of file wt_hutu.hpp.

◆ find_snd_min()

template<class t_wt>
template<class t_element>
heap_node< t_element > * sdsl::_hutu_shape< t_wt >::l_heap< t_element >::find_snd_min ( ) const
inline

Get the second smallest element.

Returns
The second smallest element in the heap or nullptr if it does not exist.

Definition at line 190 of file wt_hutu.hpp.

◆ free_memory()

template<class t_wt>
template<class t_element>
void sdsl::_hutu_shape< t_wt >::l_heap< t_element >::free_memory ( )
inline

Definition at line 268 of file wt_hutu.hpp.

◆ insert()

template<class t_wt>
template<class t_element>
heap_node< t_element > * sdsl::_hutu_shape< t_wt >::l_heap< t_element >::insert ( t_element * x)
inline

Insert an element into the heap.

Parameters
xElement that is inserted into the heap.
Returns
The new generated heap node.

Definition at line 209 of file wt_hutu.hpp.

◆ merge()

template<class t_wt>
template<class t_element>
void sdsl::_hutu_shape< t_wt >::l_heap< t_element >::merge ( l_heap< t_element > * rhs)
inline

Definition at line 261 of file wt_hutu.hpp.


The documentation for this class was generated from the following file: