pub(super) struct SearchGraphDelegate<D: SolverDelegate> {
_marker: PhantomData<D>,
}
Expand description
This type is never constructed. We only use it to implement search_graph::Delegate
for all types which impl SolverDelegate
and doing it directly fails in coherence.
Fields§
§_marker: PhantomData<D>
Trait Implementations§
source§impl<D, I> Delegate for SearchGraphDelegate<D>where
D: SolverDelegate<Interner = I>,
I: Interner,
impl<D, I> Delegate for SearchGraphDelegate<D>where
D: SolverDelegate<Interner = I>,
I: Interner,
type Cx = I
source§const ENABLE_PROVISIONAL_CACHE: bool = true
const ENABLE_PROVISIONAL_CACHE: bool = true
Whether to use the provisional cache. Set to
false
by a fuzzer when
validating the search graph.type ValidationScope = Infallible
source§fn enter_validation_scope(
_cx: Self::Cx,
_input: CanonicalInput<I>,
) -> Option<Self::ValidationScope>
fn enter_validation_scope( _cx: Self::Cx, _input: CanonicalInput<I>, ) -> Option<Self::ValidationScope>
Returning
Some
disables the global cache for the current goal. Read moreconst FIXPOINT_STEP_LIMIT: usize = 8usize
type ProofTreeBuilder = ProofTreeBuilder<D, I>
fn inspect_is_noop(inspect: &mut Self::ProofTreeBuilder) -> bool
const DIVIDE_AVAILABLE_DEPTH_ON_OVERFLOW: usize = 4usize
fn recursion_limit(cx: I) -> usize
fn initial_provisional_result( cx: I, kind: PathKind, input: CanonicalInput<I>, ) -> QueryResult<I>
fn is_initial_provisional_result( cx: Self::Cx, kind: PathKind, input: CanonicalInput<I>, result: QueryResult<I>, ) -> bool
fn on_stack_overflow( cx: I, inspect: &mut ProofTreeBuilder<D>, input: CanonicalInput<I>, ) -> QueryResult<I>
fn on_fixpoint_overflow(cx: I, input: CanonicalInput<I>) -> QueryResult<I>
fn is_ambiguous_result(result: QueryResult<I>) -> bool
fn propagate_ambiguity( cx: I, for_input: CanonicalInput<I>, from_result: QueryResult<I>, ) -> QueryResult<I>
fn step_is_coinductive(cx: I, input: CanonicalInput<I>) -> bool
Auto Trait Implementations§
impl<D> Freeze for SearchGraphDelegate<D>
impl<D> RefUnwindSafe for SearchGraphDelegate<D>
impl<D> Send for SearchGraphDelegate<D>
impl<D> Sync for SearchGraphDelegate<D>
impl<D> Unpin for SearchGraphDelegate<D>
impl<D> UnwindSafe for SearchGraphDelegate<D>
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<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>
Converts
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>
Converts
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<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<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,
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: 0 bytes