Struct BoundedSeen 

pub struct BoundedSeen<T> { /* private fields */ }

A set with a bounded capacity that evicts the oldest entry on overflow.

Insertion (insert) returns true when the item is new and was added, false when it was already present. When len() == cap, the least recently inserted item is removed before the new item is added.

Implementations

impl<T: Eq + Hash + Clone> BoundedSeen<T>

pub fn new(cap: usize) -> Self

Creates a new set with the given capacity limit.

N=10000 is the recommended default per epoch (GTP §5, GSP §5).

pub fn insert(&mut self, item: T) -> bool

Inserts an item. Returns true if the item is new and was added, false if it was already present.

When the set is at capacity, the oldest entry is evicted.

pub fn len(&self) -> usize

Returns the number of entries currently in the set.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.

pub fn clear(&mut self)

Clears the set.

Trait Implementations

impl<T: Clone> Clone for BoundedSeen<T>

fn clone(&self) -> BoundedSeen<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for BoundedSeen<T>

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

Formats the value using the given formatter.