# Struct rustc_type_ir::search_graph::SearchGraph

source ·

    pub struct SearchGraph<D: Delegate<Cx = X>, X: Cx = X> {
        mode: SolverMode,
        stack: IndexVec<StackDepth, StackEntry<X>>,
        provisional_cache: HashMap<X::Input, ProvisionalCacheEntry<X>>,
        _marker: PhantomData<D>,
    }

## Fields§

§`mode: SolverMode`§`stack: IndexVec<StackDepth, StackEntry<X>>`

The stack of goals currently being computed.

An element is deeper in the stack if its index is lower.

§`provisional_cache: HashMap<X::Input, ProvisionalCacheEntry<X>>`§`_marker: PhantomData<D>`

## Implementations§

source§

### impl<D: Delegate<Cx = X>, X: Cx> SearchGraph<D>

source

#### pub(super) fn check_invariants(&self)

source§

### impl<D: Delegate<Cx = X>, X: Cx> SearchGraph<D>

source

#### pub fn new(mode: SolverMode) -> SearchGraph<D>

source

#### pub fn solver_mode(&self) -> SolverMode

source

#### fn update_parent_goal( &mut self, reached_depth: StackDepth, encountered_overflow: bool, )

source

#### pub fn is_empty(&self) -> bool

source

#### fn stack_coinductive_from( cx: X, stack: &IndexVec<StackDepth, StackEntry<X>>, head: StackDepth, ) -> bool

source

#### fn tag_cycle_participants( stack: &mut IndexVec<StackDepth, StackEntry<X>>, usage_kind: Option<UsageKind>, head: StackDepth, )

source

#### fn clear_dependent_provisional_results( provisional_cache: &mut HashMap<X::Input, ProvisionalCacheEntry<X>>, head: StackDepth, )

source

#### pub fn with_new_goal( &mut self, cx: X, input: X::Input, inspect: &mut D::ProofTreeBuilder, prove_goal: impl FnMut(&mut Self, &mut D::ProofTreeBuilder) -> X::Result, ) -> X::Result

Probably the most involved method of the whole solver.

Given some goal which is proven via the `prove_goal` closure, this handles caching, overflow, and coinductive cycles.

source

#### fn lookup_global_cache( &mut self, cx: X, input: X::Input, available_depth: AvailableDepth, inspect: &mut D::ProofTreeBuilder, ) -> Option<X::Result>

Try to fetch a previously computed result from the global cache, making sure to only do so if it would match the result of reevaluating this goal.

source§

### impl<D: Delegate<Cx = X>, X: Cx> SearchGraph<D>

source

#### fn fixpoint_step_in_task<F>( &mut self, cx: X, input: X::Input, inspect: &mut D::ProofTreeBuilder, prove_goal: &mut F, ) -> StepResult<X>
where F: FnMut(&mut Self, &mut D::ProofTreeBuilder) -> X::Result,

When we encounter a coinductive cycle, we have to fetch the result of that cycle while we are still computing it. Because of this we continuously recompute the cycle until the result of the previous iteration is equal to the final result, at which point we are done.

## Auto Trait Implementations§

§

### impl<D, X> DynSend for SearchGraph<D, X>
where <X as Cx>::Input: DynSend, D: DynSend, <X as Cx>::Result: DynSend,

§

### impl<D, X> DynSync for SearchGraph<D, X>
where <X as Cx>::Input: DynSync, D: DynSync, <X as Cx>::Result: DynSync,

§

### impl<D, X> Freeze for SearchGraph<D, X>

§

### impl<D, X> RefUnwindSafe for SearchGraph<D, X>
where D: RefUnwindSafe, <X as Cx>::Input: RefUnwindSafe, <X as Cx>::Result: RefUnwindSafe,

§

### impl<D, X> Send for SearchGraph<D, X>
where D: Send, <X as Cx>::Input: Send, <X as Cx>::Result: Send,

§

### impl<D, X> Sync for SearchGraph<D, X>
where D: Sync, <X as Cx>::Input: Sync, <X as Cx>::Result: Sync,

§

### impl<D, X> Unpin for SearchGraph<D, X>
where D: Unpin, <X as Cx>::Input: Unpin, <X as Cx>::Result: Unpin,

§

### impl<D, X> UnwindSafe for SearchGraph<D, X>
where <X as Cx>::Input: UnwindSafe, D: UnwindSafe, <X as Cx>::Result: 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
source§

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

source§

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

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

§

#### type Output = T

Should always be `Self`
source§

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

§

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

§

#### 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.
source§

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

source§

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

source§

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

source§

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

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<'a, T> Captures<'a> for T
where 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: 64 bytes