|
vg
tools for working with variation graphs
|
This is the complete list of members for vg::ZipCodeTree, including all inherited members.
| add_close_bound(size_t start_index) | vg::ZipCodeTree | |
| begin() const | vg::ZipCodeTree | inline |
| CHAIN_COUNT enum value | vg::ZipCodeTree | |
| CHAIN_END enum value | vg::ZipCodeTree | |
| CHAIN_START enum value | vg::ZipCodeTree | |
| dag_and_cyclic_snarl_count() const | vg::ZipCodeTree | |
| EDGE enum value | vg::ZipCodeTree | |
| end() const | vg::ZipCodeTree | inline |
| find_distances(const seed_iterator &from, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeTree | |
| get_all_seeds() const | vg::ZipCodeTree | inline |
| get_item_at_index(size_t index) const | vg::ZipCodeTree | inline |
| get_offset_to_seed(size_t &i, bool right_to_left) const | vg::ZipCodeTree | |
| get_tree_size() const | vg::ZipCodeTree | inline |
| node_is_invalid(nid_t id, const SnarlDistanceIndex &distance_index, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeTree | |
| print_self(const vector< Seed > *seeds) const | vg::ZipCodeTree | |
| Seed typedef | vg::ZipCodeTree | private |
| SEED enum value | vg::ZipCodeTree | |
| seed_is_reversed_at_depth(const Seed &seed, size_t depth, const SnarlDistanceIndex &distance_index) | vg::ZipCodeTree | protectedstatic |
| SNARL_END enum value | vg::ZipCodeTree | |
| SNARL_START enum value | vg::ZipCodeTree | |
| tree_item_type_t enum name | vg::ZipCodeTree | |
| validate_boundaries(const SnarlDistanceIndex &distance_index, const vector< Seed > *seeds, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeTree | |
| validate_chain(std::vector< tree_item_t >::const_iterator &zip_iterator, const SnarlDistanceIndex &distance_index, const vector< Seed > *seeds, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeTree | |
| validate_seed_distances(const SnarlDistanceIndex &distance_index, const vector< Seed > *seeds, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeTree | |
| validate_snarl(std::vector< tree_item_t >::const_iterator &zip_iterator, const SnarlDistanceIndex &distance_index, const vector< Seed > *seeds, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeTree | |
| validate_zip_tree(const SnarlDistanceIndex &distance_index, const vector< Seed > *seeds, size_t distance_limit=std::numeric_limits< size_t >::max()) const | vg::ZipCodeTree | |
| validate_zip_tree_order(const SnarlDistanceIndex &distance_index, const vector< Seed > *seeds) const | vg::ZipCodeTree | |
| zip_code_tree | vg::ZipCodeTree | protected |
| ZipCodeForest class | vg::ZipCodeTree | friend |
| ZipCodeTree() | vg::ZipCodeTree | inline |
1.8.17