Struct chalk_ir::QuantifiedWhereClauses
source · [−]pub struct QuantifiedWhereClauses<I: Interner> { /* private fields */ }
Expand description
List of interned elements.
Implementations
sourceimpl<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.
sourceimpl<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
sourceimpl<I: Clone + Interner> Clone for QuantifiedWhereClauses<I> where
I::InternedQuantifiedWhereClauses: Clone,
impl<I: Clone + Interner> Clone for QuantifiedWhereClauses<I> where
I::InternedQuantifiedWhereClauses: Clone,
sourcefn clone(&self) -> QuantifiedWhereClauses<I>
fn clone(&self) -> QuantifiedWhereClauses<I>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<I: Interner> Debug for QuantifiedWhereClauses<I>
impl<I: Interner> Debug for QuantifiedWhereClauses<I>
sourceimpl<I: Interner> HasInterner for QuantifiedWhereClauses<I>
impl<I: Interner> HasInterner for QuantifiedWhereClauses<I>
type Interner = I
type Interner = I
The interner associated with the type.
sourceimpl<I: Hash + Interner> Hash for QuantifiedWhereClauses<I> where
I::InternedQuantifiedWhereClauses: Hash,
impl<I: Hash + Interner> Hash for QuantifiedWhereClauses<I> where
I::InternedQuantifiedWhereClauses: Hash,
sourceimpl<I: Ord + Interner> Ord for QuantifiedWhereClauses<I> where
I::InternedQuantifiedWhereClauses: Ord,
impl<I: Ord + Interner> Ord for QuantifiedWhereClauses<I> where
I::InternedQuantifiedWhereClauses: Ord,
sourcefn cmp(&self, other: &QuantifiedWhereClauses<I>) -> Ordering
fn cmp(&self, other: &QuantifiedWhereClauses<I>) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl<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,
sourcefn 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 ==
. Read more
sourcefn ne(&self, other: &QuantifiedWhereClauses<I>) -> bool
fn ne(&self, other: &QuantifiedWhereClauses<I>) -> bool
This method tests for !=
.
sourceimpl<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,
sourcefn partial_cmp(&self, other: &QuantifiedWhereClauses<I>) -> Option<Ordering>
fn partial_cmp(&self, other: &QuantifiedWhereClauses<I>) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
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 · sourcefn 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 more
sourceimpl<I: Interner> TypeFoldable<I> for QuantifiedWhereClauses<I>
impl<I: Interner> TypeFoldable<I> for QuantifiedWhereClauses<I>
sourcefn fold_with<E>(
self,
folder: &mut dyn TypeFolder<I, Error = E>,
outer_binder: DebruijnIndex
) -> Result<Self, E>
fn fold_with<E>(
self,
folder: &mut dyn TypeFolder<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. Read more
sourceimpl<I: Interner> TypeVisitable<I> for QuantifiedWhereClauses<I>
impl<I: Interner> TypeVisitable<I> for QuantifiedWhereClauses<I>
sourcefn 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. Read more
sourceimpl<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
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Cast for T
impl<T> Cast for T
sourcefn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
fn cast<U>(self, interner: U::Interner) -> U where
Self: CastTo<U>,
U: HasInterner,
Cast a value to type U
using CastTo
.
sourceimpl<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,
sourcefn 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.
sourceimpl<T, I> Shift<I> for T where
T: TypeFoldable<I>,
I: Interner,
impl<T, I> Shift<I> for T where
T: TypeFoldable<I>,
I: Interner,
sourcefn shifted_in(self, interner: I) -> T
fn shifted_in(self, interner: I) -> T
Shifts this term in one level of binders.
sourcefn 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. Read more
sourcefn 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. Read more
sourcefn 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.
sourceimpl<T, I> VisitExt<I> for T where
I: Interner,
T: TypeVisitable<I>,
impl<T, I> VisitExt<I> for T where
I: Interner,
T: TypeVisitable<I>,
sourcefn has_free_vars(&self, interner: I) -> bool
fn has_free_vars(&self, interner: I) -> bool
Check whether there are free (non-bound) variables.