pub enum PatKind<'tcx> {
    Wild,
    AscribeUserType {
        ascription: Ascription<'tcx>,
        subpattern: Box<Pat<'tcx>>,
    },
    Binding {
        mutability: Mutability,
        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>>,
    },
    Constant {
        value: Const<'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>>]>,
    },
}

Variants§

§

Wild

A wildcard pattern: _.

§

AscribeUserType

Fields

§ascription: Ascription<'tcx>
§subpattern: Box<Pat<'tcx>>
§

Binding

Fields

§mutability: Mutability
§name: Symbol
§ty: Ty<'tcx>
§subpattern: Option<Box<Pat<'tcx>>>
§is_primary: bool

Is this the leftmost occurrence of the binding, i.e., is var the HirId of this pattern?

x, ref x, x @ P, etc.

§

Variant

Fields

§adt_def: AdtDef<'tcx>
§args: GenericArgsRef<'tcx>
§variant_index: VariantIdx
§subpatterns: Vec<FieldPat<'tcx>>

Foo(...) or Foo{...} or Foo, where Foo is a variant name from an ADT with multiple variants.

§

Leaf

Fields

§subpatterns: Vec<FieldPat<'tcx>>

(...), Foo(...), Foo{...}, or Foo, where Foo is a variant name from an ADT with a single variant.

§

Deref

Fields

§subpattern: Box<Pat<'tcx>>

box P, &P, &mut P, etc.

§

Constant

Fields

§value: Const<'tcx>

One of the following:

  • &str (represented as a valtree), which will be handled as a string pattern and thus exhaustiveness checking will detect if you use the same string 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.
  • Opaque constants (represented as mir::ConstValue), that must not be matched structurally. So anything that does not derive PartialEq and Eq.

These are always compared with the matched place using (the semantics of) PartialEq.

§

Range(Box<PatRange<'tcx>>)

§

Slice

Fields

§prefix: Box<[Box<Pat<'tcx>>]>
§slice: Option<Box<Pat<'tcx>>>
§suffix: Box<[Box<Pat<'tcx>>]>

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

Fields

§prefix: Box<[Box<Pat<'tcx>>]>
§slice: Option<Box<Pat<'tcx>>>
§suffix: Box<[Box<Pat<'tcx>>]>

Fixed match against an array; irrefutable.

§

Or

Fields

§pats: Box<[Box<Pat<'tcx>>]>

An or-pattern, e.g. p | q. Invariant: pats.len() >= 2.

Trait Implementations§

source§

impl<'tcx> Clone for PatKind<'tcx>

source§

fn clone(&self) -> PatKind<'tcx>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<'tcx> Debug for PatKind<'tcx>

source§

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

Formats the value using the given formatter. Read more
source§

impl<'tcx, '__ctx> HashStable<StableHashingContext<'__ctx>> for PatKind<'tcx>

source§

fn hash_stable( &self, __hcx: &mut StableHashingContext<'__ctx>, __hasher: &mut StableHasher )

Auto Trait Implementations§

§

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

source§

const ALIGN: Alignment = _

Alignment of Self.
source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T, R> CollectAndApply<T, R> for T

source§

fn collect_and_apply<I, F>(iter: I, f: F) -> Rwhere I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

§

type Output = R

source§

impl<Tcx, T> DepNodeParams<Tcx> for Twhere Tcx: DepContext, T: for<'a> HashStable<StableHashingContext<'a>> + Debug,

source§

default fn fingerprint_style() -> FingerprintStyle

source§

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).
source§

default fn to_debug_str(&self, _: Tcx) -> String

source§

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 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.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

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

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<P> IntoQueryParam<P> for P

source§

impl<T> MaybeResult<T> for T

§

type Error = !

source§

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

source§

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

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

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

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

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

impl<'tcx, T> ToPredicate<'tcx, T> for T

source§

fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

source§

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

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

impl<Tcx, T> Value<Tcx> for Twhere Tcx: DepContext,

source§

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: 48 bytes

Size for each variant:

  • Wild: 0 bytes
  • AscribeUserType: 47 bytes
  • Binding: 31 bytes
  • Variant: 47 bytes
  • Leaf: 31 bytes
  • Deref: 15 bytes
  • Constant: 47 bytes
  • Range: 15 bytes
  • Slice: 47 bytes
  • Array: 47 bytes
  • Or: 23 bytes