Struct chalk_ir::ProgramClauses

source · [−]

pub struct ProgramClauses<I: Interner> { /* private fields */ }

Expand description

List of interned elements.

Implementations

source

impl<I: Interner> ProgramClauses

source

pub fn interned(&self) -> &I::InternedProgramClauses

Get the interned elements.

source

pub fn as_slice(&self, interner: I) -> &[ProgramClause]

Returns a slice containing the elements.

source

pub fn at(&self, interner: I, index: usize) -> &ProgramClause

Index into the sequence.

source

pub fn empty(interner: I) -> Self

Create an empty sequence.

source

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

Check whether this is an empty sequence.

source

pub fn iter(&self, interner: I) -> Iter<'_, ProgramClause>

Get an iterator over the elements of the sequence.

source

pub fn len(&self, interner: I) -> usize

Get the length of the sequence.

source

impl<I: Interner> ProgramClauses

source

pub fn from_fallible<E>(
interner: I,
elements: impl IntoIterator<Item = Result<impl CastTo<ProgramClause>, E>>
) -> Result<Self, E>

Tries to create a sequence using an iterator of element-like things.

source

pub fn from_iter(
interner: I,
elements: impl IntoIterator<Item = impl CastTo<ProgramClause>>
) -> Self

Create a sequence from elements

source

pub fn from1(interner: I, element: impl CastTo<ProgramClause>) -> Self

Create a sequence from a single element.

Trait Implementations

source

impl<I: Clone + Interner> Clone for ProgramClauses where
I::InternedProgramClauses: Clone,

source

fn clone(&self) -> ProgramClauses

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 ProgramClauses

source

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

Formats the value using the given formatter. Read more

source

impl<I: Interner> Fold for ProgramClauses

type Result = ProgramClauses

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 ProgramClauses

type Interner = I

The interner associated with the type.

source

impl<I: Hash + Interner> Hash for ProgramClauses where
I::InternedProgramClauses: Hash,

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: Ord + Interner> Ord for ProgramClauses where
I::InternedProgramClauses: Ord,

source

fn cmp(&self, other: &ProgramClauses) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 · source

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values. Read more

1.21.0 · source

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval. Read more

source

impl<I: PartialEq + Interner> PartialEq<ProgramClauses> for ProgramClauses where
I::InternedProgramClauses: PartialEq,

source

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

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

source

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

This method tests for !=.

source

impl<I: PartialOrd + Interner> PartialOrd<ProgramClauses> for ProgramClauses where
I::InternedProgramClauses: PartialOrd,

source

fn partial_cmp(&self, other: &ProgramClauses) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more

1.0.0 · source

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

This method tests less than (for self and other) and is used by the < operator. Read more

1.0.0 · source

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

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

1.0.0 · source

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

This method tests greater than (for self and other) and is used by the > operator. Read more

1.0.0 · source

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

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

source

impl<I: Interner> Visit for ProgramClauses

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 ProgramClauses

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: Copy + Interner> Copy for ProgramClauses where
I::InternedProgramClauses: Copy,

source

impl<I: Eq + Interner> Eq for ProgramClauses where
I::InternedProgramClauses: Eq,

source

impl<I: Interner> StructuralEq for ProgramClauses

source

impl<I: Interner> StructuralPartialEq for ProgramClauses

Auto Trait Implementations

impl RefUnwindSafe for ProgramClauses where
::InternedProgramClauses: RefUnwindSafe,

impl Send for ProgramClauses where
::InternedProgramClauses: Send,

impl Sync for ProgramClauses where
::InternedProgramClauses: Sync,

impl Unpin for ProgramClauses where
::InternedProgramClauses: Unpin,

impl UnwindSafe for ProgramClauses where
::InternedProgramClauses: 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::ProgramClauses

Implementations

impl<I: Interner> ProgramClauses<I>

pub fn interned(&self) -> &I::InternedProgramClauses

pub fn as_slice(&self, interner: I) -> &[ProgramClause<I>]

