Struct rustc_trait_selection::solve::search_graph::DetachedEntry
source · struct DetachedEntry<'tcx> {
head: StackDepth,
result: QueryResult<'tcx>,
}Expand description
The provisional result for a goal which is not on the stack.
Fields§
§head: StackDepthThe head of the smallest non-trivial cycle involving this entry.
Given the following rules, when proving A the head for
the provisional entry of C would be B.
A :- B
B :- C
C :- A + B + C
result: QueryResult<'tcx>Auto Trait Implementations§
impl<'tcx> !RefUnwindSafe for DetachedEntry<'tcx>
impl<'tcx> Send for DetachedEntry<'tcx>
impl<'tcx> Sync for DetachedEntry<'tcx>
impl<'tcx> Unpin for DetachedEntry<'tcx>
impl<'tcx> !UnwindSafe for DetachedEntry<'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
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