Struct rustc_type_ir::data_structures::SsoHashSet

pub struct SsoHashSet<T> {
    map: SsoHashMap<T, ()>,
}

Small-storage-optimized implementation of a set.

Stores elements in a small array up to a certain length and switches to HashSet when that length is exceeded.

Fields

map: SsoHashMap<T, ()>

Implementations

impl<T> SsoHashSet<T>

pub fn new() -> SsoHashSet<T>

Creates an empty SsoHashSet.

pub fn with_capacity(cap: usize) -> SsoHashSet<T>

Creates an empty SsoHashSet with the specified capacity.

pub fn clear(&mut self)

Clears the set, removing all values.

pub fn capacity(&self) -> usize

Returns the number of elements the set can hold without reallocating.

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

pub fn iter(&self) -> impl Iterator<Item = &T>

An iterator visiting all elements in arbitrary order. The iterator element type is &'a T.

pub fn drain(&mut self) -> impl Iterator<Item = T>

Clears the set, returning all elements in an iterator.

impl<T> SsoHashSet<T>

where T: Eq + Hash,

pub fn reserve(&mut self, additional: usize)

Reserves capacity for at least additional more elements to be inserted in the SsoHashSet. The collection may reserve more space to avoid frequent reallocations.

pub fn shrink_to_fit(&mut self)

Shrinks the capacity of the set as much as possible. It will drop down as much as possible while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&T) -> bool,

Retains only the elements specified by the predicate.

pub fn take(&mut self, value: &T) -> Option<T>

Removes and returns the value in the set, if any, that is equal to the given one.

pub fn get(&self, value: &T) -> Option<&T>

Returns a reference to the value in the set, if any, that is equal to the given value.

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

Adds a value to the set.

Returns whether the value was newly inserted. That is:

• If the set did not previously contain this value, true is returned.
• If the set already contained this value, false is returned.

pub fn remove(&mut self, value: &T) -> bool

Removes a value from the set. Returns whether the value was present in the set.

pub fn contains(&self, value: &T) -> bool

Returns true if the set contains a value.

Trait Implementations

impl<T> Clone for SsoHashSet<T>

where T: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for SsoHashSet<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for SsoHashSet<T>

fn default() -> SsoHashSet<T>

Returns the “default value” for a type.

impl<'a, T> Extend<&'a T> for SsoHashSet<T>

where T: 'a + Eq + Hash + Copy,

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = &'a T>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, _: &'a T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<T> for SsoHashSet<T>

where T: Eq + Hash,

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = T>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: T)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> FromIterator<T> for SsoHashSet<T>

where T: Eq + Hash,

fn from_iter<I>(iter: I) -> SsoHashSet<T>

where I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<'a, T> IntoIterator for &'a SsoHashSet<T>

type IntoIter = Map<Either<Map<Iter<'a, (T, ())>, fn(_: &'a (T, ())) -> (&'a T, &'a ())>, Iter<'a, T, ()>>, fn(_: (&'a T, &'a ())) -> &'a T>

Which kind of iterator are we turning this into?

type Item = &'a T

The type of the elements being iterated over.

fn into_iter( self, ) -> Map<Either<Map<Iter<'a, (T, ())>, fn(_: &'a (T, ())) -> (&'a T, &'a ())>, Iter<'a, T, ()>>, fn(_: (&'a T, &'a ())) -> &'a T>

Creates an iterator from a value.

impl<T> IntoIterator for SsoHashSet<T>

type IntoIter = Map<Either<IntoIter<(T, ()), 8>, IntoIter<T, ()>>, fn(_: (T, ())) -> T>

Which kind of iterator are we turning this into?

type Item = T

The type of the elements being iterated over.

fn into_iter( self, ) -> Map<Either<IntoIter<(T, ()), 8>, IntoIter<T, ()>>, fn(_: (T, ())) -> T>

Creates an iterator from a value.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.