|
vg
tools for working with variation graphs
|
#include <readfilter.hpp>
Public Types | |
| enum | FilterName { read = 0 , wrong_name , wrong_refpos , excluded_feature , min_score , min_sec_score , max_length , max_overhang , min_end_matches , min_mapq , split , repeat , defray , defray_all , random , min_base_qual , subsequence , proper_pair , unmapped , annotation , incorrectly_mapped , first_alignment , max_reads , filtered , last } |
Public Member Functions | |
| Counts () | |
| Counts & | operator+= (const Counts &other) |
| Counts & | set_paired_any () |
| If any read was filtered, count the other read as filtered. | |
| Counts & | set_paired_all () |
| If not all reads were filtered, count filtered ones as unfiltered. | |
| void | reset () |
| void | apply_max_reads (std::atomic< size_t > &counter, const size_t &limit) |
| void | invert () |
| Invert whether we are kept or not. | |
| bool | keep () |
Public Attributes | |
| vector< size_t > | counts |
|
inline |
|
inline |
If currently kept, and the limit is not std:numeric_limits<size_t>::max(), consume space in the counter. If space cannot be consumed in the counter to fit the read (or pair), become un-kept.
|
inline |
Invert whether we are kept or not.
|
inline |
|
inline |
|
inline |
If not all reads were filtered, count filtered ones as unfiltered.
|
inline |
If any read was filtered, count the other read as filtered.
| vector<size_t> vg::Counts::counts |
1.17.0