SearchGraphDelegate in rustc_next_trait_solver::solve::search_graph - Rust
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.

Skip to main content

## SearchGraphDelegate

# Struct SearchGraphDelegate

Source

    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,

Source§

#### const ENABLE_PROVISIONAL_CACHE: bool = true

Whether to use the provisional cache. Set to `false` by a fuzzer when validating the search graph.
Source§

#### const FIXPOINT_STEP_LIMIT: usize = FIXPOINT_STEP_LIMIT

Source§

#### const DIVIDE_AVAILABLE_DEPTH_ON_OVERFLOW: usize = 4

Source§

#### type Cx = I

Source§

#### type ValidationScope = Infallible

Source§

#### type ProofTreeBuilder = ProofTreeBuilder<D, I>

Source§

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

Returning `Some` disables the global cache for the current goal. Read more
Source§

#### fn inspect_is_noop(inspect: &mut Self::ProofTreeBuilder) -> bool

Source§

#### fn initial_provisional_result( cx: I, kind: PathKind, input: CanonicalInput<I>, ) -> QueryResult<I>

Source§

#### fn is_initial_provisional_result(result: QueryResult<I>) -> Option<PathKind>

Source§

#### fn stack_overflow_result(cx: I, input: CanonicalInput<I>) -> QueryResult<I>

Source§

#### fn fixpoint_overflow_result(cx: I, input: CanonicalInput<I>) -> QueryResult<I>

Source§

#### fn is_ambiguous_result(result: QueryResult<I>) -> Option<Certainty>

Source§

#### fn propagate_ambiguity( cx: I, for_input: CanonicalInput<I>, certainty: Certainty, ) -> QueryResult<I>

Source§

#### fn compute_goal( search_graph: &mut SearchGraph<SearchGraphDelegate<D>>, cx: I, input: CanonicalInput<I>, inspect: &mut Self::ProofTreeBuilder, ) -> QueryResult<I>

## Auto Trait Implementations§

§

### impl<D> DynSend for SearchGraphDelegate<D>
where D: DynSend,

§

### impl<D> DynSync for SearchGraphDelegate<D>
where D: DynSync,

§

### impl<D> Freeze for SearchGraphDelegate<D>

§

### impl<D> RefUnwindSafe for SearchGraphDelegate<D>
where D: RefUnwindSafe,

§

### impl<D> Send for SearchGraphDelegate<D>
where D: Send,

§

### impl<D> Sync for SearchGraphDelegate<D>
where D: Sync,

§

### impl<D> Unpin for SearchGraphDelegate<D>
where D: Unpin,

§

### impl<D> UnsafeUnpin for SearchGraphDelegate<D>

§

### impl<D> UnwindSafe for SearchGraphDelegate<D>
where D: UnwindSafe,

## Blanket Implementations§

Source§

### impl<T> Aligned for T

Source§

#### const ALIGN: Alignment

Alignment of `Self`.
Source§

### impl<T> Any for T
where T: 'static + ?Sized,

Source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
Source§

### impl<T> Borrow<T> for T
where T: ?Sized,

Source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

### impl<T, R> CollectAndApply<T, R> for T

§

#### fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to `f(&iter.collect::<Vec<_>>())`.

§

#### type Output = R

Source§

### impl<T> From<T> for T

Source§

#### fn from(t: T) -> T

Returns the argument unchanged.

Source§

### impl<T> Instrument for T

Source§

#### fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided `Span`, returning an `Instrumented` wrapper. Read more
Source§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
Source§

### impl<T, U> Into<U> for T
where U: From<T>,

Source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

Source§

### impl<T> IntoEither for T

Source§

#### 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 more
Source§

#### fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

### impl<T> Pointable for T

Source§

#### const ALIGN: usize

The alignment of pointer.
Source§

#### type Init = T

The type for initializers.
Source§

#### unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

#### unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

#### unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

#### unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

### impl<T> Same for T

Source§

#### type Output = T

Should always be `Self`
Source§

### impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

#### type Error = Infallible

The type returned in the event of a conversion error.
Source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

### impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

### impl<I, T, U> Upcast<I, U> for T
where U: UpcastFrom<I, T>,

§

#### fn upcast(self, interner: I) -> U

§

### impl<I, T> UpcastFrom<I, T> for T

§

#### fn upcast_from(from: T, _tcx: I) -> T

Source§

### impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

#### fn vzip(self) -> V

Source§

### impl<T> WithSubscriber for T

Source§

#### fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

#### fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
Source§

### impl<T> ErasedDestructor for T
where T: 'static,

## 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