fn find_edges(&self, node_id: usize, dir: Dir) -> SmallVec4<(usize, Dir, bool)> {
        let exts = self.base.exts[node_id];
        let sequence = self.base.sequences.get(node_id);
        let kmer: K = sequence.term_kmer(dir);
        let mut edges = SmallVec4::new();

        for i in 0..4 {
            if exts.has_ext(dir, i) {
                let link = self.find_link(kmer.extend(i, dir), dir); //.expect("missing link");
                match link {
                    Some(l) => edges.push(l),
                    // This edge doesn't exist within this shard, so ignore it.
                    // NOTE: this should be allowed in a 'complete' DBG
                    None => (),
                }
            }
        }

        edges
    }
/// Find the edges leaving node `node_id` in direction `Dir`. Should generally be
/// accessed via a Node wrapper object
Find the edges leaving node `node_id` in direction `Dir`. Should generally be
accessed via a Node wrapper object
Find the edges leaving node ` node_id ` in direction ` Dir ` . Should generally be accessed via a Node wrapper object
fn find_edges(&self, node_id: usize, dir: Dir) -> SmallVec4<(usize, Dir, bool)> {
        let exts = self.base.exts[node_id];
        let sequence = self.base.sequences.get(node_id);
        let kmer: K = sequence.term_kmer(dir);
        let mut edges = SmallVec4::new();
        for i in 0..4 {
            if exts.has_ext(dir, i) {
                let link = self.find_link(kmer.extend(i, dir), dir); //.expect("missing link");
                match link {
                    Some(l) => edges.push(l),
                    // This edge doesn't exist within this shard, so ignore it.
                    // NOTE: this should be allowed in a 'complete' DBG
                    None => (),
                }
            }
        }
        edges
    }
fn find_edges ( & self , node_id : usize , dir : Dir ) -> SmallVec4 < ( usize , Dir , bool ) > { let exts = self . base . exts [ node_id ] ; let sequence = self . base . sequences . get ( node_id ) ; let kmer : K = sequence . term_kmer ( dir ) ; let mut edges = SmallVec4 :: new ( ) ; for i in 0 .. 4 { if exts . has_ext ( dir , i ) { let link = self . find_link ( kmer . extend ( i , dir ) , dir ) ; //.expect("missing link"); match link { Some ( l ) => edges . push ( l ) , // This edge doesn't exist within this shard, so ignore it. // NOTE: this should be allowed in a 'complete' DBG None => ( ) , } } } edges }
Find the edges leaving node `node_id` in direction `Dir`.
Find the edges leaving node ` node_id ` in direction ` Dir ` .
&self
node_id
usize
dir
Dir
&self
node_id
usize
dir
Dir