|
vg
tools for working with variation graphs
|
This is the complete list of members for handlegraph::PathHandleGraph, 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 |
| for_each_path_handle(const Iteratee &iteratee) const | handlegraph::PathHandleGraph | |
| for_each_path_handle_impl(const std::function< bool(const path_handle_t &)> &iteratee) const =0 | handlegraph::PathHandleGraph | protectedpure virtual |
| for_each_step_in_path(const path_handle_t &path, const Iteratee &iteratee) const | handlegraph::PathHandleGraph | |
| for_each_step_on_handle(const handle_t &handle, const Iteratee &iteratee) const | handlegraph::PathHandleGraph | |
| for_each_step_on_handle_impl(const handle_t &handle, const std::function< bool(const step_handle_t &)> &iteratee) const =0 | handlegraph::PathHandleGraph | 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_handle_of_step(const step_handle_t &step_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_id(const handle_t &handle) const =0 | handlegraph::HandleGraph | pure virtual |
| get_is_circular(const path_handle_t &path_handle) const =0 | handlegraph::PathHandleGraph | 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_next_step(const step_handle_t &step_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_node_count() const =0 | handlegraph::HandleGraph | pure virtual |
| get_path_count() const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_path_handle(const std::string &path_name) const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_path_handle_of_step(const step_handle_t &step_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_path_name(const path_handle_t &path_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_previous_step(const step_handle_t &step_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_sequence(const handle_t &handle) const =0 | handlegraph::HandleGraph | pure virtual |
| get_step_count(const path_handle_t &path_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| get_step_count(const handle_t &handle) const | handlegraph::PathHandleGraph | 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_next_step(const step_handle_t &step_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| has_node(nid_t node_id) const =0 | handlegraph::HandleGraph | pure virtual |
| has_path(const std::string &path_name) const =0 | handlegraph::PathHandleGraph | pure virtual |
| has_previous_step(const step_handle_t &step_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| is_empty(const path_handle_t &path_handle) const | handlegraph::PathHandleGraph | virtual |
| max_node_id() const =0 | handlegraph::HandleGraph | pure virtual |
| min_node_id() const =0 | handlegraph::HandleGraph | pure virtual |
| path_back(const path_handle_t &path_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| path_begin(const path_handle_t &path_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| path_end(const path_handle_t &path_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| path_front_end(const path_handle_t &path_handle) const =0 | handlegraph::PathHandleGraph | pure virtual |
| scan_path(const path_handle_t &path) const | handlegraph::PathHandleGraph | |
| steps_of_handle(const handle_t &handle, bool match_orientation=false) const | handlegraph::PathHandleGraph | virtual |
| traverse_edge_handle(const edge_t &edge, const handle_t &left) const | handlegraph::HandleGraph | |
| ~HandleGraph()=default | handlegraph::HandleGraph | virtual |
| ~PathHandleGraph()=default | handlegraph::PathHandleGraph | virtual |
1.9.1