Type Alias UstrFinSet

pub type UstrFinSet = HashFinSet<Ustr, BuildHasherDefault<IdentityHasher>>;

A finite set with elements of type Ustr.

Aliased Type

struct UstrFinSet(/* private fields */);

Implementations

impl<T, S> HashFinSet<T, S>

where T: Eq + Hash, S: BuildHasher,

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

Adds an element to the set.

Trait Implementations

impl<T: Clone, S: Clone> Clone for HashFinSet<T, S>

fn clone(&self) -> HashFinSet<T, S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, S: Debug> Debug for HashFinSet<T, S>

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

Formats the value using the given formatter.

impl<T, S> Default for HashFinSet<T, S>

where S: Default,

fn default() -> Self

Returns the “default value” for a type.

impl<T, S> Extend<T> for HashFinSet<T, S>

where T: Eq + Hash, S: BuildHasher,

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

where Iter: IntoIterator<Item = T>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬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, S> FinSet for HashFinSet<T, S>

where T: Eq + Hash + Clone, S: BuildHasher,

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

Iterates over elements of the finite set.

fn len(&self) -> usize

The size of the finite set.

fn is_empty(&self) -> bool

Is the set empty?

impl<T, S> From<HashSet<T, S>> for HashFinSet<T, S>

fn from(value: HashSet<T, S>) -> Self

Converts to this type from the input type.

impl<T, S> IntoIterator for HashFinSet<T, S>

where T: Eq + Hash, S: BuildHasher,

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, S> PartialEq for HashFinSet<T, S>

where T: Eq + Hash, S: BuildHasher,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T, S> Set for HashFinSet<T, S>

where T: Eq + Clone + Hash, S: BuildHasher,

type Elem = T

Type of elements of the set.

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

Does the set contain the element x?

impl<T, S> Eq for HashFinSet<T, S>

where T: Eq + Hash, S: BuildHasher,