#include <reverse_graph.hpp>

Inheritance diagram for vg::ReverseGraph:

Public Member Functions
	ReverseGraph (const HandleGraph *forward_graph, bool complement)

	ReverseGraph ()=default
	Default constructor – not actually functional. More...

	~ReverseGraph ()=default
	Default destructor. More...

virtual bool	has_node (id_t node_id) const
	HandleGraph interface. More...

virtual handle_t	get_handle (const id_t &node_id, bool is_reverse=false) const
	Look up the handle for the node with the given ID in the given orientation. More...

virtual id_t	get_id (const handle_t &handle) const
	Get the ID from a handle. More...

virtual bool	get_is_reverse (const handle_t &handle) const
	Get the orientation of a handle. More...

virtual handle_t	flip (const handle_t &handle) const
	Invert the orientation of a handle (potentially without getting its ID) More...

virtual size_t	get_length (const handle_t &handle) const
	Get the length of a node. More...

virtual string	get_sequence (const handle_t &handle) const

virtual bool	follow_edges_impl (const handle_t &handle, bool go_left, const function< bool(const handle_t &)> &iteratee) const

virtual bool	for_each_handle_impl (const function< bool(const handle_t &)> &iteratee, bool parallel=false) const

virtual size_t	get_node_count () const
	Return the number of nodes in the graph. More...

virtual id_t	min_node_id () const

virtual id_t	max_node_id () const

handle_t	from_backing (const handle_t &backing_handle) const
	(Future) Overlay Interface More...

Public Member Functions inherited from handlegraph::ExpandingOverlayGraph
virtual	~ExpandingOverlayGraph ()=default

Public Member Functions inherited from handlegraph::HandleGraph
virtual	~HandleGraph ()=default

template<typename Iteratee >
bool	follow_edges (const handle_t &handle, bool go_left, const Iteratee &iteratee) const

template<typename Iteratee >
bool	for_each_handle (const Iteratee &iteratee, bool parallel=false) const

virtual size_t	get_degree (const handle_t &handle, bool go_left) const

virtual bool	has_edge (const handle_t &left, const handle_t &right) const

bool	has_edge (const edge_t &edge) const
	Convenient wrapper of has_edge for edge_t argument. More...

virtual size_t	get_edge_count () const

virtual size_t	get_total_length () const

virtual char	get_base (const handle_t &handle, size_t index) const

virtual std::string	get_subsequence (const handle_t &handle, size_t index, size_t size) const

handle_t	forward (const handle_t &handle) const
	Get the locally forward version of a handle. More...

edge_t	edge_handle (const handle_t &left, const handle_t &right) const

handle_t	traverse_edge_handle (const edge_t &edge, const handle_t &left) const

template<typename Iteratee >
bool	for_each_edge (const Iteratee &iteratee, bool parallel=false) const

Protected Member Functions
virtual handle_t	get_underlying_handle (const handle_t &handle) const
	ExpandingOverlayGraph interface. More...

Protected Member Functions inherited from handlegraph::HandleGraph
virtual bool	follow_edges_impl (const handle_t &handle, bool go_left, const std::function< bool(const handle_t &)> &iteratee) const =0

virtual bool	for_each_handle_impl (const std::function< bool(const handle_t &)> &iteratee, bool parallel=false) const =0

Protected Attributes
const HandleGraph *	forward_graph = nullptr
	The forward version of the graph we're making backwards. More...

bool	complement = false
	Complement the sequences? More...

Detailed Description

A HandleGraph implementation that wraps some other handle graph and reverses and optionally complements the sequences.

Constructor & Destructor Documentation

◆ ReverseGraph() [1/2]

vg::ReverseGraph::ReverseGraph	(	const HandleGraph *	forward_graph,
		bool	complement
	)

Initialize as the reverse version of another graph, optionally also complementing

◆ ReverseGraph() [2/2]

vg::ReverseGraph::ReverseGraph ( )

default

