Struct rustc_next_trait_solver::solve::search_graph::SearchGraphDelegate

pub(super) struct SearchGraphDelegate<D: SolverDelegate> {
    _marker: PhantomData<D>,
}

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

impl<D, I> Delegate for SearchGraphDelegate<D>

where D: SolverDelegate<Interner = I>, I: Interner,

type Cx = I

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

fn enter_validation_scope( _cx: Self::Cx, _input: CanonicalInput<I>, ) -> Option<Self::ValidationScope>

Returning Some disables the global cache for the current goal.

const 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

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