handlegraph 0.6.0

Library for use in variation graphs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

/*!

`HashGraph` node definition and occurrence iterator

*/

use fnv::FnvHashMap;

use crate::handle::Handle;
use crate::pathhandlegraph::PathId;

use super::path::StepIx;

#[derive(Debug, Clone)]
pub struct Node {
    pub sequence: Vec<u8>,
    pub left_edges: Vec<Handle>,
    pub right_edges: Vec<Handle>,
    pub occurrences: FnvHashMap<PathId, usize>,
}

impl Node {
    pub fn new(sequence: &[u8]) -> Node {
        Node {
            sequence: sequence.into(),
            left_edges: vec![],
            right_edges: vec![],
            occurrences: FnvHashMap::default(),
        }
    }
}

/// Iterator on the path occurrences of a node
pub struct OccurIter<'a> {
    pub(super) iter: std::collections::hash_map::Iter<'a, PathId, usize>,
}

impl<'a> Iterator for OccurIter<'a> {
    type Item = (PathId, StepIx);

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        let (id, offset) = self.iter.next()?;
        Some((*id, StepIx::Step(*offset)))
    }
}