$extrastylesheet
#include <mln/util/soft_heap.hh>
Public Member Functions | |
head () | |
head (const R &rank, node< T, R > *queue=0, head< T, R > *next=0, head< T, R > *prev=0, head< T, R > *suffix_min=0) | |
~head () | |
head< T, R > * | next () const |
head< T, R > * | prev () const |
node< T, R > * | queue () const |
const R & | rank () const |
void | set_next (head< T, R > *next) |
void | set_prev (head< T, R > *prev) |
void | set_queue (node< T, R > *queue) |
void | set_rank (const R &rank) |
void | set_suffix_min (head< T, R > *suffix_min) |
head< T, R > * | suffix_min () const |
Top structure of the soft heap.
Definition at line 138 of file soft_heap.hh.
mln::util::head< T, R >::head | ( | ) |
mln::util::head< T, R >::head | ( | const R & | rank, |
node< T, R > * | queue = 0 , |
||
head< T, R > * | next = 0 , |
||
head< T, R > * | prev = 0 , |
||
head< T, R > * | suffix_min = 0 |
||
) |
mln::util::head< T, R >::~head | ( | ) |
head<T,R>* mln::util::head< T, R >::next | ( | ) | const |
head<T,R>* mln::util::head< T, R >::prev | ( | ) | const |
node<T,R>* mln::util::head< T, R >::queue | ( | ) | const |
const R& mln::util::head< T, R >::rank | ( | ) | const |
void mln::util::head< T, R >::set_next | ( | head< T, R > * | next | ) |
void mln::util::head< T, R >::set_prev | ( | head< T, R > * | prev | ) |
void mln::util::head< T, R >::set_queue | ( | node< T, R > * | queue | ) |
void mln::util::head< T, R >::set_rank | ( | const R & | rank | ) |
void mln::util::head< T, R >::set_suffix_min | ( | head< T, R > * | suffix_min | ) |
head<T,R>* mln::util::head< T, R >::suffix_min | ( | ) | const |