|
vg
tools for working with variation graphs
|
This is the complete list of members for vg::Paths, including all inherited members.
| _paths | vg::Paths | |
| all_path_names(void) | vg::Paths | |
| append(const Paths &paths, bool warn_on_duplicates=false, bool rebuild_indexes=true) | vg::Paths | |
| append(const Graph &g, bool warn_on_duplicates=false, bool rebuild_indexes=true) | vg::Paths | |
| append_mapping(const string &name, const mapping_t &m, bool warn_on_duplicates=false) | vg::Paths | |
| append_mapping(const string &name, id_t id, bool is_reverse, size_t length, size_t rank=0, bool warn_on_duplicates=false) | vg::Paths | |
| are_consecutive_nodes_in_path(id_t id1, id_t id2, const string &path_name) | vg::Paths | |
| circular | vg::Paths | |
| clear(void) | vg::Paths | |
| clear_mapping_ranks(void) | vg::Paths | |
| compact_ranks(void) | vg::Paths | |
| create_path(const string &name) | vg::Paths | |
| divide_mapping(mapping_t *m, const Position &pos) | vg::Paths | |
| divide_mapping(mapping_t *m, size_t offset) | vg::Paths | |
| empty(void) const | vg::Paths | |
| extend(const Paths &paths, bool warn_on_duplicates=false, bool rebuild_indexes=true) | vg::Paths | |
| extend(const Path &p, bool warn_on_duplicates=false, bool rebuild_indexes=true) | vg::Paths | |
| extend(const vector< Path > &paths, bool warn_on_duplicates=false, bool rebuild_indexes=true) | vg::Paths | |
| find_mapping(mapping_t *m) | vg::Paths | |
| for_each(const function< void(const Path &)> &lambda) | vg::Paths | |
| for_each_mapping(const function< void(mapping_t &)> &lambda) | vg::Paths | |
| for_each_name(const function< void(const string &)> &lambda) const | vg::Paths | |
| for_each_name_stoppable(const function< bool(const string &)> &lambda) const | vg::Paths | |
| for_each_stream(istream &in, const function< void(Path &)> &lambda) | vg::Paths | |
| get_create_path(const string &name) | vg::Paths | |
| get_next_rank(const string &name) | vg::Paths | |
| get_node_mapping(Node *n) | vg::Paths | |
| get_node_mapping(id_t id) | vg::Paths | |
| get_node_mapping(id_t id) const | vg::Paths | |
| get_node_mapping_by_path_name(Node *n) | vg::Paths | |
| get_node_mapping_by_path_name(id_t id) | vg::Paths | |
| get_node_mapping_copies_by_rank(id_t id) | vg::Paths | |
| get_node_mappings_by_rank(id_t id) | vg::Paths | |
| get_path(const string &name) | vg::Paths | |
| get_path_id(const string &name) const | vg::Paths | |
| get_path_name(int64_t id) const | vg::Paths | |
| has_mapping(const string &name, int32_t rank) | vg::Paths | |
| has_node_mapping(id_t id) const | vg::Paths | |
| has_node_mapping(Node *n) const | vg::Paths | |
| has_path(const string &name) const | vg::Paths | |
| head_tail_nodes | vg::Paths | |
| id_to_name | vg::Paths | mutableprivate |
| increment_node_ids(id_t inc) | vg::Paths | |
| insert_mapping(list< mapping_t >::iterator w, const string &path_name, const mapping_t &m) | vg::Paths | |
| is_alt | vg::Paths | static |
| is_head_or_tail_node(id_t) | vg::Paths | |
| keep_paths(const set< string > &name) | vg::Paths | |
| load(istream &in) | vg::Paths | |
| make_circular(const string &name) | vg::Paths | |
| make_linear(const string &name) | vg::Paths | |
| mapping_itr | vg::Paths | |
| mapping_path_id(mapping_t *m) | vg::Paths | |
| mapping_path_name(mapping_t *m) | vg::Paths | |
| mappings_by_rank | vg::Paths | |
| max_path_id | vg::Paths | mutableprivate |
| name_to_id | vg::Paths | mutableprivate |
| node_mapping | vg::Paths | |
| node_path_traversal_counts(id_t id, bool rev=false) | vg::Paths | |
| node_path_traversals(id_t id, bool rev=false) | vg::Paths | |
| of_node(id_t id) | vg::Paths | |
| operator=(const Paths &other) | vg::Paths | inline |
| operator=(Paths &&other) noexcept | vg::Paths | inline |
| over_directed_edge(id_t id1, bool rev1, id_t id2, bool rev2, vector< string > following) | vg::Paths | |
| over_edge(id_t id1, bool rev1, id_t id2, bool rev2, vector< string > following) | vg::Paths | |
| path(const string &name) | vg::Paths | |
| Paths(void) | vg::Paths | |
| Paths(const Paths &other) | vg::Paths | inline |
| Paths(Paths &&other) noexcept | vg::Paths | inline |
| prepend_mapping(const string &name, const Mapping &m, bool warn_on_duplicates=false) | vg::Paths | |
| prepend_mapping(const string &name, id_t id, bool is_reverse, size_t length, size_t rank=0, bool warn_on_duplicates=false) | vg::Paths | |
| reassign_node(id_t new_id, mapping_t *m) | vg::Paths | |
| rebuild_mapping_aux(void) | vg::Paths | |
| rebuild_node_mapping(void) | vg::Paths | |
| remove_mapping(mapping_t *m) | vg::Paths | |
| remove_node(id_t id) | vg::Paths | |
| remove_path(const string &name) | vg::Paths | |
| remove_paths(const set< string > &names) | vg::Paths | |
| replace_mapping(mapping_t *m, pair< mapping_t, mapping_t > n) | vg::Paths | |
| size(void) const | vg::Paths | |
| sort_by_mapping_rank(void) | vg::Paths | |
| strip_subrange(const string &path_name, subrange_t *subrange=nullptr) | vg::Paths | static |
| swap_node_ids(const std::function< nid_t(const nid_t &)> &get_new_id) | vg::Paths | |
| swap_node_ids(hash_map< id_t, id_t > &id_mapping) | vg::Paths | |
| to_graph(Graph &g) | vg::Paths | |
| to_json(ostream &out) | vg::Paths | |
| traverse_left(mapping_t *mapping) | vg::Paths | |
| traverse_right(mapping_t *mapping) | vg::Paths | |
| write(ostream &out) | vg::Paths |
1.8.17