Struct chalk_ir::ProgramClauses [−][src]
pub struct ProgramClauses<I: Interner> { /* fields omitted */ }
Expand description
List of interned elements.
Implementations
impl<I: Interner> ProgramClauses<I>
[src]
impl<I: Interner> ProgramClauses<I>
[src]pub fn interned(&self) -> &I::InternedProgramClauses
[src]
pub fn interned(&self) -> &I::InternedProgramClauses
[src]Get the interned elements.
pub fn as_slice(&self, interner: &I) -> &[ProgramClause<I>]
[src]
pub fn as_slice(&self, interner: &I) -> &[ProgramClause<I>]
[src]Returns a slice containing the elements.
pub fn at(&self, interner: &I, index: usize) -> &ProgramClause<I>
[src]
pub fn at(&self, interner: &I, index: usize) -> &ProgramClause<I>
[src]Index into the sequence.
pub fn iter(&self, interner: &I) -> Iter<'_, ProgramClause<I>>
[src]
pub fn iter(&self, interner: &I) -> Iter<'_, ProgramClause<I>>
[src]Get an iterator over the elements of the sequence.
impl<I: Interner> ProgramClauses<I>
[src]
impl<I: Interner> ProgramClauses<I>
[src]pub fn from_fallible<E>(
interner: &I,
elements: impl IntoIterator<Item = Result<impl CastTo<ProgramClause<I>>, E>>
) -> Result<Self, E>
[src]
pub fn from_fallible<E>(
interner: &I,
elements: impl IntoIterator<Item = Result<impl CastTo<ProgramClause<I>>, E>>
) -> Result<Self, E>
[src]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
[src]
pub fn from_iter(
interner: &I,
elements: impl IntoIterator<Item = impl CastTo<ProgramClause<I>>>
) -> Self
[src]Create a sequence from elements
pub fn from1(interner: &I, element: impl CastTo<ProgramClause<I>>) -> Self
[src]
pub fn from1(interner: &I, element: impl CastTo<ProgramClause<I>>) -> Self
[src]Create a sequence from a single element.
Trait Implementations
impl<I: Clone + Interner> Clone for ProgramClauses<I> where
I::InternedProgramClauses: Clone,
[src]
impl<I: Clone + Interner> Clone for ProgramClauses<I> where
I::InternedProgramClauses: Clone,
[src]fn clone(&self) -> ProgramClauses<I>
[src]
fn clone(&self) -> ProgramClauses<I>
[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]Performs copy-assignment from source
. Read more
impl<I: Interner> Debug for ProgramClauses<I>
[src]
impl<I: Interner> Debug for ProgramClauses<I>
[src]impl<I: Interner> Fold<I> for ProgramClauses<I>
[src]
impl<I: Interner> Fold<I> for ProgramClauses<I>
[src]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
fn fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]
fn fold_with<'i>(
self,
folder: &mut dyn Folder<'i, I>,
outer_binder: DebruijnIndex
) -> Fallible<Self::Result> where
I: 'i,
[src]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
impl<I: Interner> HasInterner for ProgramClauses<I>
[src]
impl<I: Interner> HasInterner for ProgramClauses<I>
[src]type Interner = I
type Interner = I
The interner associated with the type.
impl<I: Hash + Interner> Hash for ProgramClauses<I> where
I::InternedProgramClauses: Hash,
[src]
impl<I: Hash + Interner> Hash for ProgramClauses<I> where
I::InternedProgramClauses: Hash,
[src]impl<I: Ord + Interner> Ord for ProgramClauses<I> where
I::InternedProgramClauses: Ord,
[src]
impl<I: Ord + Interner> Ord for ProgramClauses<I> where
I::InternedProgramClauses: Ord,
[src]impl<I: PartialEq + Interner> PartialEq<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialEq,
[src]
impl<I: PartialEq + Interner> PartialEq<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialEq,
[src]fn eq(&self, other: &ProgramClauses<I>) -> bool
[src]
fn eq(&self, other: &ProgramClauses<I>) -> bool
[src]This method tests for self
and other
values to be equal, and is used
by ==
. Read more
fn ne(&self, other: &ProgramClauses<I>) -> bool
[src]
fn ne(&self, other: &ProgramClauses<I>) -> bool
[src]This method tests for !=
.
impl<I: PartialOrd + Interner> PartialOrd<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialOrd,
[src]
impl<I: PartialOrd + Interner> PartialOrd<ProgramClauses<I>> for ProgramClauses<I> where
I::InternedProgramClauses: PartialOrd,
[src]fn partial_cmp(&self, other: &ProgramClauses<I>) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &ProgramClauses<I>) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl<I: Interner> Visit<I> for ProgramClauses<I>
[src]
impl<I: Interner> Visit<I> for ProgramClauses<I>
[src]fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]
fn visit_with<'i, B>(
&self,
visitor: &mut dyn Visitor<'i, I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B> where
I: 'i,
[src]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
impl<I: Interner> Zip<I> for ProgramClauses<I>
[src]
impl<I: Interner> Zip<I> for ProgramClauses<I>
[src]impl<I: Copy + Interner> Copy for ProgramClauses<I> where
I::InternedProgramClauses: Copy,
[src]
I::InternedProgramClauses: Copy,
impl<I: Eq + Interner> Eq for ProgramClauses<I> where
I::InternedProgramClauses: Eq,
[src]
I::InternedProgramClauses: Eq,
impl<I: Interner> StructuralEq for ProgramClauses<I>
[src]
impl<I: Interner> StructuralPartialEq for ProgramClauses<I>
[src]
Auto Trait Implementations
impl<I> RefUnwindSafe for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: RefUnwindSafe,
<I as Interner>::InternedProgramClauses: RefUnwindSafe,
impl<I> Send for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: Send,
<I as Interner>::InternedProgramClauses: Send,
impl<I> Sync for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: Sync,
<I as Interner>::InternedProgramClauses: Sync,
impl<I> Unpin for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: Unpin,
<I as Interner>::InternedProgramClauses: Unpin,
impl<I> UnwindSafe for ProgramClauses<I> where
<I as Interner>::InternedProgramClauses: UnwindSafe,
<I as Interner>::InternedProgramClauses: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Cast for T
[src]
impl<T> Cast for T
[src]fn cast<U>(self, interner: &U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]
fn cast<U>(self, interner: &U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
[src]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,
[src]
impl<T, I> CouldMatch<T> for T where
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
[src]pub fn could_match(&Self, &I, &dyn UnificationDatabase<I>, &T) -> bool
[src]
pub fn could_match(&Self, &I, &dyn UnificationDatabase<I>, &T) -> bool
[src]Checks whether self
and other
could possibly match.
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
[src]
impl<T, I> Shift<I> for T where
T: Fold<I>,
I: Interner,
[src]pub fn shifted_in(Self, &I) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in(Self, &I) -> <T as Fold<I>>::Result
[src]Shifts this term in one level of binders.
pub fn shifted_in_from(Self, &I, DebruijnIndex) -> <T as Fold<I>>::Result
[src]
pub fn shifted_in_from(Self, &I, DebruijnIndex) -> <T as Fold<I>>::Result
[src]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
pub fn shifted_out_to(
Self,
&I,
DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out_to(
Self,
&I,
DebruijnIndex
) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]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
pub fn shifted_out(Self, &I) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]
pub fn shifted_out(Self, &I) -> Result<<T as Fold<I>>::Result, NoSolution>
[src]Shifts this term out one level of binders.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more