Enum rustc_middle::middle::resolve_lifetime::Set1[−][src]

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

Expand description

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)

Tuple Fields of One

0: T

Many

Implementations

[src]

impl<T: PartialEq> Set1<T>

[src]

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

Trait Implementations

[src]

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

[src]

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

Returns a copy of the value. Read more

1.0.0[src]

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

Performs copy-assignment from source. Read more

[src]

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

[src]

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

Formats the value using the given formatter. Read more

[src]

impl<'tcx, T, D: TyDecoder<'tcx>> Decodable<D> for Set1<T> where
T: Decodable<__D>,

[src]

fn decode(decoder: &mut D) -> Result<Self, <__D as Decoder>::Error>

[src]

impl<'tcx, T, E: TyEncoder<'tcx>> Encodable<E> for Set1<T> where
T: Encodable<__E>,

[src]

fn encode(&self, encoder: &mut E) -> Result<(), <__E as Encoder>::Error>

[src]

impl<'ctx, T> HashStable<StableHashingContext<'ctx>> for Set1<T> where
T: HashStable<StableHashingContext<'__ctx>>,

[src]

fn hash_stable(
 &self,
 hcx: &mut StableHashingContext<'ctx>,
 __hasher: &mut StableHasher
)

[src]

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

[src]

fn eq(&self, other: &Set1<T>) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

[src]

fn ne(&self, other: &Set1<T>) -> bool

This method tests for !=.

[src]

impl<T> StructuralPartialEq for Set1<T>

Auto Trait Implementations

impl<T> RefUnwindSafe for Set1<T> where
T: RefUnwindSafe,

impl<T> Send for Set1<T> where
T: Send,

impl<T> Sync for Set1<T> where
T: Sync,

impl<T> Unpin for Set1<T> where
T: Unpin,

impl<T> UnwindSafe for Set1<T> where
T: UnwindSafe,

Blanket Implementations

[src]

impl<T> Any for T where
T: 'static + ?Sized,

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

impl<'tcx, T> ArenaAllocatable<'tcx, ()> for T where
T: Copy,

[src]

pub fn allocate_on(Self, &'a Arena<'tcx>) -> &'a mut T

[src]

pub fn allocate_from_iter(
&'a Arena<'tcx>,
impl IntoIterator<Item = T>
) -> &'a mut [T]

[src]

impl<T> Borrow<T> for T where
T: ?Sized,

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

impl<T> BorrowMut<T> for T where
T: ?Sized,

[src]

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

[src]

impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

[src]

pub default fn fingerprint_style() -> FingerprintStyle

[src]

pub default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint

This method turns the parameters of a DepNodeConstructor into an opaque Fingerprint to be used in DepNode. Not all DepNodeParams support being turned into a Fingerprint (they don’t need to if the corresponding DepNode is anonymous). Read more

[src]

pub default fn to_debug_str(&self, Ctxt) -> String

[src]

pub default fn recover(
Ctxt,
&DepNode<<Ctxt as DepContext>::DepKind>
) -> Option<T>

This method tries to recover the query key from the given DepNode, something which is needed when forcing DepNodes during red-green evaluation. The query system will only call this method if fingerprint_style() is not FingerprintStyle::Opaque. It is always valid to return None here, in which case incremental compilation will treat the query as having changed instead of forcing it. Read more

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

[src]

impl<T, U> Into for T where
U: From<T>,

[src]

pub fn into(self) -> U

Performs the conversion.

[src]

impl<T> MaybeResult<T> for T

type Error = !

[src]

pub fn from(Result<T, <T as MaybeResult<T>>::Error>) -> T

[src]

pub fn to_result(Self) -> Result<T, <T as MaybeResult<T>>::Error>

[src]

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

[src]

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

[src]

pub fn clone_into(&self, target: &mut T)

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

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

[src]

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

[src]

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

[src]

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

[src]

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

[src]

impl<T> WithConstness for T

[src]

fn with_constness(self, constness: BoundConstness) -> ConstnessAnd<Self>

