pub struct ProgramClauseData<I: Interner>(pub Binders<ProgramClauseImplication<I>>);
Expand description

Contains the data for a program clause.

Tuple Fields§

§0: Binders<ProgramClauseImplication<I>>

Implementations§

source§

impl<I: Interner> ProgramClauseData<I>

source

pub fn into_from_env_clause(self, interner: I) -> ProgramClauseData<I>

Change the program clause data into a FromEnv program clause.

source

pub fn intern(self, interner: I) -> ProgramClause<I>

Intern the program clause data.

Trait Implementations§

source§

impl<I: Clone + Interner> Clone for ProgramClauseData<I>

source§

fn clone(&self) -> ProgramClauseData<I>

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl<I: Interner> CouldMatch<DomainGoal<I>> for ProgramClauseData<I>

source§

fn could_match( &self, interner: I, db: &dyn UnificationDatabase<I>, other: &DomainGoal<I> ) -> bool

Checks whether self and other could possibly match.
source§

impl<I: Interner> Debug for ProgramClauseData<I>

source§

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
source§

impl<I: Interner> HasInterner for ProgramClauseData<I>

§

type Interner = I

The interner associated with the type.
source§

impl<I: Hash + Interner> Hash for ProgramClauseData<I>

source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · source§

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl<I: PartialEq + Interner> PartialEq for ProgramClauseData<I>

source§

fn eq(&self, other: &ProgramClauseData<I>) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl<I: Interner> TypeFoldable<I> for ProgramClauseData<I>

source§

fn try_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex ) -> Result<Self, E>

Apply the given folder folder to self; binders is the number of binders that are in scope when beginning the folder. Typically binders starts as 0, but is adjusted when we encounter Binders<T> in the IR or other similar constructs.
source§

fn fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex ) -> Self

A convenient alternative to try_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_fold_with.
source§

impl<I: Interner> TypeSuperFoldable<I> for ProgramClauseData<I>

source§

fn try_super_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex ) -> Result<Self, E>

Recursively folds the value.
source§

fn super_fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex ) -> Self

A convenient alternative to try_super_fold_with for use with infallible folders. Do not override this method, to ensure coherence with try_super_fold_with.
source§

impl<I: Interner> Zip<I> for ProgramClauseData<I>

source§

fn zip_with<Z: Zipper<I>>( zipper: &mut Z, variance: Variance, a: &Self, b: &Self ) -> Fallible<()>

Uses the zipper to walk through two values, ensuring that they match.
source§

impl<I: Eq + Interner> Eq for ProgramClauseData<I>

source§

impl<I: Interner> StructuralEq for ProgramClauseData<I>

source§

impl<I: Interner> StructuralPartialEq for ProgramClauseData<I>

Auto Trait Implementations§

§

impl<I> RefUnwindSafe for ProgramClauseData<I>where <I as Interner>::DefId: RefUnwindSafe, <I as Interner>::InternedConstraints: RefUnwindSafe, <I as Interner>::InternedGoals: RefUnwindSafe, <I as Interner>::InternedLifetime: RefUnwindSafe, <I as Interner>::InternedSubstitution: RefUnwindSafe, <I as Interner>::InternedType: RefUnwindSafe, <I as Interner>::InternedVariableKinds: RefUnwindSafe,

§

impl<I> Send for ProgramClauseData<I>where <I as Interner>::DefId: Send, <I as Interner>::InternedConstraints: Send, <I as Interner>::InternedGoals: Send, <I as Interner>::InternedLifetime: Send, <I as Interner>::InternedSubstitution: Send, <I as Interner>::InternedType: Send, <I as Interner>::InternedVariableKinds: Send,

§

impl<I> Sync for ProgramClauseData<I>where <I as Interner>::DefId: Sync, <I as Interner>::InternedConstraints: Sync, <I as Interner>::InternedGoals: Sync, <I as Interner>::InternedLifetime: Sync, <I as Interner>::InternedSubstitution: Sync, <I as Interner>::InternedType: Sync, <I as Interner>::InternedVariableKinds: Sync,

§

impl<I> Unpin for ProgramClauseData<I>where <I as Interner>::DefId: Unpin, <I as Interner>::InternedConstraints: Unpin, <I as Interner>::InternedGoals: Unpin, <I as Interner>::InternedLifetime: Unpin, <I as Interner>::InternedSubstitution: Unpin, <I as Interner>::InternedType: Unpin, <I as Interner>::InternedVariableKinds: Unpin,

§

impl<I> UnwindSafe for ProgramClauseData<I>where <I as Interner>::DefId: UnwindSafe, <I as Interner>::InternedConstraints: UnwindSafe, <I as Interner>::InternedGoals: UnwindSafe, <I as Interner>::InternedLifetime: UnwindSafe, <I as Interner>::InternedSubstitution: UnwindSafe, <I as Interner>::InternedType: UnwindSafe, <I as Interner>::InternedVariableKinds: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> Cast for T

source§

fn cast<U>(self, interner: U::Interner) -> Uwhere Self: CastTo<U>, U: HasInterner,

Cast a value to type U using CastTo.
source§

impl<T, I> CouldMatch<T> for Twhere T: Zip<I> + HasInterner<Interner = I> + ?Sized, I: Interner,

source§

fn could_match( &self, interner: I, db: &dyn UnificationDatabase<I>, other: &T ) -> bool

Checks whether self and other could possibly match.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere 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, I> Shift<I> for Twhere T: TypeFoldable<I>, I: Interner,

source§

fn shifted_in(self, interner: I) -> T

Shifts this term in one level of binders.
source§

fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T

Shifts a term valid at outer_binder so that it is valid at the innermost binder. See DebruijnIndex::shifted_in_from for a detailed explanation.
source§

fn shifted_out_to( self, interner: I, target_binder: DebruijnIndex ) -> Result<T, NoSolution>

Shifts a term valid at the innermost binder so that it is valid at outer_binder. See DebruijnIndex::shifted_out_to for a detailed explanation.
source§

fn shifted_out(self, interner: I) -> Result<T, NoSolution>

Shifts this term out one level of binders.
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere 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 Twhere 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.