Struct PacketHashlist 

pub struct PacketHashlist { /* private fields */ }

Bounded FIFO packet-hash deduplication.

Retains at most max_size unique packet hashes. New unique hashes are appended in insertion order; when full, the oldest retained hash is evicted. Re-inserting a retained hash is a no-op and does not refresh its recency.

Implementations

impl PacketHashlist

pub fn new(max_size: usize) -> Self

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

Check if a hash is currently retained.

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

Retain a hash. If the dedup table is full, evict the oldest unique hash.

pub fn len(&self) -> usize

Total number of retained packet hashes.

pub fn is_empty(&self) -> bool