Default constructor – not actually functional.

◆ ~ReverseGraph()

vg::ReverseGraph::~ReverseGraph ( )

default

Default destructor.

Member Function Documentation

◆ flip()

handle_t vg::ReverseGraph::flip ( const handle_t & handle ) const

virtual

Invert the orientation of a handle (potentially without getting its ID)

Implements handlegraph::HandleGraph.

◆ follow_edges_impl()

bool vg::ReverseGraph::follow_edges_impl	(	const handle_t &	handle,
		bool	go_left,
		const function< bool(const handle_t &)> &	iteratee
	)		const

virtual

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.

◆ for_each_handle_impl()

bool vg::ReverseGraph::for_each_handle_impl	(	const function< bool(const handle_t &)> &	iteratee,
		bool	parallel = `false`
	)		const

virtual

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.

◆ from_backing()

handle_t vg::ReverseGraph::from_backing ( const handle_t & backing_handle ) const

inline

(Future) Overlay Interface

Convert a backing graph handle to our handle to the same node

◆ get_handle()

handle_t vg::ReverseGraph::get_handle	(	const id_t &	node_id,
		bool	is_reverse = `false`
	)		const

virtual

Look up the handle for the node with the given ID in the given orientation.

Implements handlegraph::HandleGraph.

◆ get_id()

id_t vg::ReverseGraph::get_id ( const handle_t & handle ) const

virtual

Get the ID from a handle.

Implements handlegraph::HandleGraph.

◆ get_is_reverse()

bool vg::ReverseGraph::get_is_reverse ( const handle_t & handle ) const

virtual

Get the orientation of a handle.

Implements handlegraph::HandleGraph.

◆ get_length()

size_t vg::ReverseGraph::get_length ( const handle_t & handle ) const

virtual

Get the length of a node.

Implements handlegraph::HandleGraph.

◆ get_node_count()

size_t vg::ReverseGraph::get_node_count ( ) const

virtual

Return the number of nodes in the graph.

Implements handlegraph::HandleGraph.

◆ get_sequence()

string vg::ReverseGraph::get_sequence ( const handle_t & handle ) const

virtual

Get the sequence of a node, presented in the handle's local forward orientation.

Implements handlegraph::HandleGraph.

◆ get_underlying_handle()

handle_t vg::ReverseGraph::get_underlying_handle ( const handle_t & handle ) const

protectedvirtual

ExpandingOverlayGraph interface.

Returns the handle in the underlying graph that corresponds to a handle in the overlay

Implements handlegraph::ExpandingOverlayGraph.

◆ has_node()

bool vg::ReverseGraph::has_node ( id_t node_id ) const

virtual

HandleGraph interface.

Implements handlegraph::HandleGraph.

◆ max_node_id()

id_t vg::ReverseGraph::max_node_id ( ) const

virtual

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.

Implements handlegraph::HandleGraph.

◆ min_node_id()

id_t vg::ReverseGraph::min_node_id ( ) const

virtual

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.

Implements handlegraph::HandleGraph.

Member Data Documentation

◆ complement

bool vg::ReverseGraph::complement = false

protected

Complement the sequences?

◆ forward_graph

const HandleGraph* vg::ReverseGraph::forward_graph = nullptr

protected

The forward version of the graph we're making backwards.

The documentation for this class was generated from the following files:

src/reverse_graph.hpp
src/reverse_graph.cpp

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

◆ ReverseGraph() [1/2]

◆ ReverseGraph() [2/2]

◆ ~ReverseGraph()

Member Function Documentation

◆ flip()

◆ follow_edges_impl()

◆ for_each_handle_impl()

◆ from_backing()

◆ get_handle()

◆ get_id()

◆ get_is_reverse()

◆ get_length()

◆ get_node_count()

◆ get_sequence()

◆ get_underlying_handle()

◆ has_node()

◆ max_node_id()

◆ min_node_id()

Member Data Documentation

◆ complement

◆ forward_graph