Struct chalk_ir::ProgramClauseImplication

source · [−]

pub struct ProgramClauseImplication<I: Interner> {
    pub consequence: DomainGoal<I>,
    pub conditions: Goals<I>,
    pub constraints: Constraints<I>,
    pub priority: ClausePriority,
}

Expand description

Represents one clause of the form consequence :- conditions where conditions = cond_1 && cond_2 && ... is the conjunction of the individual conditions.

Fields

consequence: DomainGoal

The consequence of the clause, which holds if the conditions holds.

conditions: Goals

The condition goals that should hold.

constraints: Constraints

The lifetime constraints that should be proven.

priority: ClausePriority

The relative priority of the implication.

Implementations

source

impl<I: Interner> ProgramClauseImplication

source

pub fn debug(&self, interner: I) -> ProgramClauseImplicationDebug<'_, I>

Show debug output for the program clause implication.

source

impl<I: Interner> ProgramClauseImplication

source

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

Change the implication into an application holding a FromEnv goal.

Trait Implementations

source

impl<I: Clone + Interner> Clone for ProgramClauseImplication

source

fn clone(&self) -> ProgramClauseImplication

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> Debug for ProgramClauseImplication

source

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

Formats the value using the given formatter. Read more

source

impl<I: Interner> Fold for ProgramClauseImplication

type Result = ProgramClauseImplication

The type of value that will be produced once folding is done. Typically this is Self, unless Self contains borrowed values, in which case owned values are produced (for example, one can fold over a &T value where T: Fold, in which case you get back a T, not a &T). Read more

source

fn fold_with<E>(
 self,
 folder: &mut dyn Folder<I, Error = E>,
 outer_binder: DebruijnIndex
) -> Result<Self::Result, 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. Read more

source

impl<I: Interner> HasInterner for ProgramClauseImplication

type Interner = I

The interner associated with the type.

source

impl<I: Hash + Interner> Hash for ProgramClauseImplication

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,

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

source

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

source

fn eq(&self, other: &ProgramClauseImplication) -> bool

This method tests for self and other values to be equal, and is used by ==. Read more

source

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

This method tests for !=.

source

impl<I: Interner> Visit for ProgramClauseImplication

source

fn visit_with(
 &self,
 visitor: &mut dyn Visitor<I, BreakTy = B>,
 outer_binder: DebruijnIndex
) -> ControlFlow

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

source

impl<I: Interner> Zip for ProgramClauseImplication

source

fn zip_with<Z: Zipper>(
 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 ProgramClauseImplication

source

impl<I: Interner> StructuralEq for ProgramClauseImplication

source

impl<I: Interner> StructuralPartialEq for ProgramClauseImplication

Auto Trait Implementations

impl RefUnwindSafe for ProgramClauseImplication where
 ::DefId: RefUnwindSafe,
 ::InternedConstraints: RefUnwindSafe,
 ::InternedGoals: RefUnwindSafe,
 ::InternedLifetime: RefUnwindSafe,
 ::InternedSubstitution: RefUnwindSafe,
 ::InternedType: RefUnwindSafe,

impl Send for ProgramClauseImplication where
 ::DefId: Send,
 ::InternedConstraints: Send,
 ::InternedGoals: Send,
 ::InternedLifetime: Send,
 ::InternedSubstitution: Send,
 ::InternedType: Send,

impl Sync for ProgramClauseImplication where
 ::DefId: Sync,
 ::InternedConstraints: Sync,
 ::InternedGoals: Sync,
 ::InternedLifetime: Sync,
 ::InternedSubstitution: Sync,
 ::InternedType: Sync,

impl Unpin for ProgramClauseImplication where
 ::DefId: Unpin,
 ::InternedConstraints: Unpin,
 ::InternedGoals: Unpin,
 ::InternedLifetime: Unpin,
 ::InternedSubstitution: Unpin,
 ::InternedType: Unpin,

impl UnwindSafe for ProgramClauseImplication where
 ::DefId: UnwindSafe,
 ::InternedConstraints: UnwindSafe,
 ::InternedGoals: UnwindSafe,
 ::InternedLifetime: UnwindSafe,
 ::InternedSubstitution: UnwindSafe,
 ::InternedType: UnwindSafe,

Blanket Implementations

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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · 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(self, interner: U::Interner) -> U where
Self: CastTo,
U: HasInterner,

Cast a value to type U using CastTo.

source

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

source

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

Checks whether self and other could possibly match.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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 for T where
T: Fold,
I: Interner,

source

fn shifted_in(self, interner: I) -> <T as Fold>::Result

Shifts this term in one level of binders.

source

fn shifted_in_from(
 self,
 interner: I,
 source_binder: DebruijnIndex
) -> <T as Fold>::Result

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. Read more

source

fn shifted_out_to(
 self,
 interner: I,
 target_binder: DebruijnIndex
) -> Result<<T as Fold>::Result, 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. Read more

source

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

Shifts this term out one level of binders.

source

impl<T> ToOwned for T where
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)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

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

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<T, I> VisitExt for T where
I: Interner,
T: Visit,

source

fn has_free_vars(&self, interner: I) -> bool

Check whether there are free (non-bound) variables.

Struct chalk_ir::ProgramClauseImplication

Fields

Implementations

impl<I: Interner> ProgramClauseImplication<I>

pub fn debug(&self, interner: I) -> ProgramClauseImplicationDebug<'_, I>

impl<I: Interner> ProgramClauseImplication<I>

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

Trait Implementations

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

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

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

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

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

impl<I: Interner> Fold<I> for ProgramClauseImplication<I>

type Result = ProgramClauseImplication<I>

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

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

type Interner = I

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

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

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

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

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

fn ne(&self, other: &ProgramClauseImplication<I>) -> bool

impl<I: Interner> Visit<I> for ProgramClauseImplication<I>

fn visit_with<B>( &self, visitor: &mut dyn Visitor<I, BreakTy = B>, outer_binder: DebruijnIndex) -> ControlFlow<B>

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

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

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

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

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

Auto Trait Implementations

impl<I> Send for ProgramClauseImplication<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,

impl<I> Sync for ProgramClauseImplication<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,

impl<I> Unpin for ProgramClauseImplication<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,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> Cast for T

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

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T, I> Shift<I> for T where T: Fold<I>, I: Interner,

fn shifted_in(self, interner: I) -> <T as Fold<I>>::Result

fn shifted_in_from( self, interner: I, source_binder: DebruijnIndex) -> <T as Fold<I>>::Result

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

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

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

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

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

type Error = Infallible

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

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

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

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

impl<T, I> VisitExt<I> for T where I: Interner, T: Visit<I>,

fn has_free_vars(&self, interner: I) -> bool

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

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

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

fn visit_with<B>(
&self,
visitor: &mut dyn Visitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>

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

impl<I> Send for ProgramClauseImplication<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,

impl<I> Sync for ProgramClauseImplication<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,

impl<I> Unpin for ProgramClauseImplication<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,

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

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

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

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

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

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

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

impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,

fn shifted_in_from(
self,
interner: I,
source_binder: DebruijnIndex
) -> <T as Fold<I>>::Result

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

impl<T> ToOwned for T where
T: Clone,

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

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

impl<T, I> VisitExt<I> for T where
I: Interner,
T: Visit<I>,