Struct SetRef 

pub struct SetRef<'a, K: Key> { /* private fields */ }

A convenience handle that bundles a set reference with an epoch guard.

Implementations

impl<K: Key> SetRef<'_, K>

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

Insert a key. Returns true if the key was newly inserted.

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

Remove a key. Returns true if the key was present.

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

Check whether the set contains a key.

pub fn len(&self) -> usize

Return the approximate number of elements in the set.

See LearnedMap::len for details on relaxed-atomic staleness under concurrency.

pub fn is_empty(&self) -> bool

Return true if the set is empty.

Subject to the same relaxed-atomic staleness as len.

pub fn range<R: RangeBounds<K>>(&self, range: R) -> impl Iterator<Item = &K>

Return an iterator over keys within the given range, in ascending order.

pub fn first(&self) -> Option<&K>

Return the first (minimum) key.

pub fn last(&self) -> Option<&K>

Return the last (maximum) key.