Struct BoundedDedup 

pub struct BoundedDedup<K> { /* private fields */ }

Bounded deduplication set with FIFO eviction.

Insertions are tagged with a sequence number so a stale marker left behind by remove or by re-insertion of the same key cannot evict the live entry when it reaches the front of the queue.

Implementations

impl<K> BoundedDedup<K>

where K: Eq + Hash + Clone,

pub fn new(capacity: usize) -> Self

Creates a new dedup set with the given maximum capacity.

pub fn contains(&self, key: &K) -> bool

Returns true if the key is currently present.

pub fn check_and_insert(&self, key: K) -> bool

Inserts the key. Returns true when the key was already present (duplicate) and false when this call was the first insertion.

pub fn insert(&self, key: K)

Inserts the key without reporting whether it was already present.

pub fn remove(&self, key: &K) -> bool

Drops the key from the set if present. Returns true if it was found.

Trait Implementations

impl<K: Debug> Debug for BoundedDedup<K>

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

Formats the value using the given formatter.