Struct PacketHashlist 

pub struct PacketHashlist { /* private fields */ }

Double-buffered packet hash deduplication.

Uses two BTreeSets: current and previous. When the current set grows past max_size / 2, it rotates: current becomes previous, and a new empty set becomes current. This means the oldest hashes are forgotten after two rotations.

Implementations

impl PacketHashlist

pub fn new(max_size: usize) -> Self

pub fn is_duplicate(&self, hash: &[u8; 32]) -> bool

Check if a hash is a duplicate (exists in current or previous set).

pub fn add(&mut self, hash: [u8; 32])

Add a hash to the current set.

pub fn maybe_rotate(&mut self) -> bool

Rotate if current set exceeds max_size / 2. Returns true if rotation occurred.

pub fn len(&self) -> usize

Total number of tracked hashes (current + previous).

pub fn current_len(&self) -> usize

Number of hashes in the current set only.