|
vg
tools for working with variation graphs
|
This is the complete list of members for handlegraph::MutableHandleGraph, including all inherited members.
| apply_ordering(const std::vector< handle_t > &order, bool compact_ids=false)=0 | handlegraph::MutableHandleGraph | pure virtual |
| apply_orientation(const handle_t &handle)=0 | handlegraph::MutableHandleGraph | pure virtual |
| create_edge(const handle_t &left, const handle_t &right)=0 | handlegraph::MutableHandleGraph | pure virtual |
| create_edge(const edge_t &edge) | handlegraph::MutableHandleGraph | inline |
| create_handle(const std::string &sequence)=0 | handlegraph::MutableHandleGraph | pure virtual |
| create_handle(const std::string &sequence, const nid_t &id)=0 | handlegraph::MutableHandleGraph | pure virtual |
| divide_handle(const handle_t &handle, const std::vector< size_t > &offsets)=0 | handlegraph::MutableHandleGraph | pure virtual |
| divide_handle(const handle_t &handle, size_t offset) | handlegraph::MutableHandleGraph | inline |
| 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 |
| 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 |
| increment_node_ids(nid_t increment) | handlegraph::MutableHandleGraph | virtual |
| increment_node_ids(long increment) | handlegraph::MutableHandleGraph | virtual |
| max_node_id() const =0 | handlegraph::HandleGraph | pure virtual |
| min_node_id() const =0 | handlegraph::HandleGraph | pure virtual |
| optimize(bool allow_id_reassignment=true)=0 | handlegraph::MutableHandleGraph | pure virtual |
| reassign_node_ids(const std::function< nid_t(const nid_t &)> &get_new_id)=0 | handlegraph::MutableHandleGraph | pure virtual |
| set_id_increment(const nid_t &min_id)=0 | handlegraph::MutableHandleGraph | pure virtual |
| traverse_edge_handle(const edge_t &edge, const handle_t &left) const | handlegraph::HandleGraph | |
| ~HandleGraph()=default | handlegraph::HandleGraph | virtual |
| ~MutableHandleGraph()=default | handlegraph::MutableHandleGraph | virtual |
1.8.17