Struct LruHashSet

pub struct LruHashSet<T: Hash + Eq> { /* private fields */ }

Wrapper around LinkedHashSet with bounded growth.

In the limit, for each element inserted the oldest existing element will be removed.

Implementations

impl<T: Hash + Eq> LruHashSet<T>

pub fn new(limit: NonZeroUsize) -> Self

Create a new LruHashSet with the given (exclusive) limit.

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

Insert element into the set.

Returns true if this is a new element to the set, false otherwise. Maintains the limit of the set by removing the oldest entry if necessary. Inserting the same element will update its LRU position.

Trait Implementations

impl<T: Clone + Hash + Eq> Clone for LruHashSet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Hash + Eq> Debug for LruHashSet<T>

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

Formats the value using the given formatter.