Enum rustc_middle::middle::resolve_bound_vars::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§
Implementations§
Trait Implementations§
source§impl<'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>,
source§impl<'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>,
source§impl<'__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 )
source§impl<T: PartialEq> PartialEq<Set1<T>> for Set1<T>
impl<T: PartialEq> PartialEq<Set1<T>> for Set1<T>
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§
source§impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere
T: Copy,
impl<'tcx, T> ArenaAllocatable<'tcx, IsCopy> for Twhere T: Copy,
fn allocate_on<'a>(self, arena: &'a Arena<'tcx>) -> &'a mut T
fn allocate_from_iter<'a>( arena: &'a Arena<'tcx>, iter: impl IntoIterator<Item = T> ) -> &'a mut [T]
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
source§impl<Tcx, T> DepNodeParams<Tcx> for Twhere
Tcx: DepContext,
T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,
default fn fingerprint_style() -> FingerprintStyle
source§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> 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).
default fn to_debug_str(&self, _: Tcx) -> String
source§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> 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.source§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
source§impl<'tcx, T> ToPredicate<'tcx, T> for T
impl<'tcx, T> ToPredicate<'tcx, T> for T
fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T
source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle: &[QueryInfo], _guar: ErrorGuaranteed ) -> 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.