Struct RollingHash 

pub struct RollingHash { /* private fields */ }

Rabin-Karp rolling hash for efficient substring comparison

Uses a rolling window to compute hashes of code blocks. Allows for efficient duplicate detection in O(n) time.

Implementations

impl RollingHash

pub fn new(window_size: usize) -> Self

Creates a new RollingHash with the specified window size

Arguments

• window_size - Number of tokens in the rolling window (default: 50)

pub fn roll(&mut self, token_hash: u64) -> Option<u64>

Adds a token to the rolling hash window

If the window is full, the oldest token is removed.

Arguments

• token_hash - Hash value of the token to add

Returns

• Option<u64> - The current hash if window is full, None otherwise

pub fn reset(&mut self)

Resets the rolling hash to initial state

pub fn current_hash(&self) -> Option<u64>

Returns the current hash value (if window is full)

pub fn window_size(&self) -> usize

Returns the current window size

Trait Implementations

impl Clone for RollingHash

fn clone(&self) -> RollingHash

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RollingHash

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.