|
vg
tools for working with variation graphs
|
Public Member Functions | |
| size_t | node_count () const |
| void | expand_rule (uint32_t rule_id, bool reverse, uint32_t max_id, vector< NodeId > &out) const |
| vector< NodeId > | decode_sequence_at_index (size_t index, int delta_round) const |
| void | for_each_rgfa_visit (int64_t max_rgfa_rank, const function< void(nid_t, int64_t, size_t, const string &, int64_t)> &callback) const |
Public Attributes | |
| vector< size_t > | node_lengths |
| vector< OptionalFieldColumn > | segment_optional_fields |
| std::pair< vector< int32_t >, vector< int32_t > > | rules |
| vector< int32_t > | paths_flat |
| vector< int32_t > | walks_flat |
| SequenceOffsets | path_offsets |
| SequenceOffsets | walk_offsets |
| SequenceOffsets | original_path_offsets |
| SequenceOffsets | original_walk_offsets |
| vector< string > | path_names |
| vector< string > | walk_sample_ids |
| vector< uint32_t > | walk_hap_indices |
| vector< string > | walk_seq_ids |
| vector< int64_t > | walk_seq_starts |
| vector< int64_t > | walk_seq_ends |
| uint32_t | min_rule_id = 0 |
Class which manages decoding GFAz path information.
Contains information needed to generate the rGFA visits (which includes node length information and tags), and information used to store and decode the path compression rules.
Also used to hold that information during the main decode process. TODO: Split that responsibility out?
| vector< NodeId > vg::algorithms::GFAzPathDecoder::decode_sequence_at_index | ( | size_t | index, |
| int | delta_round | ||
| ) | const |
Decode a sequence of visited node IDs.
| void vg::algorithms::GFAzPathDecoder::expand_rule | ( | uint32_t | rule_id, |
| bool | reverse, | ||
| uint32_t | max_id, | ||
| vector< NodeId > & | out | ||
| ) | const |
Expand a rule for encoded visited node IDs.
| void vg::algorithms::GFAzPathDecoder::for_each_rgfa_visit | ( | int64_t | max_rgfa_rank, |
| const function< void(nid_t, int64_t, size_t, const string &, int64_t)> & | callback | ||
| ) | const |
Call the callback with rGFA path visits, in order along each path, for rGFA paths a the given rank and below.
This represents a visit along an rGFA path, so they can be sorted by offset.
This represents an rGFA path.
Rank of the rGFA path, or -1 for unset.
|
inline |
Get the number of nodes in the graph.
| uint32_t vg::algorithms::GFAzPathDecoder::min_rule_id = 0 |
| vector<size_t> vg::algorithms::GFAzPathDecoder::node_lengths |
Holds the length of each graph node, by 1-based ID. TODO: This wastes space at index 0.
| SequenceOffsets vg::algorithms::GFAzPathDecoder::original_path_offsets |
| SequenceOffsets vg::algorithms::GFAzPathDecoder::original_walk_offsets |
| vector<string> vg::algorithms::GFAzPathDecoder::path_names |
| SequenceOffsets vg::algorithms::GFAzPathDecoder::path_offsets |
| vector<int32_t> vg::algorithms::GFAzPathDecoder::paths_flat |
| std::pair<vector<int32_t>, vector<int32_t> > vg::algorithms::GFAzPathDecoder::rules |
| vector<OptionalFieldColumn> vg::algorithms::GFAzPathDecoder::segment_optional_fields |
| vector<uint32_t> vg::algorithms::GFAzPathDecoder::walk_hap_indices |
| SequenceOffsets vg::algorithms::GFAzPathDecoder::walk_offsets |
| vector<string> vg::algorithms::GFAzPathDecoder::walk_sample_ids |
| vector<int64_t> vg::algorithms::GFAzPathDecoder::walk_seq_ends |
| vector<string> vg::algorithms::GFAzPathDecoder::walk_seq_ids |
| vector<int64_t> vg::algorithms::GFAzPathDecoder::walk_seq_starts |
| vector<int32_t> vg::algorithms::GFAzPathDecoder::walks_flat |
1.9.1