Struct rustc_pattern_analysis::usefulness::MatrixRow
source · struct MatrixRow<'p, Cx: PatCx> {
pats: PatStack<'p, Cx>,
is_under_guard: bool,
parent_row: usize,
useful: bool,
intersects: BitSet<usize>,
}Expand description
A row of the matrix.
Fields§
§pats: PatStack<'p, Cx>§is_under_guard: boolWhether the original arm had a guard. This is inherited when specializing.
parent_row: usizeWhen we specialize, we remember which row of the original matrix produced a given row of the specialized matrix. When we unspecialize, we use this to propagate usefulness back up the callstack. On creation, this stores the index of the original match arm.
useful: boolFalse when the matrix is just built. This is set to true by
compute_exhaustiveness_and_usefulness if the arm is found to be useful.
This is reset to false when specializing.
intersects: BitSet<usize>Tracks which rows above this one have an intersection with this one, i.e. such that there is a value that matches both rows. Note: Because of relevancy we may miss some intersections. The intersections we do find are correct.
Implementations§
source§impl<'p, Cx: PatCx> MatrixRow<'p, Cx>
impl<'p, Cx: PatCx> MatrixRow<'p, Cx>
fn len(&self) -> usize
fn head(&self) -> PatOrWild<'p, Cx>
fn iter(&self) -> impl Iterator<Item = PatOrWild<'p, Cx>> + Captures<'_>
fn expand_or_pat( &self, parent_row: usize, ) -> impl Iterator<Item = MatrixRow<'p, Cx>> + Captures<'_>
sourcefn pop_head_constructor(
&self,
cx: &Cx,
ctor: &Constructor<Cx>,
ctor_arity: usize,
ctor_is_relevant: bool,
parent_row: usize,
) -> Result<MatrixRow<'p, Cx>, Cx::Error>
fn pop_head_constructor( &self, cx: &Cx, ctor: &Constructor<Cx>, ctor_arity: usize, ctor_is_relevant: bool, parent_row: usize, ) -> Result<MatrixRow<'p, Cx>, Cx::Error>
This computes specialize(ctor, self). See top of the file for explanations.
Only call if ctor.is_covered_by(self.head().ctor()) is true.
Trait Implementations§
Auto Trait Implementations§
impl<'p, Cx> DynSend for MatrixRow<'p, Cx>
impl<'p, Cx> DynSync for MatrixRow<'p, Cx>
impl<'p, Cx> Freeze for MatrixRow<'p, Cx>
impl<'p, Cx> RefUnwindSafe for MatrixRow<'p, Cx>where
<Cx as PatCx>::Ty: RefUnwindSafe,
<Cx as PatCx>::PatData: RefUnwindSafe,
<Cx as PatCx>::VariantIdx: RefUnwindSafe,
<Cx as PatCx>::StrLit: RefUnwindSafe,
impl<'p, Cx> Send for MatrixRow<'p, Cx>
impl<'p, Cx> Sync for MatrixRow<'p, Cx>
impl<'p, Cx> Unpin for MatrixRow<'p, Cx>
impl<'p, Cx> UnwindSafe for MatrixRow<'p, Cx>where
<Cx as PatCx>::Ty: RefUnwindSafe,
<Cx as PatCx>::PatData: RefUnwindSafe,
<Cx as PatCx>::VariantIdx: RefUnwindSafe,
<Cx as PatCx>::StrLit: RefUnwindSafe,
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§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit)source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
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
source§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>,
source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> 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_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<'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: 80 bytes