[src]

fn with_const_if_const(self) -> ConstnessAnd<Self>

[src]

fn without_const(self) -> ConstnessAnd<Self>

[src]

impl<'a, T> Captures<'a> for T where
T: ?Sized,

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.

Enum rustc_middle::middle::resolve_lifetime::Set1[−][src]

Variants

Tuple Fields of One

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>

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

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

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

impl<'tcx, T, __D: TyDecoder<'tcx>> Decodable<__D> for Set1<T> where T: Decodable<__D>,

fn decode(__decoder: &mut __D) -> Result<Self, <__D as Decoder>::Error>

impl<'tcx, T, __E: TyEncoder<'tcx>> Encodable<__E> for Set1<T> where T: Encodable<__E>,

fn encode(&self, __encoder: &mut __E) -> Result<(), <__E as Encoder>::Error>

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<Set1<T>> for Set1<T>

fn eq(&self, other: &Set1<T>) -> bool

fn ne(&self, other: &Set1<T>) -> bool

impl<T: Copy> Copy for Set1<T>

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

impl<T> StructuralEq for Set1<T>

impl<T> StructuralPartialEq for Set1<T>

Auto Trait Implementations

impl<T> RefUnwindSafe for Set1<T> where T: RefUnwindSafe,

impl<T> Send for Set1<T> where T: Send,

impl<T> Sync for Set1<T> where T: Sync,

impl<T> Unpin for Set1<T> where T: Unpin,

impl<T> UnwindSafe for Set1<T> where T: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<'tcx, T> ArenaAllocatable<'tcx, ()> for T where T: Copy,

pub fn allocate_on(Self, &'a Arena<'tcx>) -> &'a mut T

pub fn allocate_from_iter( &'a Arena<'tcx>, impl IntoIterator<Item = T>) -> &'a mut [T]

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<Ctxt, T> DepNodeParams<Ctxt> for T where Ctxt: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

pub default fn fingerprint_style() -> FingerprintStyle

pub default fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint

pub default fn to_debug_str(&self, Ctxt) -> String

pub default fn recover( Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T> MaybeResult<T> for T

type Error = !

pub fn from(Result<T, <T as MaybeResult<T>>::Error>) -> T

pub fn to_result(Self) -> Result<T, <T as MaybeResult<T>>::Error>

impl<T> ToOwned for T where T: Clone,

type Owned = T

pub fn to_owned(&self) -> T

pub fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> WithConstness for T

fn with_constness(self, constness: BoundConstness) -> ConstnessAnd<Self>

fn with_const_if_const(self) -> ConstnessAnd<Self>

fn without_const(self) -> ConstnessAnd<Self>

impl<'a, T> Captures<'a> for T where T: ?Sized,

Layout

impl<'tcx, T, D: TyDecoder<'tcx>> Decodable<D> for Set1<T> where
T: Decodable<__D>,

fn decode(decoder: &mut D) -> Result<Self, <__D as Decoder>::Error>

impl<'tcx, T, E: TyEncoder<'tcx>> Encodable<E> for Set1<T> where
T: Encodable<__E>,

fn encode(&self, encoder: &mut E) -> Result<(), <__E as Encoder>::Error>

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> RefUnwindSafe for Set1<T> where
T: RefUnwindSafe,

impl<T> Send for Set1<T> where
T: Send,

impl<T> Sync for Set1<T> where
T: Sync,

impl<T> Unpin for Set1<T> where
T: Unpin,

impl<T> UnwindSafe for Set1<T> where
T: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<'tcx, T> ArenaAllocatable<'tcx, ()> for T where
T: Copy,

pub fn allocate_from_iter(
&'a Arena<'tcx>,
impl IntoIterator<Item = T>
) -> &'a mut [T]

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<Ctxt, T> DepNodeParams<Ctxt> for T where
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

pub default fn recover(
Ctxt,
&DepNode<<Ctxt as DepContext>::DepKind>
) -> Option<T>

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<'a, T> Captures<'a> for T where
T: ?Sized,