|
| WFATree (const gbwtgraph::GBWTGraph &graph, const std::string &sequence, pos_t from, pos_t to, const Aligner &aligner, const WFAExtender::ErrorModel &error_model) |
|
std::uint32_t | size () const |
|
uint32_t | parent (std::uint32_t node) const |
|
std::int32_t | gap_extend_penalty (std::uint32_t length) const |
|
std::int32_t | gap_penalty (std::uint32_t length) const |
|
void | extend (std::int32_t score) |
|
std::int32_t | next_score (std::int32_t match_score) |
|
void | next (std::int32_t score) |
|
std::pair< MatchPos, WFAAlignment::Edit > | ins_predecessor (uint32_t node, int32_t score, int32_t diagonal) const |
|
std::pair< MatchPos, WFAAlignment::Edit > | del_predecessor (uint32_t node, int32_t score, int32_t diagonal) const |
|
std::pair< MatchPos, WFAAlignment::Edit > | match_predecessor (uint32_t node, int32_t score, int32_t diagonal) const |
|
void | successor_offset (MatchPos &pos) const |
|
void | predecessor_offset (uint32_t &node, uint32_t &offset) const |
|
void | trim (const Aligner &aligner) |
|
|
void | extend_over (std::int32_t score, std::int32_t diagonal, const std::vector< std::uint32_t > &leaves) |
|
std::vector< std::uint32_t > | get_leaves () const |
|
std::pair< std::int32_t, std::int32_t > | update_diagonal_range (std::pair< std::int32_t, std::int32_t > range, std::int32_t score) const |
|
std::pair< int32_t, int32_t > | get_diagonals (int32_t score) |
|
void | expand_if_necessary (const MatchPos &pos) |
|
MatchPos | find_pos (size_t type, uint32_t node, int32_t score, int32_t diagonal, bool extendable_seq, bool extendable_graph) const |
|
bool | at_dead_end (const MatchPos &pos) const |
|
◆ WFATree()
◆ adjust_diagonal_range()
static void vg::WFATree::adjust_diagonal_range |
( |
std::pair< std::int32_t, std::int32_t > & |
range, |
|
|
std::int32_t |
diagonal |
|
) |
| |
|
inlinestaticprivate |
◆ at_dead_end()
bool vg::WFATree::at_dead_end |
( |
const MatchPos & |
pos | ) |
const |
|
inlineprivate |
◆ del_predecessor()
◆ empty_diagonal_range()
static std::pair<int32_t, int32_t> vg::WFATree::empty_diagonal_range |
( |
| ) |
|
|
inlinestaticprivate |
◆ expand_if_necessary()
void vg::WFATree::expand_if_necessary |
( |
const MatchPos & |
pos | ) |
|
|
inlineprivate |
◆ extend()
void vg::WFATree::extend |
( |
std::int32_t |
score | ) |
|
|
inline |
◆ extend_over()
void vg::WFATree::extend_over |
( |
std::int32_t |
score, |
|
|
std::int32_t |
diagonal, |
|
|
const std::vector< std::uint32_t > & |
leaves |
|
) |
| |
|
inlineprivate |
◆ find_pos()
MatchPos vg::WFATree::find_pos |
( |
size_t |
type, |
|
|
uint32_t |
node, |
|
|
int32_t |
score, |
|
|
int32_t |
diagonal, |
|
|
bool |
extendable_seq, |
|
|
bool |
extendable_graph |
|
) |
| const |
|
inlineprivate |
◆ gap_extend_penalty()
std::int32_t vg::WFATree::gap_extend_penalty |
( |
std::uint32_t |
length | ) |
const |
|
inline |
◆ gap_penalty()
std::int32_t vg::WFATree::gap_penalty |
( |
std::uint32_t |
length | ) |
const |
|
inline |
◆ get_diagonals()
std::pair<int32_t, int32_t> vg::WFATree::get_diagonals |
( |
int32_t |
score | ) |
|
|
inlineprivate |
◆ get_leaves()
std::vector<std::uint32_t> vg::WFATree::get_leaves |
( |
| ) |
const |
|
inlineprivate |
◆ ins_predecessor()
◆ is_root()
static bool vg::WFATree::is_root |
( |
std::uint32_t |
node | ) |
|
|
inlinestatic |
◆ match_predecessor()
◆ next()
void vg::WFATree::next |
( |
std::int32_t |
score | ) |
|
|
inline |
◆ next_score()
std::int32_t vg::WFATree::next_score |
( |
std::int32_t |
match_score | ) |
|
|
inline |
◆ no_pos()
static bool vg::WFATree::no_pos |
( |
pos_t |
pos | ) |
|
|
inlinestatic |
◆ parent()
uint32_t vg::WFATree::parent |
( |
std::uint32_t |
node | ) |
const |
|
inline |
◆ predecessor_offset()
void vg::WFATree::predecessor_offset |
( |
uint32_t & |
node, |
|
|
uint32_t & |
offset |
|
) |
| const |
|
inline |
◆ size()
std::uint32_t vg::WFATree::size |
( |
| ) |
const |
|
inline |
◆ successor_offset()
void vg::WFATree::successor_offset |
( |
MatchPos & |
pos | ) |
const |
|
inline |
◆ trim()
void vg::WFATree::trim |
( |
const Aligner & |
aligner | ) |
|
|
inline |
◆ update_diagonal_range()
std::pair<std::int32_t, std::int32_t> vg::WFATree::update_diagonal_range |
( |
std::pair< std::int32_t, std::int32_t > |
range, |
|
|
std::int32_t |
score |
|
) |
| const |
|
inlineprivate |
◆ candidate_node
std::uint32_t vg::WFATree::candidate_node |
◆ candidate_point
◆ from
◆ gap_extend
std::int32_t vg::WFATree::gap_extend |
◆ gap_open
std::int32_t vg::WFATree::gap_open |
◆ graph
const gbwtgraph::CachedGBWTGraph vg::WFATree::graph |
◆ max_distance
std::int32_t vg::WFATree::max_distance |
◆ min_distance
std::int32_t vg::WFATree::min_distance |
◆ mismatch
std::int32_t vg::WFATree::mismatch |
◆ nodes
std::vector<WFANode> vg::WFATree::nodes |
◆ possible_scores
◆ score_bound
std::int32_t vg::WFATree::score_bound |
◆ sequence
const std::string& vg::WFATree::sequence |
◆ to
The documentation for this class was generated from the following file: