vg
tools for working with variation graphs
|
#include <cstdint>
#include <utility>
#include <functional>
#include <limits>
Classes | |
struct | handlegraph::handle_t |
Represents the internal id of a node traversal. More... | |
struct | handlegraph::path_handle_t |
Represents the internal id of a path entity. More... | |
struct | handlegraph::step_handle_t |
A step handle is an opaque reference to a single step of an oriented node on a path in a graph. More... | |
struct | std::hash< handlegraph::handle_t > |
struct | std::hash< handlegraph::path_handle_t > |
struct | std::hash< handlegraph::step_handle_t > |
Namespaces | |
handlegraph | |
std | |
Hash functor to hash NodeSide s using std::hash. | |
Typedefs | |
typedef long long int | handlegraph::nid_t |
typedef nid_t | handlegraph::id_t |
typedef std::size_t | handlegraph::off_t |
Represents an offset. More... | |
typedef std::tuple< nid_t, bool, off_t > | handlegraph::pos_t |
Represents a position. More... | |
typedef std::pair< handle_t, handle_t > | handlegraph::edge_t |
Represents an edge in terms of its endpoints. More... | |
Functions | |
bool | handlegraph::operator== (const handle_t &a, const handle_t &b) |
Define equality on handles. More... | |
bool | handlegraph::operator!= (const handle_t &a, const handle_t &b) |
Define inequality on handles. More... | |
bool | handlegraph::operator== (const path_handle_t &a, const path_handle_t &b) |
Define equality on path handles. More... | |
bool | handlegraph::operator!= (const path_handle_t &a, const path_handle_t &b) |
Define inequality on path handles. More... | |
bool | handlegraph::operator== (const step_handle_t &a, const step_handle_t &b) |
Define equality on step handles. More... | |
bool | handlegraph::operator!= (const step_handle_t &a, const step_handle_t &b) |
Define inequality on step handles. More... | |
Defines the types used for handles, and user-facing operators to work with them.