Scaffolding  0.1
This program can assemble genome scaffolds using the pairing information in paired-end reads.
set_queue< T, Priority, Compare > Member List

This is the complete list of members for set_queue< T, Priority, Compare >, including all inherited members.

cbegin() const (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
cend() const (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
clear() (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
const_iterator typedef (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >
empty() const (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
erase(const const_iterator &iter) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
erase(const T &element) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
find(const T &element) const (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
get_min_element() const (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
get_priority(const T &element) const (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
insert(const T &element, const Priority &prio) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
iterator typedef (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >
set_priority(const const_iterator &iter, const Priority &prio, const bool update_only=false) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
set_priority(const T &element, const Priority &prio, const bool update_only=false) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
set_queue(const Compare &_comp=Compare()) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
update_priority(const const_iterator &iter, const Priority &prio) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline
update_priority(const T &element, const Priority &prio) (defined in set_queue< T, Priority, Compare >)set_queue< T, Priority, Compare >inline