## SolverRelating

# Struct SolverRelating

    pub struct SolverRelating<'infcx, Infcx, I>where
        I: Interner,{
        infcx: &'infcx Infcx,
        structurally_relate_aliases: StructurallyRelateAliases,
        param_env: <I as Interner>::ParamEnv,
        span: <I as Interner>::Span,
        ambient_variance: Variance,
        goals: Vec<Goal<I, <I as Interner>::Predicate>>,
        cache: DelayedSet<(Variance, <I as Interner>::Ty, <I as Interner>::Ty)>,
    }

Expand description

Enforce that `a` is equal to or a subtype of `b`.

## Fields§

§`infcx: &'infcx Infcx`§`structurally_relate_aliases: StructurallyRelateAliases`§`param_env: <I as Interner>::ParamEnv`§`span: <I as Interner>::Span`§`ambient_variance: Variance`§`goals: Vec<Goal<I, <I as Interner>::Predicate>>`§`cache: DelayedSet<(Variance, <I as Interner>::Ty, <I as Interner>::Ty)>`

## Implementations§

§

### impl<'infcx, Infcx, I> SolverRelating<'infcx, Infcx, I>
where Infcx: InferCtxtLike<Interner = I>, I: Interner,

#### pub fn new( infcx: &'infcx Infcx, structurally_relate_aliases: StructurallyRelateAliases, ambient_variance: Variance, param_env: <I as Interner>::ParamEnv, span: <I as Interner>::Span, ) -> SolverRelating<'infcx, Infcx, I>

## Trait Implementations§

§

### impl<Infcx, I> PredicateEmittingRelation<Infcx> for SolverRelating<'_, Infcx, I>
where Infcx: InferCtxtLike<Interner = I>, I: Interner,

§

#### fn span(&self) -> <I as Interner>::Span

§

#### fn param_env(&self) -> <I as Interner>::ParamEnv

§

#### fn structurally_relate_aliases(&self) -> StructurallyRelateAliases

Whether aliases should be related structurally. This is pretty much always `No` unless you’re equating in some specific locations of the new solver. See the comments in these use-cases for more details.
§

#### fn register_predicates( &mut self, obligations: impl IntoIterator>, )
where <impl IntoIterator as IntoIterator>::Item: Upcast<I, <I as Interner>::Predicate>,

Register predicates that must hold in order for this relation to hold. This uses the default `param_env` of the obligation.
§

#### fn register_goals( &mut self, obligations: impl IntoIterator<Item = Goal<I, <I as Interner>::Predicate>>, )

Register obligations that must hold in order for this relation to hold
§

#### fn register_alias_relate_predicate( &mut self, a: <I as Interner>::Ty, b: <I as Interner>::Ty, )

Register `AliasRelate` obligation(s) that both types must be related to each other.
§

### impl<Infcx, I> TypeRelation<I> for SolverRelating<'_, Infcx, I>
where Infcx: InferCtxtLike<Interner = I>, I: Interner,

§

#### fn cx(&self) -> I

§

#### fn relate_ty_args( &mut self, a_ty: <I as Interner>::Ty, b_ty: <I as Interner>::Ty, def_id: <I as Interner>::DefId, a_args: <I as Interner>::GenericArgs, b_args: <I as Interner>::GenericArgs, _: impl FnOnce(<I as Interner>::GenericArgs) -> <I as Interner>::Ty, ) -> Result<<I as Interner>::Ty, TypeError<I>>

§

#### fn relate_with_variance<T>( &mut self, variance: Variance, _info: VarianceDiagInfo<I>, a: T, b: T, ) -> Result<T, TypeError<I>>
where T: Relate<I>,

Switch variance for the purpose of relating `a` and `b`.
§

#### fn tys( &mut self, a: <I as Interner>::Ty, b: <I as Interner>::Ty, ) -> Result<<I as Interner>::Ty, TypeError<I>>

§

