|
vg
tools for working with variation graphs
|
Public Member Functions | |
| iteration_position (size_t index, bool right_to_left, std::stack< size_t > stack_data, std::stack< size_t > chain_numbers, State state) | |
| Default constructor. More... | |
| iteration_position (const iteration_position &other)=default | |
| iteration_position (iteration_position &&other)=default | |
| iteration_position & | operator= (const iteration_position &other)=default |
| iteration_position & | operator= (iteration_position &&other)=default |
Public Attributes | |
| size_t | index |
| Where we are in the stored tree. More... | |
| bool | right_to_left |
| Whether we are looking right to left (true) or left to right (false) More... | |
| std::stack< size_t > | stack_data |
| Stack for computing distances. More... | |
| std::stack< size_t > | chain_numbers |
| Within each parent snarl, which chain are we in? More... | |
| State | state |
| What state the automaton is in. More... | |
A specific snapshot of the iterator's position which includes necessary state information (e.g. stack)
|
inline |
Default constructor.
|
default |
|
default |
|
default |
|
default |
| std::stack<size_t> vg::ZipCodeTree::distance_iterator::iteration_position::chain_numbers |
Within each parent snarl, which chain are we in?
| size_t vg::ZipCodeTree::distance_iterator::iteration_position::index |
Where we are in the stored tree.
| bool vg::ZipCodeTree::distance_iterator::iteration_position::right_to_left |
Whether we are looking right to left (true) or left to right (false)
| std::stack<size_t> vg::ZipCodeTree::distance_iterator::iteration_position::stack_data |
Stack for computing distances.
| State vg::ZipCodeTree::distance_iterator::iteration_position::state |
What state the automaton is in.
1.8.17