vg
tools for working with variation graphs
|
This is the complete list of members for handlegraph::RankedHandleGraph, including all inherited members.
edge_handle(const handle_t &left, const handle_t &right) const | handlegraph::HandleGraph | |
flip(const handle_t &handle) const =0 | handlegraph::HandleGraph | pure virtual |
follow_edges(const handle_t &handle, bool go_left, const Iteratee &iteratee) const | handlegraph::HandleGraph | |
follow_edges_impl(const handle_t &handle, bool go_left, const std::function< bool(const handle_t &)> &iteratee) const =0 | handlegraph::HandleGraph | protectedpure virtual |
for_each_edge(const Iteratee &iteratee, bool parallel=false) const | handlegraph::HandleGraph | |
for_each_handle(const Iteratee &iteratee, bool parallel=false) const | handlegraph::HandleGraph | |
for_each_handle_impl(const std::function< bool(const handle_t &)> &iteratee, bool parallel=false) const =0 | handlegraph::HandleGraph | protectedpure virtual |
forward(const handle_t &handle) const | handlegraph::HandleGraph | |
get_base(const handle_t &handle, size_t index) const | handlegraph::HandleGraph | virtual |
get_degree(const handle_t &handle, bool go_left) const | handlegraph::HandleGraph | virtual |
get_edge_count() const | handlegraph::HandleGraph | virtual |
get_handle(const nid_t &node_id, bool is_reverse=false) const =0 | handlegraph::HandleGraph | pure virtual |
get_id(const handle_t &handle) const =0 | handlegraph::HandleGraph | pure virtual |
get_is_reverse(const handle_t &handle) const =0 | handlegraph::HandleGraph | pure virtual |
get_length(const handle_t &handle) const =0 | handlegraph::HandleGraph | pure virtual |
get_node_count() const =0 | handlegraph::HandleGraph | pure virtual |
get_sequence(const handle_t &handle) const =0 | handlegraph::HandleGraph | pure virtual |
get_subsequence(const handle_t &handle, size_t index, size_t size) const | handlegraph::HandleGraph | virtual |
get_total_length() const | handlegraph::HandleGraph | virtual |
handle_to_rank(const handle_t &handle) const | handlegraph::RankedHandleGraph | virtual |
has_edge(const handle_t &left, const handle_t &right) const | handlegraph::HandleGraph | virtual |
has_edge(const edge_t &edge) const | handlegraph::HandleGraph | inline |
has_node(nid_t node_id) const =0 | handlegraph::HandleGraph | pure virtual |
id_to_rank(const nid_t &node_id) const =0 | handlegraph::RankedHandleGraph | pure virtual |
max_node_id() const =0 | handlegraph::HandleGraph | pure virtual |
min_node_id() const =0 | handlegraph::HandleGraph | pure virtual |
rank_to_handle(const size_t &rank) const | handlegraph::RankedHandleGraph | virtual |
rank_to_id(const size_t &rank) const =0 | handlegraph::RankedHandleGraph | pure virtual |
traverse_edge_handle(const edge_t &edge, const handle_t &left) const | handlegraph::HandleGraph | |
~HandleGraph()=default | handlegraph::HandleGraph | virtual |