Struct NtHash 

pub struct NtHash<'a> { /* private fields */ }

Rolling k‑mer hasher over a contiguous DNA sequence.

• Initialization is deferred until the first valid k‑mer (skips any windows containing N).
• roll() / roll_back() advance by one base, handling skips transparently.
• Each valid k‑mer emits num_hashes values: the canonical hash plus extra mixes.

Implementations

impl<'a> NtHash<'a>

pub fn new(seq: &'a [u8], k: u16, num_hashes: u8, pos: usize) -> Result<Self>

Create a new NtHash starting at pos.

Arguments

• seq – full DNA sequence (A,C,G,T,N recognized; others treated as N)
• k – k‑mer length (> 0)
• num_hashes – how many hash values per k‑mer
• pos – starting index

Errors

Returns if k == 0, seq.len() < k, or pos too large.

pub fn roll(&mut self) -> bool

Advance forward by one base, skipping over k‑mers with N. Returns true if a new valid hash was produced.

pub fn roll_back(&mut self) -> bool

Move backward by one base, skipping over k‑mers with N.

pub fn peek(&mut self) -> bool

Peek the next k‑mer without mutating self.

pub fn peek_char(&mut self, incoming: u8) -> bool

Peek with an explicit incoming byte.

pub fn peek_back(&mut self) -> bool

Peek the previous k‑mer without mutating self.

pub fn peek_back_char(&mut self, incoming: u8) -> bool

Peek backward with explicit incoming byte.

pub fn hashes(&self) -> &[u64]

Returns the most recent hash buffer.

pub fn pos(&self) -> usize

Returns the current k‑mer start index.

pub fn forward_hash(&self) -> u64

Returns the forward‑strand hash.

pub fn reverse_hash(&self) -> u64

Returns the reverse‑complement hash.