Scaffolding
0.1
This program can assemble genome scaffolds using the pairing information in paired-end reads.
|
an edge iterator that skips over all edges for which the predicate evaluates to false More...
#include <adv_edge_iters.hpp>
Public Member Functions | |
Predicated_EdgeIter (const Graph &_g, const EdgeIt &_payload, const EdgeIt &_end, const Predicate &_pred=Predicate()) | |
constructor initializing all data members | |
Predicated_EdgeIter (const Graph &_g, const std::pair< EdgeIt, EdgeIt > &range, const Predicate &_pred=Predicate()) | |
constructor using an iterator range as given by boost::edges() for example | |
Predicated_EdgeIter (const Predicated_EdgeIter< Graph, EdgeIt, Predicate > &_orig) | |
copy constructor | |
bool | is_valid () const |
return true iff the iterator is not "past-the-end" | |
operator bool () const | |
= is_valid() | |
const Edge< Graph > | operator* () const |
dereference operator, simply dereferences the internal boost iterator | |
Predicated_EdgeIter & | operator++ () |
increment operator | |
Predicated_EdgeIter | operator++ (int) |
post-increment | |
bool | operator== (const Predicated_EdgeIter< Graph, Predicate > &it) const |
check against another EdgeIter | |
Predicated_EdgeIter< Graph, Predicate, EdgeIt > & | operator= (const std::pair< EdgeIt, EdgeIt > &range) |
assign from a pair of iterators | |
an edge iterator that skips over all edges for which the predicate evaluates to false