Enum rustc_middle::middle::resolve_lifetime::Set1
source · [−]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)
Many
Implementations
Trait Implementations
sourceimpl<'tcx, T, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Set1<T>where
T: Decodable<__D>,
impl<'tcx, T, __D: TyDecoder<I = TyCtxt<'tcx>>> Decodable<__D> for Set1<T>where
T: Decodable<__D>,
sourceimpl<'tcx, T, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Set1<T>where
T: Encodable<__E>,
impl<'tcx, T, __E: TyEncoder<I = TyCtxt<'tcx>>> Encodable<__E> for Set1<T>where
T: Encodable<__E>,
sourceimpl<'__ctx, T> HashStable<StableHashingContext<'__ctx>> for Set1<T>where
T: HashStable<StableHashingContext<'__ctx>>,
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: 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
sourceimpl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
fn allocate_on(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter(
arena: &'a Arena<'tcx>,
iter: impl IntoIterator<Item = T>
) -> &'a mut [T]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Ctxt, T> DepNodeParams<Ctxt> for Twhere
Ctxt: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
sourcedefault fn to_fingerprint(&self, tcx: Ctxt) -> Fingerprint
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
default fn to_debug_str(&self, Ctxt) -> String
sourcedefault fn recover(Ctxt, &DepNode<<Ctxt as DepContext>::DepKind>) -> Option<T>
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 DepNode
s 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 moresourceimpl<T, R> InternIteratorElement<T, R> for T
impl<T, R> InternIteratorElement<T, R> for T
type Output = R
fn intern_with<I, F>(iter: I, f: F) -> <T as InternIteratorElement<T, R>>::Outputwhere
I: Iterator<Item = T>,
F: FnOnce(&[T]) -> R,
sourceimpl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
sourceimpl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
impl<CTX, T> Value<CTX> for Twhere
CTX: DepContext,
default fn from_cycle_error(tcx: CTX) -> T
impl<'a, T> Captures<'a> for Twhere
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.