Public Member Functions
void	add (endpoint_t start, endpoint_t end)
	Add the traversal from one endpoint to another. More...

bool	contains (endpoint_t start, endpoint_t end) const

template<typename Iteratee >
bool	for_each (const Iteratee &iteratee) const

Detailed Description

A set of traversals of one net graph element, each named by the endpoints where it starts and ends.

Member Function Documentation

void vg::SnarlManagerDecomposition::TraversalSet::add	(	endpoint_t	start,
		endpoint_t	end
	)

Add the traversal from one endpoint to another.

bool vg::SnarlManagerDecomposition::TraversalSet::contains	(	endpoint_t	start,
		endpoint_t	end
	)		const

Return true if the set holds the traversal from one endpoint to another.

template<typename Iteratee >

bool vg::SnarlManagerDecomposition::TraversalSet::for_each ( const Iteratee & iteratee ) const

inline

Call a function on each traversal in the set, until it returns false.

Give the traversals ordered by start endpoint, then by end endpoint, each in the order START, END, TIP.

uint16_t vg::SnarlManagerDecomposition::TraversalSet::bits = 0

private

One bit for each traversal, at index 3 * start + end, where START, END and TIP are 0, 1 and 2.

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