vg
tools for working with variation graphs
|
Public Member Functions | |
child_info_t (ZipCodeTree::tree_item_type_t type, size_t value) | |
Public Attributes | |
size_t | value |
std::pair< size_t, size_t > | distances |
size_t | chain_component: 26 |
ZipCodeTree::tree_item_type_t | type: 5 |
bool | is_reversed = false |
For children of snarls, we need to remember the siblings and start bound that came before them so we can record their distances This holds the indices (into zip_code_tree) of each seed or start of a chain, and each start and child chain start of a snarl For the children of a chain, the value is the prefix sum in the chain (relative to the orientation of the top-level chain, not necessarily the chain itself) For the children of a snarl, the value is the index of the CHAIN_START in zip_code_tree. The first seed in the chain will need to be found by looping through zip_code_tree
|
inline |
size_t vg::ZipCodeForest::child_info_t::chain_component |
std::pair<size_t, size_t> vg::ZipCodeForest::child_info_t::distances |
bool vg::ZipCodeForest::child_info_t::is_reversed = false |
ZipCodeTree::tree_item_type_t vg::ZipCodeForest::child_info_t::type |
size_t vg::ZipCodeForest::child_info_t::value |