|
vg
tools for working with variation graphs
|
#include <subpath_overlay.hpp>
Public Member Functions | |
| SubpathOverlay (const PathHandleGraph *backing, const step_handle_t &begin, const step_handle_t &end) | |
| SubpathOverlay ()=default | |
| ~SubpathOverlay ()=default | |
| bool | has_node (nid_t node_id) const |
| Method to check if a node exists by ID. | |
| handle_t | get_handle (const nid_t &node_id, bool is_reverse=false) const |
| Look up the handle for the node with the given ID in the given orientation. | |
| nid_t | get_id (const handle_t &handle) const |
| Get the ID from a handle. | |
| bool | get_is_reverse (const handle_t &handle) const |
| Get the orientation of a handle. | |
| handle_t | flip (const handle_t &handle) const |
| Invert the orientation of a handle (potentially without getting its ID). | |
| size_t | get_length (const handle_t &handle) const |
| Get the length of a node. | |
| std::string | get_sequence (const handle_t &handle) const |
| size_t | get_node_count () const |
| Return the number of nodes in the graph. | |
| nid_t | min_node_id () const |
| nid_t | max_node_id () const |
| handle_t | get_underlying_handle (const handle_t &handle) const |
| ExpandingOverlayGraph interface. | |
Protected Member Functions | |
| bool | follow_edges_impl (const handle_t &handle, bool go_left, const std::function< bool(const handle_t &)> &iteratee) const |
| bool | for_each_handle_impl (const std::function< bool(const handle_t &)> &iteratee, bool parallel=false) const |
Protected Attributes | |
| const HandleGraph * | backing_graph = nullptr |
| the backing graph | |
| std::vector< handle_t > | subpath_handles |
Overlay that presents a linear graph corresponding to a subinterval of a path
| vg::SubpathOverlay::SubpathOverlay | ( | const PathHandleGraph * | backing, |
| const step_handle_t & | begin, | ||
| const step_handle_t & | end ) |
Construct new SubpathOverlay between two steps. The 'end' step is past-the-last.
|
default |
|
default |
Invert the orientation of a handle (potentially without getting its ID).
|
protected |
Loop over all the handles to next/previous (right/left) nodes. Passes them to a callback which returns false to stop iterating and true to continue. Returns true if we finished and false if we stopped early.
|
protected |
Loop over all the nodes in the graph in their local forward orientations, in their internal stored order. Stop if the iteratee returns false. Can be told to run in parallel, in which case stopping after a false return value is on a best-effort basis and iteration order is not defined. Returns true if we finished and false if we stopped early.
Look up the handle for the node with the given ID in the given orientation.
| bool vg::SubpathOverlay::get_is_reverse | ( | const handle_t & | handle | ) | const |
Get the orientation of a handle.
| size_t vg::SubpathOverlay::get_length | ( | const handle_t & | handle | ) | const |
Get the length of a node.
| size_t vg::SubpathOverlay::get_node_count | ( | ) | const |
Return the number of nodes in the graph.
| std::string vg::SubpathOverlay::get_sequence | ( | const handle_t & | handle | ) | const |
Get the sequence of a node, presented in the handle's local forward orientation.
ExpandingOverlayGraph interface.
Returns the handle in the underlying graph that corresponds to a handle in the overlay
| bool vg::SubpathOverlay::has_node | ( | nid_t | node_id | ) | const |
Method to check if a node exists by ID.
| nid_t vg::SubpathOverlay::max_node_id | ( | ) | const |
Return the largest ID in the graph, or some larger number if the largest ID is unavailable. Return value is unspecified if the graph is empty.
| nid_t vg::SubpathOverlay::min_node_id | ( | ) | const |
Return the smallest ID in the graph, or some smaller number if the smallest ID is unavailable. Return value is unspecified if the graph is empty.
|
protected |
the backing graph
|
protected |
1.17.0