Struct chalk_ir::ProgramClauses [−][src]
pub struct ProgramClauses<I: Interner> { /* fields omitted */ }Expand description
List of interned elements.
Implementations
Get the interned elements.
Returns a slice containing the elements.
Index into the sequence.
Get an iterator over the elements of the sequence.
pub fn from_fallible<E>(
interner: &I,
elements: impl IntoIterator<Item = Result<impl CastTo<ProgramClause<I>>, E>>
) -> Result<Self, E>
pub fn from_fallible<E>(
interner: &I,
elements: impl IntoIterator<Item = Result<impl CastTo<ProgramClause<I>>, E>>
) -> Result<Self, E>
Tries to create a sequence using an iterator of element-like things.
pub fn from_iter(
interner: &I,
elements: impl IntoIterator<Item = impl CastTo<ProgramClause<I>>>
) -> Self
pub fn from_iter(
interner: &I,
elements: impl IntoIterator<Item = impl CastTo<ProgramClause<I>>>
) -> Self
Create a sequence from elements
Create a sequence from a single element.
Trait Implementations
type Result = ProgramClauses<I>
type Result = ProgramClauses<I>
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
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
type Interner = I
type Interner = I
The interner associated with the type.
impl<I: PartialEq + Interner> PartialEq<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialEq,
impl<I: PartialEq + Interner> PartialEq<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialEq,
This method tests for self and other values to be equal, and is used
by ==. Read more
This method tests for !=.
impl<I: PartialOrd + Interner> PartialOrd<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialOrd,
impl<I: PartialOrd + Interner> PartialOrd<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialOrd,
This method returns an ordering between self and other values if one exists. Read more
This method tests less than (for self and other) and is used by the < operator. Read more
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
This method tests greater than (for self and other) and is used by the > operator. Read more
fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
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
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
Mutably borrows from an owned value. Read more
Cast a value to type U using CastTo.
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
Checks whether self and other could possibly match.
Shifts this term in one level of binders.
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
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
Shifts this term out one level of binders.