| best_cyclic_snarl_exits | vg::ZipCodeTree::distance_iterator | private |
| continue_snarl() | vg::ZipCodeTree::distance_iterator | private |
| current_item() const | vg::ZipCodeTree::distance_iterator | inlineprivate |
| depth() const | vg::ZipCodeTree::distance_iterator | private |
| distance_iterator(size_t start_index, const vector< tree_item_t > &zip_code_tree, std::stack< size_t > chain_numbers=std::stack< size_t >(), bool right_to_left=true, size_t distance_limit=std::numeric_limits< size_t >::max()) | vg::ZipCodeTree::distance_iterator | |
| distance_iterator(const distance_iterator &other)=default | vg::ZipCodeTree::distance_iterator | |
| distance_iterator(distance_iterator &&other)=default | vg::ZipCodeTree::distance_iterator | |
| distance_limit | vg::ZipCodeTree::distance_iterator | private |
| done() const | vg::ZipCodeTree::distance_iterator | inline |
| dup() | vg::ZipCodeTree::distance_iterator | private |
| end_index | vg::ZipCodeTree::distance_iterator | private |
| entered_chain() const | vg::ZipCodeTree::distance_iterator | inlineprivate |
| entered_snarl() const | vg::ZipCodeTree::distance_iterator | inlineprivate |
| exited_chain() const | vg::ZipCodeTree::distance_iterator | inlineprivate |
| exited_snarl() const | vg::ZipCodeTree::distance_iterator | inlineprivate |
| get_cyclic_snarl_bound_distance(size_t snarl_start_i, size_t row, bool to_end) | vg::ZipCodeTree::distance_iterator | private |
| get_matrix_value(size_t matrix_start_i, bool has_main_diagonal, size_t row, size_t col) | vg::ZipCodeTree::distance_iterator | private |
| halt() | vg::ZipCodeTree::distance_iterator | private |
| initialize_chain() | vg::ZipCodeTree::distance_iterator | private |
| initialize_snarl(size_t chain_num) | vg::ZipCodeTree::distance_iterator | private |
| move_index() | vg::ZipCodeTree::distance_iterator | inline |
| operator!=(const distance_iterator &other) const | vg::ZipCodeTree::distance_iterator | inline |
| operator*() const | vg::ZipCodeTree::distance_iterator | |
| operator++() | vg::ZipCodeTree::distance_iterator | |
| operator=(const distance_iterator &other)=default | vg::ZipCodeTree::distance_iterator | |
| operator=(distance_iterator &&other)=default | vg::ZipCodeTree::distance_iterator | |
| operator==(const distance_iterator &other) const | vg::ZipCodeTree::distance_iterator | inline |
| original_index | vg::ZipCodeTree::distance_iterator | private |
| original_right_to_left | vg::ZipCodeTree::distance_iterator | private |
| pending_traversals | vg::ZipCodeTree::distance_iterator | private |
| pop() | vg::ZipCodeTree::distance_iterator | private |
| pos | vg::ZipCodeTree::distance_iterator | private |
| push(size_t value) | vg::ZipCodeTree::distance_iterator | private |
| S_SCAN_CHAIN enum value | vg::ZipCodeTree::distance_iterator | |
| S_SCAN_CYCLIC_SNARL enum value | vg::ZipCodeTree::distance_iterator | |
| S_SCAN_DAG_SNARL enum value | vg::ZipCodeTree::distance_iterator | |
| S_START enum value | vg::ZipCodeTree::distance_iterator | |
| save_opposite_cyclic_snarl_exit(size_t chain_num) | vg::ZipCodeTree::distance_iterator | private |
| skip_chain() | vg::ZipCodeTree::distance_iterator | private |
| stack_below_top(size_t value) | vg::ZipCodeTree::distance_iterator | private |
| stack_matrix_value(size_t matrix_start_i, bool has_main_diagonal, size_t row, size_t col) | vg::ZipCodeTree::distance_iterator | private |
| stack_snarl_distances(size_t snarl_start_i, size_t chain_num, bool right_side) | vg::ZipCodeTree::distance_iterator | private |
| State enum name | vg::ZipCodeTree::distance_iterator | |
| swap() | vg::ZipCodeTree::distance_iterator | private |
| tick() | vg::ZipCodeTree::distance_iterator | private |
| top() | vg::ZipCodeTree::distance_iterator | private |
| unimplemented_error() | vg::ZipCodeTree::distance_iterator | private |
| use_saved_traversal() | vg::ZipCodeTree::distance_iterator | private |
| zip_code_tree | vg::ZipCodeTree::distance_iterator | private |
