Struct DuplicateCache 

pub struct DuplicateCache<const N: usize = 64> { /* private fields */ }

Fixed-capacity cache of recently observed duplicate keys.

Entries leave either by age (DUP_CACHE_TTL_MS) or by eviction of the oldest when the ring is full, whichever comes first.

Implementations

impl<const N: usize> DuplicateCache<N>

pub fn new() -> Self

Create an empty duplicate cache.

pub fn contains(&self, key: &DupCacheKey, now_ms: u64) -> bool

Return whether key is present and has not aged out.

pub fn insert(&mut self, key: DupCacheKey, now_ms: u64)

Insert key, dropping aged-out entries and evicting the oldest survivor if the ring is still full.

A repeat of a key already held does not refresh its timestamp: the entry ages from when the packet was first seen, so a node repeating itself inside the window cannot hold its own suppression open.

pub fn expire(&mut self, now_ms: u64)

Drop every entry older than DUP_CACHE_TTL_MS.

pub fn len(&self) -> usize

Return the number of tracked entries.

pub fn is_empty(&self) -> bool

Return whether the cache is empty.

Trait Implementations

impl<const N: usize> Clone for DuplicateCache<N>

fn clone(&self) -> DuplicateCache<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Debug for DuplicateCache<N>

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

Formats the value using the given formatter.

impl<const N: usize> Default for DuplicateCache<N>

fn default() -> Self

Returns the “default value” for a type.