Struct chalk_ir::ProgramClauseImplication[−][src]

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

[src]

impl<I: Interner> ProgramClauseImplication

[src]

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

Show debug output for the program clause implication.

[src]

impl<I: Interner> ProgramClauseImplication

[src]

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

Change the implication into an application holding a FromEnv goal.

Trait Implementations

[src]

impl<I: Clone + Interner> Clone for ProgramClauseImplication

[src]

fn clone(&self) -> ProgramClauseImplication

Returns a copy of the value. Read more

1.0.0[src]

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

Performs copy-assignment from source. Read more

[src]

impl<I: Interner> Debug for ProgramClauseImplication

[src]

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

Formats the value using the given formatter. Read more

[src]

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

[src]

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

[src]

impl<I: Interner> HasInterner for ProgramClauseImplication

type Interner = I

The interner associated with the type.

[src]

impl<I: Hash + Interner> Hash for ProgramClauseImplication

[src]

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

Feeds this value into the given Hasher. Read more

1.3.0[src]

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

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

[src]

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

[src]

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

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

[src]

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

This method tests for !=.

[src]

impl<I: Interner> Visit for ProgramClauseImplication

[src]

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

[src]

impl<I: Interner> Zip for ProgramClauseImplication

[src]

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.

[src]

impl<I: Eq + Interner> Eq for ProgramClauseImplication

[src]

impl<I: Interner> StructuralEq for ProgramClauseImplication

[src]

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

[src]

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

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

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

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

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

[src]

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

Mutably borrows from an owned value. Read more

[src]

impl<T> Cast for T

[src]

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

Cast a value to type U using CastTo.

[src]

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

[src]

pub fn could_match(&Self, I, &dyn UnificationDatabase, &T) -> bool

Checks whether self and other could possibly match.

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

[src]

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

[src]

pub fn into(self) -> U

Performs the conversion.

[src]

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

[src]

pub fn shifted_in(Self, I) -> <T as Fold>::Result

Shifts this term in one level of binders.

[src]

pub fn shifted_in_from(Self, I, 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

[src]

pub fn shifted_out_to(
 Self,
 I,
 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

[src]

pub fn shifted_out(Self, I) -> Result<<T as Fold>::Result, NoSolution>

Shifts this term out one level of binders.

[src]

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

type Owned = T

The resulting type after obtaining ownership.

[src]

pub fn to_owned(&self) -> T

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

[src]

pub 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

[src]

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

type Error = Infallible

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

[src]

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

type Error = >::Error

The type returned in the event of a conversion error.

[src]

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

Performs the conversion.

[src]

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

[src]

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

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

Struct chalk_ir::ProgramClauseImplication[−][src]

Fields

Implementations

impl<I: Interner> ProgramClauseImplication<I>

pub fn debug<'a>(&'a self, interner: I) -> ProgramClauseImplicationDebug<'a, 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,

pub fn type_id(&self) -> TypeId

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

pub fn borrow(&self) -> &T

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

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

pub fn could_match(&Self, I, &dyn UnificationDatabase<I>, &T) -> bool

impl<T> From<T> for T

pub fn from(t: T) -> T

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

pub fn into(self) -> U

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

pub fn shifted_in(Self, I) -> <T as Fold<I>>::Result

pub fn shifted_in_from(Self, I, DebruijnIndex) -> <T as Fold<I>>::Result

pub fn shifted_out_to( Self, I, DebruijnIndex) -> Result<<T as Fold<I>>::Result, NoSolution>

pub fn shifted_out(Self, I) -> Result<<T as Fold<I>>::Result, NoSolution>

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

type Owned = T

pub fn to_owned(&self) -> T

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

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

type Error = Infallible

pub 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

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

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

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

pub fn shifted_out_to(
Self,
I,
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>,