|
vg
tools for working with variation graphs
|
This is the complete list of members for vg::ZipCodeForest, including all inherited members.
| add_child_to_chain(forest_growing_state_t &forest_state, const size_t &depth, const size_t &seed_index, bool child_is_reversed, bool chain_is_reversed) | vg::ZipCodeForest | private |
| add_distance_matrix(forest_growing_state_t &forest_state, const size_t &depth, bool snarl_is_reversed) | vg::ZipCodeForest | private |
| add_edges_for_chains(vector< tree_item_t > &dist_matrix, forest_growing_state_t &forest_state, const size_t &depth, const vector< seed_info_t > &edge_seeds, bool snarl_is_reversed, bool is_cyclic_snarl) const | vg::ZipCodeForest | private |
| add_edges_to_end(vector< tree_item_t > &dist_matrix, forest_growing_state_t &forest_state, const size_t &depth, const vector< seed_info_t > &edge_seeds, bool snarl_is_reversed, bool is_cyclic_snarl) const | vg::ZipCodeForest | private |
| close_chain(forest_growing_state_t &forest_state, const size_t &depth, const Seed &last_seed, bool chain_is_reversed) | vg::ZipCodeForest | private |
| close_snarl(forest_growing_state_t &forest_state, const size_t &depth, const Seed &last_seed, bool last_is_reversed) | vg::ZipCodeForest | private |
| default_sort_zipcodes(vector< size_t > &zipcode_sort_order, const vector< sort_value_t > &sort_values_by_seed, const interval_state_t &interval, bool reverse_order) const | vg::ZipCodeForest | private |
| fill_in_forest(const vector< Seed > &seeds, const SnarlDistanceIndex &distance_index, size_t distance_limit=std::numeric_limits< size_t >::max()) | vg::ZipCodeForest | |
| get_edge_seeds(const forest_growing_state_t &forest_state, const size_t &depth) const | vg::ZipCodeForest | private |
| get_next_intervals(forest_growing_state_t &forest_state, const interval_state_t &interval, std::forward_list< interval_state_t > &next_intervals) const | vg::ZipCodeForest | private |
| move_slice(forest_growing_state_t &forest_state, const size_t &depth) | vg::ZipCodeForest | private |
| open_chain(forest_growing_state_t &forest_state, const interval_state_t &interval) | vg::ZipCodeForest | private |
| open_snarl(forest_growing_state_t &forest_state, const size_t &depth, bool is_cyclic_snarl) | vg::ZipCodeForest | private |
| print_self(const vector< Seed > *seeds) const | vg::ZipCodeForest | inline |
| radix_sort_zipcodes(vector< size_t > &zipcode_sort_order, const vector< sort_value_t > &sort_values_by_seed, const interval_state_t &interval, bool reverse_order, size_t min_value, size_t max_value, bool sort_by_chain_component=false) const | vg::ZipCodeForest | private |
| Seed typedef | vg::ZipCodeForest | private |
| sort_one_interval(forest_growing_state_t &forest_state, const interval_state_t &interval) const | vg::ZipCodeForest | private |
| tree_item_t typedef | vg::ZipCodeForest | private |
| tree_item_type_t typedef | vg::ZipCodeForest | private |
| trees | vg::ZipCodeForest | |
| validate_zip_forest(const SnarlDistanceIndex &distance_index, const vector< Seed > *seeds, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeForest | |
| ZipCodeForest() | vg::ZipCodeForest | inline |
1.8.17