pub struct Gfa<T: OptFields> {
pub header: Header,
pub segments: Vec<Segment<T>>,
pub paths: Vec<Path>,
pub links: Option<Vec<Link<T>>>,
pub containments: Vec<Containment<T>>,
pub walk: Vec<Walk>,
pub jumps: Vec<Jump<T>>,
pub edges: Vec<Edges<T>>,
pub fragments: Vec<Fragment<T>>,
pub groups: Vec<Group>,
pub gaps: Vec<Gap<T>>,
pub string2index: HashMap<String, usize>,
}Expand description
A representation of a GFA file (v1 + v2)
GFA v1 + 1.1/1.2 + v2
Comment: This implementation should be able to parse any kind of GFA file, but has increased memory consumption, since most node ids are stored at Strings which are a minimum of 24 bytes. This is only maintained, since it is not of further use in any of my projects.
Fields§
§header: Header§segments: Vec<Segment<T>>§paths: Vec<Path>§links: Option<Vec<Link<T>>>§containments: Vec<Containment<T>>§walk: Vec<Walk>§jumps: Vec<Jump<T>>§edges: Vec<Edges<T>>§fragments: Vec<Fragment<T>>§groups: Vec<Group>§gaps: Vec<Gap<T>>§string2index: HashMap<String, usize>Implementations§
Source§impl<T: OptFields> Gfa<T>
impl<T: OptFields> Gfa<T>
Sourcepub fn check_nc(&mut self) -> Option<Vec<usize>>
pub fn check_nc(&mut self) -> Option<Vec<usize>>
Check if the nodes in the graph are
- Nodes are present
- Numeric
- Compact
- Start at 1
Returns:
- Option<Vec
Sourcepub fn parse_gfa_file(&mut self, file_name: &str, edges: bool)
pub fn parse_gfa_file(&mut self, file_name: &str, edges: bool)
pub fn convert_to_ncgraph(&self, graph: &Gfa<T>) -> NCGfa<T>
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for Gfa<T>
impl<T> RefUnwindSafe for Gfa<T>where
T: RefUnwindSafe,
impl<T> Send for Gfa<T>where
T: Send,
impl<T> Sync for Gfa<T>where
T: Sync,
impl<T> Unpin for Gfa<T>where
T: Unpin,
impl<T> UnwindSafe for Gfa<T>where
T: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more