Enum Set1

pub enum Set1<T> {
    Empty,
    One(T),
    Many,
}

A set containing, at most, one known element. If two distinct values are inserted into a set, then it becomes Many, which can be used to detect ambiguities.

Variants

Empty

One(T)

Many

Implementations

impl<T: PartialEq> Set1<T>

pub fn insert(&mut self, value: T)

Trait Implementations

impl<T: Clone> Clone for Set1<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Set1<T>

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

Formats the value using the given formatter.

impl<T, __D: TyDecoder> Decodable<__D> for Set1<T>

where T: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Self

impl<T, __E: TyEncoder> Encodable<__E> for Set1<T>

where T: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<'__ctx, T> HashStable<StableHashingContext<'__ctx>> for Set1<T>

where T: HashStable<StableHashingContext<'__ctx>>,

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )

impl<T: PartialEq> PartialEq for Set1<T>

fn eq(&self, other: &Set1<T>) -> 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: Copy> Copy for Set1<T>

impl<T: Eq> Eq for Set1<T>

impl<T> StructuralPartialEq for Set1<T>

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.