#include <mem.hpp>
◆ MaximalExactMatch() [1/4]
vg::MaximalExactMatch::MaximalExactMatch |
( |
string::const_iterator |
b, |
|
|
string::const_iterator |
e, |
|
|
gcsa::range_type |
r, |
|
|
size_t |
m = 0 |
|
) |
| |
|
inline |
◆ MaximalExactMatch() [2/4]
vg::MaximalExactMatch::MaximalExactMatch |
( |
void |
| ) |
|
|
default |
◆ MaximalExactMatch() [3/4]
◆ MaximalExactMatch() [4/4]
◆ count_Ns()
size_t vg::MaximalExactMatch::count_Ns |
( |
void |
| ) |
const |
◆ filter_hits_to()
size_t vg::MaximalExactMatch::filter_hits_to |
( |
int |
limit | ) |
|
◆ length()
int vg::MaximalExactMatch::length |
( |
void |
| ) |
const |
◆ operator=() [1/2]
◆ operator=() [2/2]
◆ sequence()
string vg::MaximalExactMatch::sequence |
( |
void |
| ) |
const |
◆ operator<
◆ operator<<
◆ operator==
◆ begin
string::const_iterator vg::MaximalExactMatch::begin |
◆ end
string::const_iterator vg::MaximalExactMatch::end |
◆ fragment
int vg::MaximalExactMatch::fragment |
◆ match_count
size_t vg::MaximalExactMatch::match_count |
◆ nodes
std::vector<gcsa::node_type> vg::MaximalExactMatch::nodes |
◆ positions
unordered_map<path_handle_t, vector<pair<size_t, bool> > > vg::MaximalExactMatch::positions |
◆ primary
bool vg::MaximalExactMatch::primary |
◆ queried_count
size_t vg::MaximalExactMatch::queried_count |
◆ range
gcsa::range_type vg::MaximalExactMatch::range |
The documentation for this class was generated from the following files: