fn nth(&mut self, n: usize) -> Option<Self::Item> {
        if n <= 4 {
            // for small skips forward, shift one base at a time
            for _ in 0..n {
                self.next();
            }
        } else {
            self.kmer_id += n;
            self.kmer = self.node_seq_slice.get_kmer::<K>(self.kmer_id);
        }

        self.next()
    }
/// Provide a 'fast-forward' capability for this iterator
/// MPHF will use this to reduce the number of kmers that
/// need to be produced.
Provide a 'fast-forward' capability for this iterator
MPHF will use this to reduce the number of kmers that
need to be produced.
Provide a ' fast - forward ' capability for this iterator MPHF will use this to reduce the number of kmers that need to be produced .
fn nth(&mut self, n: usize) -> Option<Self::Item> {
        if n <= 4 {
            // for small skips forward, shift one base at a time
            for _ in 0..n {
                self.next();
            }
        } else {
            self.kmer_id += n;
            self.kmer = self.node_seq_slice.get_kmer::<K>(self.kmer_id);
        }
        self.next()
    }
fn nth ( & mut self , n : usize ) -> Option < Self :: Item > { if n <= 4 { // for small skips forward, shift one base at a time for _ in 0 .. n { self . next ( ) ; } } else { self . kmer_id += n ; self . kmer = self . node_seq_slice . get_kmer :: < K > ( self . kmer_id ) ; } self . next ( ) }
Provide a 'fast-forward' capability for this iterator
MPHF will use this to reduce the number of kmers that
need to be produced.
Provide a ' fast - forward ' capability for this iterator MPHF will use this to reduce the number of kmers that need to be produced .
&mut self
n
usize
&mut self
n
usize