vg
tools for working with variation graphs
|
#include <zip_code.hpp>
Public Types | |
typedef std::uint64_t | code_type |
Public Attributes | |
net_handle_t | node_handle |
net_handle_t | parent_handle |
size_t | node_length = std::numeric_limits<size_t>::max() |
size_t | prefix_sum = 0 |
size_t | chain_component = 0 |
size_t | parent_depth = 0 |
size_t | parent_record_offset = 0 |
ZipCode::code_type_t | parent_type = ZipCode::EMPTY |
bool | is_reversed = false |
bool | is_trivial_chain = false |
bool | parent_is_chain = false |
bool | parent_is_root = false |
Static Public Attributes | |
constexpr static gbwtgraph::Payload | NO_CODE = {0, 0} |
constexpr static std::size_t | NO_VALUE = std::numeric_limits<size_t>::max() |
The payload for the minimizer index. This stores distance information that gets used in clustering The payload now uses zip codes, so this gets used to go from a zip code to distance information usable by the clusterer
typedef std::uint64_t vg::MIPayload::code_type |
size_t vg::MIPayload::chain_component = 0 |
bool vg::MIPayload::is_reversed = false |
bool vg::MIPayload::is_trivial_chain = false |
|
staticconstexpr |
|
staticconstexpr |
net_handle_t vg::MIPayload::node_handle |
size_t vg::MIPayload::node_length = std::numeric_limits<size_t>::max() |
size_t vg::MIPayload::parent_depth = 0 |
net_handle_t vg::MIPayload::parent_handle |
bool vg::MIPayload::parent_is_chain = false |
bool vg::MIPayload::parent_is_root = false |
size_t vg::MIPayload::parent_record_offset = 0 |
ZipCode::code_type_t vg::MIPayload::parent_type = ZipCode::EMPTY |
size_t vg::MIPayload::prefix_sum = 0 |