Struct chalk_ir::QuantifiedWhereClauses
source · pub struct QuantifiedWhereClauses<I: Interner> {
pub(crate) interned: I::InternedQuantifiedWhereClauses,
}
Expand description
List of interned elements.
Fields§
§interned: I::InternedQuantifiedWhereClauses
Implementations§
source§impl<I: Interner> QuantifiedWhereClauses<I>
impl<I: Interner> QuantifiedWhereClauses<I>
sourcepub fn interned(&self) -> &I::InternedQuantifiedWhereClauses
pub fn interned(&self) -> &I::InternedQuantifiedWhereClauses
Get the interned elements.
sourcepub fn as_slice(&self, interner: I) -> &[QuantifiedWhereClause<I>]
pub fn as_slice(&self, interner: I) -> &[QuantifiedWhereClause<I>]
Returns a slice containing the elements.
sourcepub fn at(&self, interner: I, index: usize) -> &QuantifiedWhereClause<I>
pub fn at(&self, interner: I, index: usize) -> &QuantifiedWhereClause<I>
Index into the sequence.
sourcepub fn iter(&self, interner: I) -> Iter<'_, QuantifiedWhereClause<I>>
pub fn iter(&self, interner: I) -> Iter<'_, QuantifiedWhereClause<I>>
Get an iterator over the elements of the sequence.
source§impl<I: Interner> QuantifiedWhereClauses<I>
impl<I: Interner> QuantifiedWhereClauses<I>
sourcepub fn from_fallible<E>(
interner: I,
elements: impl IntoIterator<Item = Result<impl CastTo<QuantifiedWhereClause<I>>, E>>
) -> Result<Self, E>
pub fn from_fallible<E>( interner: I, elements: impl IntoIterator<Item = Result<impl CastTo<QuantifiedWhereClause<I>>, E>> ) -> Result<Self, E>
Tries to create a sequence using an iterator of element-like things.
sourcepub fn from_iter(
interner: I,
elements: impl IntoIterator<Item = impl CastTo<QuantifiedWhereClause<I>>>
) -> Self
pub fn from_iter( interner: I, elements: impl IntoIterator<Item = impl CastTo<QuantifiedWhereClause<I>>> ) -> Self
Create a sequence from elements
sourcepub fn from1(
interner: I,
element: impl CastTo<QuantifiedWhereClause<I>>
) -> Self
pub fn from1( interner: I, element: impl CastTo<QuantifiedWhereClause<I>> ) -> Self
Create a sequence from a single element.
Trait Implementations§
source§impl<I: Clone + Interner> Clone for QuantifiedWhereClauses<I>where
I::InternedQuantifiedWhereClauses: Clone,
impl<I: Clone + Interner> Clone for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Clone,
source§fn clone(&self) -> QuantifiedWhereClauses<I>
fn clone(&self) -> QuantifiedWhereClauses<I>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<I: Interner> Debug for QuantifiedWhereClauses<I>
impl<I: Interner> Debug for QuantifiedWhereClauses<I>
source§impl<I: Interner> HasInterner for QuantifiedWhereClauses<I>
impl<I: Interner> HasInterner for QuantifiedWhereClauses<I>
source§impl<I: Hash + Interner> Hash for QuantifiedWhereClauses<I>where
I::InternedQuantifiedWhereClauses: Hash,
impl<I: Hash + Interner> Hash for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Hash,
source§impl<I: Ord + Interner> Ord for QuantifiedWhereClauses<I>where
I::InternedQuantifiedWhereClauses: Ord,
impl<I: Ord + Interner> Ord for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Ord,
source§fn cmp(&self, other: &QuantifiedWhereClauses<I>) -> Ordering
fn cmp(&self, other: &QuantifiedWhereClauses<I>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl<I: PartialEq + Interner> PartialEq<QuantifiedWhereClauses<I>> for QuantifiedWhereClauses<I>where
I::InternedQuantifiedWhereClauses: PartialEq,
impl<I: PartialEq + Interner> PartialEq<QuantifiedWhereClauses<I>> for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: PartialEq,
source§fn eq(&self, other: &QuantifiedWhereClauses<I>) -> bool
fn eq(&self, other: &QuantifiedWhereClauses<I>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<I: PartialOrd + Interner> PartialOrd<QuantifiedWhereClauses<I>> for QuantifiedWhereClauses<I>where
I::InternedQuantifiedWhereClauses: PartialOrd,
impl<I: PartialOrd + Interner> PartialOrd<QuantifiedWhereClauses<I>> for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: PartialOrd,
source§fn partial_cmp(&self, other: &QuantifiedWhereClauses<I>) -> Option<Ordering>
fn partial_cmp(&self, other: &QuantifiedWhereClauses<I>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
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 moresource§impl<I: Interner> TypeFoldable<I> for QuantifiedWhereClauses<I>
impl<I: Interner> TypeFoldable<I> for QuantifiedWhereClauses<I>
source§fn try_fold_with<E>(
self,
folder: &mut dyn FallibleTypeFolder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self, E>
fn try_fold_with<E>( self, folder: &mut dyn FallibleTypeFolder<I, Error = E>, outer_binder: DebruijnIndex ) -> Result<Self, 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.source§fn fold_with(
self,
folder: &mut dyn TypeFolder<I>,
outer_binder: DebruijnIndex
) -> Self
fn fold_with( self, folder: &mut dyn TypeFolder<I>, outer_binder: DebruijnIndex ) -> Self
A convenient alternative to
try_fold_with
for use with infallible
folders. Do not override this method, to ensure coherence with
try_fold_with
.source§impl<I: Interner> TypeVisitable<I> for QuantifiedWhereClauses<I>
impl<I: Interner> TypeVisitable<I> for QuantifiedWhereClauses<I>
source§fn visit_with<B>(
&self,
visitor: &mut dyn TypeVisitor<I, BreakTy = B>,
outer_binder: DebruijnIndex
) -> ControlFlow<B>
fn visit_with<B>( &self, visitor: &mut dyn TypeVisitor<I, BreakTy = B>, outer_binder: DebruijnIndex ) -> ControlFlow<B>
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.source§impl<I: Interner> Zip<I> for QuantifiedWhereClauses<I>
impl<I: Interner> Zip<I> for QuantifiedWhereClauses<I>
impl<I: Copy + Interner> Copy for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Copy,
impl<I: Eq + Interner> Eq for QuantifiedWhereClauses<I>where I::InternedQuantifiedWhereClauses: Eq,
impl<I: Interner> StructuralEq for QuantifiedWhereClauses<I>
impl<I: Interner> StructuralPartialEq for QuantifiedWhereClauses<I>
Auto Trait Implementations§
impl<I> RefUnwindSafe for QuantifiedWhereClauses<I>where <I as Interner>::InternedQuantifiedWhereClauses: RefUnwindSafe,
impl<I> Send for QuantifiedWhereClauses<I>where <I as Interner>::InternedQuantifiedWhereClauses: Send,
impl<I> Sync for QuantifiedWhereClauses<I>where <I as Interner>::InternedQuantifiedWhereClauses: Sync,
impl<I> Unpin for QuantifiedWhereClauses<I>where <I as Interner>::InternedQuantifiedWhereClauses: Unpin,
impl<I> UnwindSafe for QuantifiedWhereClauses<I>where <I as Interner>::InternedQuantifiedWhereClauses: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T, I> CouldMatch<T> for Twhere
T: Zip<I> + HasInterner<Interner = I> + ?Sized,
I: Interner,
impl<T, I> CouldMatch<T> for Twhere T: Zip<I> + HasInterner<Interner = I> + ?Sized, I: Interner,
source§fn could_match(
&self,
interner: I,
db: &dyn UnificationDatabase<I>,
other: &T
) -> bool
fn could_match( &self, interner: I, db: &dyn UnificationDatabase<I>, other: &T ) -> bool
Checks whether
self
and other
could possibly match.source§impl<T, I> Shift<I> for Twhere
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for Twhere T: TypeFoldable<I>, I: Interner,
source§fn shifted_in(self, interner: I) -> T
fn shifted_in(self, interner: I) -> T
Shifts this term in one level of binders.
source§fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
fn shifted_in_from(self, interner: I, source_binder: DebruijnIndex) -> T
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.source§fn shifted_out_to(
self,
interner: I,
target_binder: DebruijnIndex
) -> Result<T, NoSolution>
fn shifted_out_to( self, interner: I, target_binder: DebruijnIndex ) -> Result<T, 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.source§fn shifted_out(self, interner: I) -> Result<T, NoSolution>
fn shifted_out(self, interner: I) -> Result<T, NoSolution>
Shifts this term out one level of binders.
source§impl<T, I> VisitExt<I> for Twhere
I: Interner,
T: TypeVisitable<I>,
impl<T, I> VisitExt<I> for Twhere I: Interner, T: TypeVisitable<I>,
source§fn has_free_vars(&self, interner: I) -> bool
fn has_free_vars(&self, interner: I) -> bool
Check whether there are free (non-bound) variables.