Scaffolding
0.1
This program can assemble genome scaffolds using the pairing information in paired-end reads.
|
a priority-queue allowing member queries More...
#include <set_queue.hpp>
Public Types | |
typedef T_to_Prio_Type::iterator | iterator |
iterators will point to objects in the map of objects to priorities | |
typedef T_to_Prio_Type::const_iterator | const_iterator |
Public Member Functions | |
set_queue (const Compare &_comp=Compare()) | |
construct with comparator | |
const_iterator & | cbegin () const |
const_iterator & | cend () const |
bool | empty () const |
return whether the set_queue is empty | |
std::pair< const_iterator, bool > | insert (const T &element, const Priority &prio) |
insert an element into the set_queue and return whether it was newly inserted More... | |
const_iterator & | find (const T &element) const |
find an element in the set_queue | |
std::pair< Priority, bool > | get_priority (const T &element) const |
get priority of an element More... | |
const const_iterator | get_min_element () const |
get an element of minimum priority More... | |
void | erase (const const_iterator &iter) |
remove an element from the queue, given its iterator | |
bool | erase (const T &element) |
remove an element from the queue, given the element More... | |
void | set_priority (const const_iterator &iter, const Priority &prio, const bool update_only=false) |
modify the priority of an element, given an iterator More... | |
bool | set_priority (const T &element, const Priority &prio, const bool update_only=false) |
modify the priority of a given element, return whether the element was found in the queue More... | |
void | update_priority (const const_iterator &iter, const Priority &prio) |
update the priority of an element, given an iterator More... | |
bool | update_priority (const T &element, const Priority &prio) |
update the priority of a given element, return success More... | |
void | clear () |
clear the container | |
a priority-queue allowing member queries
|
inline |
remove an element from the queue, given the element
return whether the element previously existed in the queue
|
inline |
get an element of minimum priority
undefined if the queue is empty
|
inline |
get priority of an element
returns the priority and a bool indicating success (false iff element is not found in the set queue)
|
inline |
|
inline |
modify the priority of an element, given an iterator
if update_only is true and not comp(new_prio, old_prio), then don't overwrite the priority
|
inline |
modify the priority of a given element, return whether the element was found in the queue
if update_only is true and not comp(new_prio, old_prio), then don't overwrite the priority
|
inline |
update the priority of an element, given an iterator
only overwrite priority if comp(prio, old_prio)
|
inline |
update the priority of a given element, return success
only overwrite priority if comp(prio, old_prio)