Struct rustc_middle::thir::Pat
source · pub struct Pat<'tcx> {
pub ty: Ty<'tcx>,
pub span: Span,
pub kind: PatKind<'tcx>,
}
Fields§
§ty: Ty<'tcx>
§span: Span
§kind: PatKind<'tcx>
Implementations§
source§impl<'tcx> Pat<'tcx>
impl<'tcx> Pat<'tcx>
pub fn wildcard_from_ty(ty: Ty<'tcx>) -> Self
pub fn simple_ident(&self) -> Option<Symbol>
sourcepub fn each_binding(&self, f: impl FnMut(Symbol, BindingMode, Ty<'tcx>, Span))
pub fn each_binding(&self, f: impl FnMut(Symbol, BindingMode, Ty<'tcx>, Span))
Call f
on every “binding” in a pattern, e.g., on a
in
match foo() { Some(a) => (), None => () }
sourcepub fn walk(&self, it: impl FnMut(&Pat<'tcx>) -> bool)
pub fn walk(&self, it: impl FnMut(&Pat<'tcx>) -> bool)
Walk the pattern in left-to-right order.
If it(pat)
returns false
, the children are not visited.
fn walk_(&self, it: &mut impl FnMut(&Pat<'tcx>) -> bool)
sourcepub fn walk_always(&self, it: impl FnMut(&Pat<'tcx>))
pub fn walk_always(&self, it: impl FnMut(&Pat<'tcx>))
Walk the pattern in left-to-right order.
If you always want to recurse, prefer this method over walk
.
Trait Implementations§
source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Pat<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for Pat<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )
source§impl<'tcx> IntoDiagnosticArg for Pat<'tcx>
impl<'tcx> IntoDiagnosticArg for Pat<'tcx>
fn into_diagnostic_arg(self) -> DiagnosticArgValue<'static>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for Pat<'tcx>
impl<'tcx> !Send for Pat<'tcx>
impl<'tcx> !Sync for Pat<'tcx>
impl<'tcx> Unpin for Pat<'tcx>
impl<'tcx> !UnwindSafe for Pat<'tcx>
Blanket Implementations§
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: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 64 bytes