pub fn at(&self, interner: I, index: usize) -> &ProgramClause<I>

pub fn empty(interner: I) -> Self

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

pub fn iter(&self, interner: I) -> Iter<'_, ProgramClause<I>>

pub fn len(&self, interner: I) -> usize

impl<I: Interner> ProgramClauses<I>

pub fn from_fallible<E>( interner: I, elements: impl IntoIterator<Item = Result<impl CastTo<ProgramClause<I>>, E>>) -> Result<Self, E>

pub fn from_iter( interner: I, elements: impl IntoIterator<Item = impl CastTo<ProgramClause<I>>>) -> Self

pub fn from1(interner: I, element: impl CastTo<ProgramClause<I>>) -> Self

Trait Implementations

impl<I: Clone + Interner> Clone for ProgramClauses<I> where I::InternedProgramClauses: Clone,

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

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

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

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

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

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

type Interner = I

impl<I: Hash + Interner> Hash for ProgramClauses<I> where I::InternedProgramClauses: Hash,

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

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

impl<I: Ord + Interner> Ord for ProgramClauses<I> where I::InternedProgramClauses: Ord,

fn cmp(&self, other: &ProgramClauses<I>) -> Ordering

fn max(self, other: Self) -> Self

fn min(self, other: Self) -> Self

fn clamp(self, min: Self, max: Self) -> Self

impl<I: PartialEq + Interner> PartialEq<ProgramClauses<I>> for ProgramClauses<I> where I::InternedProgramClauses: PartialEq,

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

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

impl<I: PartialOrd + Interner> PartialOrd<ProgramClauses<I>> for ProgramClauses<I> where I::InternedProgramClauses: PartialOrd,

fn partial_cmp(&self, other: &ProgramClauses<I>) -> Option<Ordering>

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

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

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

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

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

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

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

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

impl<I: Copy + Interner> Copy for ProgramClauses<I> where I::InternedProgramClauses: Copy,

impl<I: Eq + Interner> Eq for ProgramClauses<I> where I::InternedProgramClauses: Eq,

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

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

Auto Trait Implementations

impl<I> RefUnwindSafe for ProgramClauses<I> where <I as Interner>::InternedProgramClauses: RefUnwindSafe,

impl<I> Send for ProgramClauses<I> where <I as Interner>::InternedProgramClauses: Send,

impl<I> Sync for ProgramClauses<I> where <I as Interner>::InternedProgramClauses: Sync,

impl<I> Unpin for ProgramClauses<I> where <I as Interner>::InternedProgramClauses: Unpin,

impl<I> UnwindSafe for ProgramClauses<I> where <I as Interner>::InternedProgramClauses: UnwindSafe,

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)

pub fn from_fallible<E>(
interner: I,
elements: impl IntoIterator<Item = Result<impl CastTo<ProgramClause<I>>, E>>
) -> Result<Self, E>

pub fn from_iter(
interner: I,
elements: impl IntoIterator<Item = impl CastTo<ProgramClause<I>>>
) -> Self

impl<I: Clone + Interner> Clone for ProgramClauses<I> where
I::InternedProgramClauses: Clone,

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

impl<I: Hash + Interner> Hash for ProgramClauses<I> where
I::InternedProgramClauses: Hash,

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

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

impl<I: Ord + Interner> Ord for ProgramClauses<I> where
I::InternedProgramClauses: Ord,

impl<I: PartialEq + Interner> PartialEq<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialEq,

impl<I: PartialOrd + Interner> PartialOrd<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialOrd,

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: Copy + Interner> Copy for ProgramClauses<I> where
I::InternedProgramClauses: Copy,

impl<I: Eq + Interner> Eq for ProgramClauses<I> where
I::InternedProgramClauses: Eq,

impl<I> RefUnwindSafe for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: RefUnwindSafe,

impl<I> Send for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: Send,

impl<I> Sync for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: Sync,

impl<I> Unpin for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: Unpin,

impl<I> UnwindSafe for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: UnwindSafe,

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