Struct chalk_ir::ProgramClauseData

source · [−]

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

Expand description

Contains the data for a program clause.

Tuple Fields

0: Binders<ProgramClauseImplication>

Implementations

source

impl<I: Interner> ProgramClauseData

source

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

Change the program clause data into a FromEnv program clause.

source

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

Intern the program clause data.

Trait Implementations

source

impl<I: Clone + Interner> Clone for ProgramClauseData

source

fn clone(&self) -> ProgramClauseData

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> for ProgramClauseData

source

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

Checks whether self and other could possibly match.

source

impl<I: Interner> Debug for ProgramClauseData

source

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

Formats the value using the given formatter. Read more

source

impl<I: Interner> Fold for ProgramClauseData

type Result = ProgramClauseData

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 ProgramClauseData

type Interner = I

The interner associated with the type.

source

impl<I: Hash + Interner> Hash for ProgramClauseData

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<ProgramClauseData> for ProgramClauseData

source

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

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

source

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

This method tests for !=.

source

impl<I: Interner> SuperFold for ProgramClauseData

source

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

Recursively folds the value.

source

impl<I: Interner> Zip for ProgramClauseData

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 ProgramClauseData

source

impl<I: Interner> StructuralEq for ProgramClauseData

source

impl<I: Interner> StructuralPartialEq for ProgramClauseData

Auto Trait Implementations

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

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

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

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

impl UnwindSafe for ProgramClauseData where
 ::DefId: UnwindSafe,
 ::InternedConstraints: UnwindSafe,
 ::InternedGoals: UnwindSafe,
 ::InternedLifetime: UnwindSafe,
 ::InternedSubstitution: UnwindSafe,
 ::InternedType: UnwindSafe,
 ::InternedVariableKinds: 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.

Struct chalk_ir::ProgramClauseData

Tuple Fields

Implementations

impl<I: Interner> ProgramClauseData<I>

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

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

Trait Implementations

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

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

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

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

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

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

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

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

type Result = ProgramClauseData<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 ProgramClauseData<I>

type Interner = I

impl<I: Hash + Interner> Hash for ProgramClauseData<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<ProgramClauseData<I>> for ProgramClauseData<I>

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

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

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

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

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

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

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

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

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

Auto Trait Implementations

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>

fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &DomainGoal<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 super_fold_with<E>(
self,
folder: &mut dyn Folder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self::Result, E>

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

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