#### fn regions( &mut self, a: <I as Interner>::Region, b: <I as Interner>::Region, ) -> Result<<I as Interner>::Region, TypeError<I>>

§

#### fn consts( &mut self, a: <I as Interner>::Const, b: <I as Interner>::Const, ) -> Result<<I as Interner>::Const, TypeError<I>>

§

#### fn binders<T>( &mut self, a: Binder<I, T>, b: Binder<I, T>, ) -> Result<Binder<I, T>, TypeError<I>>
where T: Relate<I>,

§

#### fn relate<T>(&mut self, a: T, b: T) -> Result<T, TypeError<I>>
where T: Relate<I>,

Generic relation routine suitable for most anything.

## Auto Trait Implementations§

§

### impl<'infcx, Infcx, I> DynSend for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: DynSend, <I as Interner>::Span: DynSend, Infcx: DynSync, <I as Interner>::Predicate: DynSend, <I as Interner>::Ty: DynSend,

§

### impl<'infcx, Infcx, I> DynSync for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: DynSync, <I as Interner>::Span: DynSync, Infcx: DynSync, <I as Interner>::Predicate: DynSync, <I as Interner>::Ty: DynSync,

§

### impl<'infcx, Infcx, I> Freeze for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: Freeze, <I as Interner>::Span: Freeze,

§

### impl<'infcx, Infcx, I> RefUnwindSafe for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: RefUnwindSafe, <I as Interner>::Span: RefUnwindSafe, Infcx: RefUnwindSafe, <I as Interner>::Predicate: RefUnwindSafe, <I as Interner>::Ty: RefUnwindSafe,

§

### impl<'infcx, Infcx, I> Send for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: Send, <I as Interner>::Span: Send, Infcx: Sync, <I as Interner>::Predicate: Send, <I as Interner>::Ty: Send,

§

### impl<'infcx, Infcx, I> Sync for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: Sync, <I as Interner>::Span: Sync, Infcx: Sync, <I as Interner>::Predicate: Sync, <I as Interner>::Ty: Sync,

§

### impl<'infcx, Infcx, I> Unpin for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: Unpin, <I as Interner>::Span: Unpin, <I as Interner>::Predicate: Unpin, <I as Interner>::Ty: Unpin,

§

### impl<'infcx, Infcx, I> UnwindSafe for SolverRelating<'infcx, Infcx, I>
where <I as Interner>::ParamEnv: UnwindSafe, <I as Interner>::Span: UnwindSafe, Infcx: RefUnwindSafe, <I as Interner>::Predicate: UnwindSafe, <I as Interner>::Ty: UnwindSafe,

## Blanket Implementations§

§

### impl<T> Aligned for T

§

#### const ALIGN: Alignment

Alignment of `Self`.
§

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

§

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

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

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

§

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

Immutably borrows from an owned value. Read more
§

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

§

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

§

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

§

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

Returns the argument unchanged.

§

### impl<T> Instrument for T

§

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

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

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

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

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

§

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

Calls `U::from(self)`.

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

§

### impl<T> IntoEither for T

§

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

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

### impl<P> IntoQueryParam<P> for P

§

#### fn into_query_param(self) -> P

§

### impl<T> MaybeResult<T> for T

§

#### type Error = !

§

#### fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

§

#### fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

§

### impl<T> Pointable for T

§

#### const ALIGN: usize

The alignment of pointer.
§

#### type Init = T

The type for initializers.
§

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

Initializes a with the given initializer. Read more
§

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

Dereferences the given pointer. Read more
§

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

Mutably dereferences the given pointer. Read more
§

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

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

### impl<T> Same for T

§

#### type Output = T

Should always be `Self`
§

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

§

#### type Error = Infallible

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

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

Performs the conversion.
§

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

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

§

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

§

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

§

### impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

§

#### default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T

§

### impl<T> WithSubscriber for T

§

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

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

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

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

## Layout§

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.