pub enum PatKind<'tcx> {
Show 15 variants
Wild,
AscribeUserType {
ascription: Ascription<'tcx>,
subpattern: Box<Pat<'tcx>>,
},
Binding {
name: Symbol,
mode: BindingMode,
var: LocalVarId,
ty: Ty<'tcx>,
subpattern: Option<Box<Pat<'tcx>>>,
is_primary: bool,
},
Variant {
adt_def: AdtDef<'tcx>,
args: GenericArgsRef<'tcx>,
variant_index: VariantIdx,
subpatterns: Vec<FieldPat<'tcx>>,
},
Leaf {
subpatterns: Vec<FieldPat<'tcx>>,
},
Deref {
subpattern: Box<Pat<'tcx>>,
},
DerefPattern {
subpattern: Box<Pat<'tcx>>,
mutability: Mutability,
},
Constant {
value: Const<'tcx>,
},
InlineConstant {
def: LocalDefId,
subpattern: Box<Pat<'tcx>>,
},
Range(Box<PatRange<'tcx>>),
Slice {
prefix: Box<[Box<Pat<'tcx>>]>,
slice: Option<Box<Pat<'tcx>>>,
suffix: Box<[Box<Pat<'tcx>>]>,
},
Array {
prefix: Box<[Box<Pat<'tcx>>]>,
slice: Option<Box<Pat<'tcx>>>,
suffix: Box<[Box<Pat<'tcx>>]>,
},
Or {
pats: Box<[Box<Pat<'tcx>>]>,
},
Never,
Error(ErrorGuaranteed),
}
Variants§
Wild
A wildcard pattern: _
.
AscribeUserType
Binding
x
, ref x
, x @ P
, etc.
Variant
Foo(...)
or Foo{...}
or Foo
, where Foo
is a variant name from an ADT with
multiple variants.
Leaf
(...)
, Foo(...)
, Foo{...}
, or Foo
, where Foo
is a variant name from an ADT with
a single variant.
Deref
box P
, &P
, &mut P
, etc.
DerefPattern
Deref pattern, written box P
for now.
Constant
One of the following:
&str
/&[u8]
(represented as a valtree), which will be handled as a string/slice pattern and thus exhaustiveness checking will detect if you use the same string/slice twice in different patterns.- integer, bool, char or float (represented as a valtree), which will be handled by
exhaustiveness to cover exactly its own value, similar to
&str
, but these values are much simpler. String
, ifstring_deref_patterns
is enabled.
InlineConstant
Inline constant found while lowering a pattern.
Fields
def: LocalDefId
LocalDefId of the constant, we need this so that we have a reference that can be used by unsafety checking to visit nested unevaluated constants.
subpattern: Box<Pat<'tcx>>
If the inline constant is used in a range pattern, this subpattern represents the range (if both ends are inline constants, there will be multiple InlineConstant wrappers).
Otherwise, the actual pattern that the constant lowered to. As with other constants, inline constants are matched structurally where possible.
Range(Box<PatRange<'tcx>>)
Slice
Matches against a slice, checking the length and extracting elements.
irrefutable when there is a slice pattern and both prefix
and suffix
are empty.
e.g., &[ref xs @ ..]
.
Array
Fixed match against an array; irrefutable.
Or
An or-pattern, e.g. p | q
.
Invariant: pats.len() >= 2
.
Never
A never pattern !
.
Error(ErrorGuaranteed)
An error has been encountered during lowering. We probably shouldn’t report more lints related to this pattern.
Trait Implementations§
Source§impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for PatKind<'tcx>
impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for PatKind<'tcx>
fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher, )
Source§impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PatKind<'tcx>
impl<'tcx> TypeVisitable<TyCtxt<'tcx>> for PatKind<'tcx>
Source§fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>(
&self,
__visitor: &mut __V,
) -> __V::Result
fn visit_with<__V: TypeVisitor<TyCtxt<'tcx>>>( &self, __visitor: &mut __V, ) -> __V::Result
Auto Trait Implementations§
impl<'tcx> DynSend for PatKind<'tcx>
impl<'tcx> DynSync for PatKind<'tcx>
impl<'tcx> Freeze for PatKind<'tcx>
impl<'tcx> !RefUnwindSafe for PatKind<'tcx>
impl<'tcx> Send for PatKind<'tcx>
impl<'tcx> Sync for PatKind<'tcx>
impl<'tcx> Unpin for PatKind<'tcx>
impl<'tcx> !UnwindSafe for PatKind<'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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
§impl<Tcx, T> DepNodeParams<Tcx> for T
impl<Tcx, T> DepNodeParams<Tcx> for T
default fn fingerprint_style() -> FingerprintStyle
§default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_fingerprint(&self, tcx: Tcx) -> Fingerprint
default fn to_debug_str(&self, _: Tcx) -> String
§default fn recover(_: Tcx, _: &DepNode) -> Option<T>
default fn recover(_: Tcx, _: &DepNode) -> Option<T>
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<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§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<T> Pointable for T
impl<T> Pointable for T
§impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<I, T> TypeVisitableExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
fn has_type_flags(&self, flags: TypeFlags) -> bool
§fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_at_or_above(&self, binder: DebruijnIndex) -> bool
true
if self
has any late-bound regions that are either
bound by binder
or bound by some binder outside of binder
.
If binder
is ty::INNERMOST
, this indicates whether
there are any late-bound regions that appear free.fn error_reported(&self) -> Result<(), <I as Interner>::ErrorGuaranteed>
§fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
fn has_vars_bound_above(&self, binder: DebruijnIndex) -> bool
true
if this type has any regions that escape binder
(and
hence are not bound by it).§fn has_escaping_bound_vars(&self) -> bool
fn has_escaping_bound_vars(&self) -> bool
true
if this type has regions that are not a part of the type.
For example, for<'a> fn(&'a i32)
return false
, while fn(&'a i32)
would return true
. The latter can occur when traversing through the
former. Read morefn has_aliases(&self) -> bool
fn has_opaque_types(&self) -> bool
fn has_coroutines(&self) -> bool
fn references_error(&self) -> bool
fn has_non_region_param(&self) -> bool
fn has_infer_regions(&self) -> bool
fn has_infer_types(&self) -> bool
fn has_non_region_infer(&self) -> bool
fn has_infer(&self) -> bool
fn has_placeholders(&self) -> bool
fn has_non_region_placeholders(&self) -> bool
fn has_param(&self) -> bool
§fn has_free_regions(&self) -> bool
fn has_free_regions(&self) -> bool
fn has_erased_regions(&self) -> bool
§fn has_erasable_regions(&self) -> bool
fn has_erasable_regions(&self) -> bool
§fn is_global(&self) -> bool
fn is_global(&self) -> bool
§fn has_bound_regions(&self) -> bool
fn has_bound_regions(&self) -> bool
§fn has_non_region_bound_vars(&self) -> bool
fn has_non_region_bound_vars(&self) -> bool
§fn has_bound_vars(&self) -> bool
fn has_bound_vars(&self) -> bool
§fn still_further_specializable(&self) -> bool
fn still_further_specializable(&self) -> bool
impl
specialization.§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
§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_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for 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: 48 bytes
Size for each variant:
Wild
: 0 bytesAscribeUserType
: 48 bytesBinding
: 40 bytesVariant
: 48 bytesLeaf
: 32 bytesDeref
: 16 bytesDerefPattern
: 24 bytesConstant
: 48 bytesInlineConstant
: 24 bytesRange
: 16 bytesSlice
: 48 bytesArray
: 48 bytesOr
: 24 bytesNever
: 0 bytesError
: 0 bytes