|
vg
tools for working with variation graphs
|
Public Member Functions | |
| child_info_t (ZipCodeTree::tree_item_type_t type, size_t value) | |
| Constructor for type/value leaving all other fields as defaults. More... | |
Public Attributes | |
| size_t | value |
| std::pair< std::unordered_map< size_t, size_t >, size_t > | distances |
| size_t | chain_component: 26 |
| If the item is a child of a chain, its chain component. More... | |
| ZipCodeTree::tree_item_type_t | type: 5 |
| Current item type. More... | |
| 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 chain start, 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 orientation of the top-level chain, not the chain itself) For the children of a snarl, the value is the index of the CHAIN_START First seed in the chain must be found by looping through zip_code_tree
|
inline |
Constructor for type/value leaving all other fields as defaults.
| size_t vg::ZipCodeForest::child_info_t::chain_component |
If the item is a child of a chain, its chain component.
| std::pair<std::unordered_map<size_t, size_t>, size_t> vg::ZipCodeForest::child_info_t::distances |
For children of snarls, distance to the left and right of the chain that gets added to edges in the snarl The first item is a map of {seed index : distance}, in case the first seed gets snipped off The second item is the distance to the rightmost seed in the chain
| bool vg::ZipCodeForest::child_info_t::is_reversed = false |
Is the sibling reversed; only used for children of snarls, to indicate that the child is traversed backwards
| ZipCodeTree::tree_item_type_t vg::ZipCodeForest::child_info_t::type |
Current item type.
| size_t vg::ZipCodeForest::child_info_t::value |
A value associated with the item, offset in a chain or index of the snarl child start
1.8.17