Scaffolding
0.1
This program can assemble genome scaffolds using the pairing information in paired-end reads.
|
an edge predicate that is true iff the given edge has its target (not) in a given set More...
#include <predicates.hpp>
Public Types | |
using | Element = Edge< Graph > |
Public Member Functions | |
TargetContainedPredicate (const Container &_container, const Graph &_g, const bool _invert=false, const bool _matching_OK=true) | |
constructor More... | |
bool | operator() (const Element &e) const |
![]() | |
Predicate (const bool _invert=false) | |
constructor | |
virtual bool | operator() (const Edge< Graph > &e) const =0 |
all predicates must implement operator() | |
Public Attributes | |
const Container & | container |
reference to the container | |
const Graph & | g |
reference to the graph | |
const bool | matching_OK |
indicate whether matching edges should be treated like any other edge (true) or always evaluate to false (false) | |
![]() | |
const bool | invert |
indicate whether the predicate should be inverted | |
an edge predicate that is true iff the given edge has its target (not) in a given set
Changing the container or the graph will change the result of predicate checks. Matching edges can be disallowed, by constructing with matching_OK = false.
|
inline |
constructor
no copies are made, we only save references