pub struct CacheData<'tcx> {
pub result: QueryResult<'tcx>,
pub proof_tree: Option<&'tcx [GoalEvaluationStep<'tcx>]>,
pub reached_depth: usize,
pub encountered_overflow: bool,
}
Fields§
§result: QueryResult<'tcx>
§proof_tree: Option<&'tcx [GoalEvaluationStep<'tcx>]>
§reached_depth: usize
§encountered_overflow: bool
Trait Implementations§
source§impl<'tcx> PartialEq for CacheData<'tcx>
impl<'tcx> PartialEq for CacheData<'tcx>
impl<'tcx> Eq for CacheData<'tcx>
impl<'tcx> StructuralPartialEq for CacheData<'tcx>
Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for CacheData<'tcx>
impl<'tcx> !Send for CacheData<'tcx>
impl<'tcx> !Sync for CacheData<'tcx>
impl<'tcx> Unpin for CacheData<'tcx>
impl<'tcx> !UnwindSafe for CacheData<'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<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_error: &CycleError, _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: 72 bytes